| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enem (0) - 2 freq nem (1) - 53 freq ene (1) - 40 freq enew (1) - 2 freq enes (1) - 2 freq enemy (1) - 38 freq tned (2) - 1 freq krem (2) - 1 freq nvm (2) - 1 freq even (2) - 2669 freq eened (2) - 3 freq feem (2) - 11 freq byenem (2) - 1 freq gem (2) - 24 freq envy (2) - 25 freq rnez (2) - 1 freq ine (2) - 3 freq eng (2) - 10 freq eyne (2) - 5 freq nemd (2) - 1 freq 'nemm (2) - 2 freq nxm (2) - 1 freq enye (2) - 1 freq edam (2) - 45 freq inemy (2) - 8 freq |
enem (0) - 2 freq enemy (1) - 38 freq nem (1) - 53 freq unum (2) - 1 freq nm (2) - 2 freq enemie (2) - 7 freq inemy (2) - 8 freq nym (2) - 1 freq onm (2) - 1 freq nom (2) - 2 freq nim (2) - 9 freq neem (2) - 22 freq naem (2) - 48 freq enew (2) - 2 freq enes (2) - 2 freq ene (2) - 40 freq vem (3) - 1 freq nei (3) - 1 freq nec (3) - 2 freq eam (3) - 7 freq nme (3) - 2 freq denim (3) - 9 freq ane (3) - 2140 freq erum (3) - 1 freq nek (3) - 2 freq |
SoundEx code - E550 e'enin - 3 freq enemy - 38 freq ennin - 2 freq een-an - 1 freq enin - 4 freq eenin - 5 freq enemie - 7 freq eomin - 1 freq eenan - 1 freq en'in - 5 freq enihin - 1 freq eenou-an - 2 freq einen - 1 freq eamin - 1 freq ehman - 1 freq enem - 2 freq enyhin - 1 freq eamonn - 9 freq enenoo - 8 freq |
MetaPhone code - ENM enemy - 38 freq enemie - 7 freq enem - 2 freq |
ENEM |
| Time to execute Levenshtein function - 0.227767 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.508482 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.061675 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.038489 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.000846 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. |