| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emailed (0) - 7 freq e-mailed (1) - 1 freq mailed (1) - 2 freq mniled (2) - 1 freq marled (2) - 2 freq skailed (2) - 39 freq maimed (2) - 2 freq emailt (2) - 2 freq email's (2) - 1 freq trailed (2) - 17 freq flailed (2) - 2 freq retailed (2) - 1 freq smiled (2) - 232 freq nailed (2) - 16 freq enabled (2) - 1 freq detailed (2) - 15 freq exiled (2) - 6 freq email (2) - 50 freq empied (2) - 3 freq ailed (2) - 2 freq tailed (2) - 7 freq demained (2) - 1 freq jailed (2) - 1 freq emailin (2) - 1 freq remained (2) - 17 freq |
emailed (0) - 7 freq mailed (1) - 2 freq e-mailed (2) - 1 freq emails (3) - 14 freq failed (3) - 50 freq emailin (3) - 1 freq tailed (3) - 7 freq ailed (3) - 2 freq eagled (3) - 1 freq jailed (3) - 1 freq wailed (3) - 4 freq mild (3) - 40 freq moild (3) - 1 freq muild (3) - 4 freq railed (3) - 2 freq sailed (3) - 32 freq empied (3) - 3 freq hailed (3) - 14 freq ealled (3) - 1 freq smiled (3) - 232 freq marled (3) - 2 freq email (3) - 50 freq maimed (3) - 2 freq emailt (3) - 2 freq nailed (3) - 16 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 |
EMAILED |
| Time to execute Levenshtein function - 0.214859 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.380665 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.027464 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.037656 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.000867 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. |