| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| envyfu (0) - 1 freq envy (2) - 25 freq bellyfu (3) - 1 freq enye (3) - 1 freq enuf (3) - 13 freq naffu (3) - 1 freq enou (3) - 1 freq enjye (3) - 1 freq enjy (3) - 2 freq env (3) - 1 freq eyfi (3) - 1 freq joyfu (3) - 10 freq eqvy (3) - 1 freq tentfu (3) - 1 freq endy (3) - 8 freq eny (3) - 7 freq nebfu (3) - 1 freq enof (3) - 5 freq enry (3) - 1 freq evy (3) - 1 freq neivefu (3) - 1 freq ensyde (3) - 4 freq evoygu (3) - 1 freq eesefu (3) - 3 freq eneuf (3) - 1 freq |
envyfu (0) - 1 freq navefu (3) - 1 freq neivefu (3) - 1 freq envy (3) - 25 freq enuff (4) - 12 freq enoff (4) - 1 freq eneuf (4) - 1 freq enof (4) - 5 freq invyte (4) - 1 freq enu'f (4) - 1 freq envious (4) - 2 freq envie (4) - 2 freq invy (4) - 2 freq nebfu (4) - 1 freq envied (4) - 3 freq nfu (4) - 1 freq env (4) - 1 freq naffu (4) - 1 freq enuf (4) - 13 freq vevf (5) - 1 freq nvq (5) - 6 freq anof (5) - 4 freq nuf (5) - 1 freq neive-fu (5) - 1 freq naafi (5) - 1 freq |
SoundEx code - E511 envyfu - 1 freq empie-free - 1 freq enviable - 1 freq enfeebled - 1 freq |
MetaPhone code - ENFF envyfu - 1 freq enoughuff - 1 freq |
ENVYFU |
| Time to execute Levenshtein function - 0.187842 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.355410 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.028112 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.038388 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.000920 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. |