| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| e-mail (0) - 42 freq e-mails (1) - 6 freq email (1) - 50 freq entail (2) - 3 freq emsail (2) - 5 freq gmail (2) - 1 freq emails (2) - 14 freq mail (2) - 54 freq e-mailed (2) - 1 freq e-mailin (2) - 1 freq emailt (2) - 2 freq eil (3) - 10 freq mael (3) - 2 freq earl (3) - 31 freq moil (3) - 1 freq tel-tail (3) - 1 freq eemage (3) - 18 freq emaaq (3) - 1 freq samain (3) - 1 freq emailed (3) - 7 freq emailin (3) - 1 freq frail (3) - 18 freq sammil (3) - 1 freq gail (3) - 3 freq smael (3) - 3 freq |
e-mail (0) - 42 freq email (2) - 50 freq e-mails (2) - 6 freq e-mailin (3) - 1 freq -mile (3) - 1 freq mail (3) - 54 freq e-mailed (3) - 1 freq gmail (3) - 1 freq ormal (4) - 1 freq smael (4) - 3 freq emily (4) - 11 freq enml (4) - 1 freq hamil (4) - 2 freq aetmael (4) - 3 freq tamil (4) - 1 freq mal (4) - 2 freq udmal (4) - 1 freq kamil (4) - 1 freq maol (4) - 1 freq emsail (4) - 5 freq mael (4) - 2 freq emails (4) - 14 freq emailt (4) - 2 freq moil (4) - 1 freq entail (4) - 3 freq |
SoundEx code - E540 email - 50 freq een'll - 3 freq e-mail - 42 freq emily - 11 freq een'il - 2 freq eynhallow - 2 freq emilio - 1 freq emilia - 4 freq emlaw - 1 freq emili - 1 freq enml - 1 freq |
MetaPhone code - EML email - 50 freq e-mail - 42 freq emily - 11 freq emilio - 1 freq emilia - 4 freq emlaw - 1 freq emili - 1 freq embla - 2 freq |
E-MAIL |
| Time to execute Levenshtein function - 0.231981 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.366164 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.028236 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.037649 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.000815 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. |