| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| envy (0) - 25 freq endy (1) - 8 freq env (1) - 1 freq evy (1) - 1 freq enjy (1) - 2 freq eny (1) - 7 freq eqvy (1) - 1 freq invy (1) - 2 freq engy (1) - 2 freq enry (1) - 1 freq enin (2) - 4 freq enes (2) - 2 freq enjoy (2) - 336 freq ev (2) - 3 freq erly (2) - 3 freq bevvy (2) - 20 freq enns (2) - 11 freq anly (2) - 1 freq infy (2) - 1 freq en (2) - 618 freq ens (2) - 16 freq enc (2) - 1 freq vy (2) - 3 freq edgy (2) - 7 freq heavy (2) - 196 freq |
envy (0) - 25 freq env (1) - 1 freq invy (1) - 2 freq envie (2) - 2 freq nv (2) - 5 freq navy (2) - 45 freq nva (2) - 2 freq engy (2) - 2 freq enry (2) - 1 freq enjy (2) - 2 freq eqvy (2) - 1 freq evy (2) - 1 freq endy (2) - 8 freq eny (2) - 7 freq enh (3) - 1 freq inny (3) - 3 freq enda (3) - 2 freq andy (3) - 151 freq qnv (3) - 1 freq nove (3) - 1 freq ent (3) - 3 freq ende (3) - 3 freq enye (3) - 1 freq eve (3) - 80 freq enow (3) - 5 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 freq enu'f - 1 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 - 911 freq eneugh - 49 freq envy - 25 freq envie - 2 freq enuf - 13 freq enu'f - 1 freq enugh - 2 freq eneuf - 1 freq enogh - 20 freq enough-a - 1 freq 'enough - 1 freq enuff - 12 freq €œenough - 1 freq enof - 5 freq env - 1 freq enoff - 1 freq |
ENVY |
| Time to execute Levenshtein function - 0.214652 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.388065 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.029212 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.037980 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.000921 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. |