| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yardarm (0) - 1 freq yarder (2) - 1 freq yairdairm (2) - 1 freq wardar (2) - 1 freq waarm (3) - 81 freq larder (3) - 9 freq sarwar (3) - 3 freq marram (3) - 2 freq forearm (3) - 1 freq earworm (3) - 1 freq carpark (3) - 5 freq oardird (3) - 1 freq farder (3) - 31 freq yakcam (3) - 35 freq karam (3) - 1 freq yard (3) - 43 freq aidam (3) - 1 freq ardern (3) - 1 freq bandara (3) - 11 freq zadar (3) - 4 freq warfare (3) - 1 freq garnard (3) - 1 freq oardert (3) - 3 freq ladar (3) - 1 freq adam (3) - 189 freq |
yardarm (0) - 1 freq yairdairm (2) - 1 freq yarder (3) - 1 freq yirders (4) - 2 freq oardert (4) - 3 freq oarders (4) - 2 freq radars (4) - 1 freq radar (4) - 11 freq ardern (4) - 1 freq oardird (4) - 1 freq earworm (4) - 1 freq oardir (4) - 1 freq oarder (4) - 5 freq wardar (4) - 1 freq yards (5) - 24 freq madrum (5) - 1 freq padaro (5) - 1 freq 'adam (5) - 2 freq alarm (5) - 42 freq oarwark (5) - 1 freq byordar (5) - 1 freq harder (5) - 67 freq draem (5) - 15 freq arrum (5) - 7 freq ordert (5) - 12 freq |
SoundEx code - Y636 yairdairm - 1 freq yirders - 2 freq yarder - 1 freq yardarm - 1 freq |
MetaPhone code - YRTRM yairdairm - 1 freq yardarm - 1 freq |
YARDARM |
| Time to execute Levenshtein function - 0.251561 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.419960 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.028651 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.038149 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001095 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |