| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emailt (0) - 2 freq email (1) - 51 freq emails (1) - 14 freq ettilt (2) - 25 freq hailt (2) - 6 freq emsail (2) - 5 freq mail (2) - 54 freq amaist (2) - 24 freq emily (2) - 11 freq emili (2) - 1 freq skailt (2) - 32 freq mail't (2) - 1 freq mails (2) - 3 freq mairt (2) - 5 freq e-mails (2) - 6 freq gmail (2) - 1 freq smaill (2) - 1 freq bailt (2) - 1 freq mailr (2) - 1 freq emailed (2) - 7 freq 'maist (2) - 5 freq railt (2) - 1 freq marlt (2) - 2 freq remaint (2) - 1 freq email's (2) - 1 freq |
emailt (0) - 2 freq emails (2) - 14 freq malt (2) - 19 freq email (2) - 51 freq emit (3) - 4 freq smilt (3) - 1 freq emailin (3) - 1 freq sailt (3) - 2 freq mait (3) - 84 freq marlt (3) - 2 freq failt (3) - 7 freq malti (3) - 1 freq malty (3) - 6 freq malta (3) - 2 freq ecaalt (3) - 1 freq dailt (3) - 1 freq railt (3) - 1 freq nailt (3) - 2 freq maist (3) - 1959 freq ailt (3) - 3 freq mail't (3) - 1 freq mails (3) - 3 freq mailoot (3) - 3 freq melt (3) - 41 freq emili (3) - 1 freq |
SoundEx code - E543 emulate - 2 freq emailaddress - 27 freq emailt - 2 freq e-mailed - 1 freq emailed - 7 freq emulating - 1 freq emiltschepp - 1 freq |
MetaPhone code - EMLT emulate - 2 freq emailt - 2 freq e-mailed - 1 freq emailed - 7 freq |
EMAILT |
| Time to execute Levenshtein function - 0.878205 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 - 1.998877 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.185984 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.117770 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.001113 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. |