| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enuf (0) - 13 freq enuff (1) - 12 freq nuf (1) - 1 freq eneuf (1) - 1 freq enof (1) - 5 freq epuf (1) - 1 freq venue (2) - 14 freq erun (2) - 2 freq qnu (2) - 1 freq enns (2) - 11 freq auf (2) - 13 freq onus (2) - 3 freq enew (2) - 2 freq enoo (2) - 8 freq ens (2) - 16 freq end (2) - 1198 freq eaux (2) - 2 freq eng (2) - 10 freq dnlf (2) - 1 freq eno (2) - 9 freq egf (2) - 1 freq en' (2) - 5 freq menu (2) - 39 freq enna (2) - 11 freq cauf (2) - 10 freq |
enuf (0) - 13 freq eneuf (1) - 1 freq enof (1) - 5 freq nuf (1) - 1 freq nf (2) - 2 freq anof (2) - 4 freq epuf (2) - 1 freq enuff (2) - 12 freq nui (3) - 1 freq etf (3) - 1 freq engy (3) - 2 freq env (3) - 1 freq eiff (3) - 1 freq ef (3) - 14 freq enow (3) - 5 freq ense (3) - 15 freq nufc (3) - 6 freq nun (3) - 9 freq reuf (3) - 2 freq enc (3) - 1 freq endy (3) - 8 freq wouf (3) - 12 freq endue (3) - 1 freq envy (3) - 25 freq unul (3) - 1 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 freq empy - 6 freq eneuf - 1 freq enuff - 12 freq emva - 1 freq enof - 5 freq env - 1 freq emyf - 1 freq eiemv - 1 freq enoff - 1 freq |
MetaPhone code - ENF enough - 883 freq eneugh - 49 freq envy - 25 freq envie - 2 freq enuf - 13 freq enugh - 2 freq eneuf - 1 freq enogh - 20 freq enough-a - 1 freq 'enough - 1 freq enuff - 12 freq enof - 5 freq env - 1 freq enoff - 1 freq |
ENUF |
| Time to execute Levenshtein function - 0.213676 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.342914 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.027151 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.037403 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.000802 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. |