| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yonks (0) - 6 freq honks (1) - 1 freq yolks (1) - 2 freq onks (1) - 1 freq yanks (1) - 13 freq donks (1) - 5 freq yons (1) - 6 freq gonks (1) - 1 freq yokks (1) - 2 freq monks (1) - 23 freq yon's (1) - 103 freq zonks (1) - 1 freq bunks (2) - 4 freq yous (2) - 179 freq yond (2) - 1 freq bones (2) - 61 freq howks (2) - 7 freq monke (2) - 1 freq hanks (2) - 2 freq don's (2) - 8 freq bouks (2) - 8 freq yona (2) - 12 freq rocks (2) - 88 freq yerks (2) - 1 freq yytks (2) - 1 freq |
yonks (0) - 6 freq yanks (1) - 13 freq onks (1) - 1 freq monks (2) - 23 freq yon's (2) - 103 freq nooks (2) - 2 freq noks (2) - 1 freq yokks (2) - 2 freq zonks (2) - 1 freq gonks (2) - 1 freq yolks (2) - 2 freq donks (2) - 5 freq honks (2) - 1 freq yons (2) - 6 freq rouks (3) - 1 freq yin's (3) - 42 freq dooks (3) - 9 freq yins (3) - 467 freq tanks (3) - 32 freq douks (3) - 1 freq tinks (3) - 28 freq pooks (3) - 1 freq soaks (3) - 4 freq neuks (3) - 30 freq jouks (3) - 10 freq |
SoundEx code - Y520 yince - 391 freq yins - 467 freq young - 1106 freq yon's - 103 freq 'yon's - 26 freq yins' - 2 freq yin's - 42 freq yawns - 1 freq yung - 72 freq yang - 3 freq yangzhuo - 1 freq yonkee - 1 freq yankee - 7 freq yoams - 2 freq ymiz - 1 freq ymca - 2 freq young' - 1 freq yank - 8 freq yoons - 8 freq yanks - 13 freq yeng - 2 freq yoonne's - 1 freq yonks - 6 freq ying - 46 freq yun's - 16 freq y-young - 1 freq yangzi - 1 freq yons - 6 freq yaince - 1 freq yince- - 1 freq yankie - 3 freq €˜young - 3 freq 'young - 1 freq 'yon's' - 1 freq ync - 1 freq “yonÂ’s - 1 freq yums - 3 freq yammas - 1 freq yummage - 1 freq young” - 1 freq yonÂ’s - 2 freq ynjw - 1 freq ymhqa - 1 freq yncw - 1 freq yuns - 1 freq |
MetaPhone code - YNKS yanks - 13 freq yankies - 1 freq yonks - 6 freq yangzi - 1 freq |
YONKS |
| Time to execute Levenshtein function - 0.209640 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.338170 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.027909 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.040241 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.000879 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. |