| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enemie (0) - 7 freq enemies (1) - 36 freq nemme (2) - 9 freq eelie (2) - 1 freq elegie (2) - 3 freq exemin (2) - 1 freq onesie (2) - 1 freq enem (2) - 2 freq envie (2) - 2 freq phemie (2) - 2 freq eneaise (2) - 1 freq dcemie (2) - 1 freq inimie (2) - 2 freq eenie (2) - 4 freq eemis (2) - 10 freq inemies (2) - 3 freq deemie (2) - 3 freq everie (2) - 4 freq anelie (2) - 25 freq entrie (2) - 5 freq enemas (2) - 1 freq eerie (2) - 34 freq jeemie (2) - 61 freq enemy (2) - 37 freq ermie (2) - 1 freq |
enemie (0) - 7 freq enemy (2) - 37 freq inimie (2) - 2 freq anemia (2) - 1 freq enem (2) - 2 freq enemies (2) - 36 freq inemy (3) - 8 freq anelie (3) - 25 freq name (3) - 1202 freq enemas (3) - 1 freq nemea (3) - 9 freq ermie (3) - 1 freq deemie (3) - 3 freq niemi (3) - 1 freq jeemie (3) - 61 freq nme (3) - 2 freq anaemia (3) - 1 freq inemies (3) - 3 freq onesie (3) - 1 freq aname (3) - 1 freq nemme (3) - 9 freq nem (3) - 51 freq envie (3) - 2 freq eenie (3) - 4 freq eneaise (3) - 1 freq |
SoundEx code - E550 e'enin - 1 freq enemy - 37 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 - 37 freq enemie - 7 freq enem - 2 freq |
ENEMIE |
| Time to execute Levenshtein function - 0.197958 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.352467 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.027300 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.038811 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.000854 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. |