| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emdy (0) - 4 freq eddy (1) - 1 freq empy (1) - 6 freq emty (1) - 3 freq evdy (1) - 7 freq endy (1) - 8 freq embdy (1) - 14 freq erly (2) - 3 freq erdly (2) - 1 freq eny (2) - 7 freq edj (2) - 1 freq ready (2) - 443 freq erd (2) - 11 freq eed (2) - 11 freq ady (2) - 2 freq abdy (2) - 31 freq evy (2) - 1 freq amy (2) - 32 freq eeday (2) - 1 freq peedy (2) - 121 freq heidy (2) - 16 freq eday (2) - 5 freq elxy (2) - 1 freq reddy (2) - 17 freq remedy (2) - 4 freq |
emdy (0) - 4 freq amd (2) - 2 freq eddy (2) - 1 freq ymd (2) - 2 freq mdi (2) - 1 freq embdy (2) - 14 freq md (2) - 10 freq emty (2) - 3 freq empy (2) - 6 freq evdy (2) - 7 freq endy (2) - 8 freq ezd (3) - 1 freq dy (3) - 236 freq ed (3) - 53 freq madey (3) - 1 freq emery (3) - 1 freq needy (3) - 7 freq emyf (3) - 1 freq teady (3) - 1 freq emoe (3) - 1 freq tidy (3) - 50 freq imed (3) - 1 freq xmd (3) - 1 freq ead (3) - 1 freq pmd (3) - 1 freq |
SoundEx code - E530 end - 1198 freq emit - 4 freq enmity - 4 freq eynd - 1 freq endow - 2 freq entae - 43 freq ennit - 2 freq ent - 3 freq einaudi - 1 freq eened - 3 freq endy - 8 freq enda - 2 freq eind - 1 freq end' - 1 freq 'enewed - 1 freq ende - 3 freq emty - 3 freq een-twa - 2 freq een-at - 1 freq endue - 1 freq emdy - 4 freq emmett - 2 freq eyemouth - 1 freq eyemooth - 1 freq |
MetaPhone code - EMT embdy - 14 freq emit - 4 freq embed - 2 freq emty - 3 freq embodie - 1 freq emdy - 4 freq emmett - 2 freq |
EMDY |
| Time to execute Levenshtein function - 0.203408 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.377422 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.027500 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.036495 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.000813 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. |