| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mailr (0) - 1 freq mails (1) - 3 freq mail (1) - 54 freq maiur (1) - 1 freq mair (1) - 6172 freq failt (2) - 7 freq maner (2) - 4 freq nair (2) - 2 freq matlo (2) - 1 freq nails (2) - 80 freq email (2) - 51 freq dair (2) - 11 freq maiter (2) - 71 freq jail (2) - 49 freq matur (2) - 1 freq milk (2) - 244 freq air (2) - 1001 freq mail't (2) - 1 freq haill (2) - 411 freq bail (2) - 14 freq maide (2) - 46 freq emails (2) - 14 freq yaila (2) - 1 freq mal (2) - 2 freq manly (2) - 7 freq |
mailr (0) - 1 freq malir (2) - 1 freq maiur (2) - 1 freq mair (2) - 6172 freq mails (2) - 3 freq mail (2) - 54 freq maol (3) - 1 freq mirr (3) - 3 freq mily (3) - 2 freq dailer (3) - 1 freq sailor (3) - 20 freq muild (3) - 4 freq muir (3) - 77 freq milo (3) - 1 freq tailor (3) - 28 freq manor (3) - 4 freq mael (3) - 2 freq mayor (3) - 3 freq matr (3) - 7 freq malt (3) - 19 freq lair (3) - 58 freq mir (3) - 5 freq emailt (3) - 2 freq mar (3) - 16 freq mailers (3) - 1 freq |
SoundEx code - M460 mailr - 1 freq miller - 56 freq malaria - 3 freq molière - 22 freq millar - 11 freq milroy - 3 freq malir - 1 freq meeler - 1 freq melro - 1 freq |
MetaPhone code - MLR mailr - 1 freq miller - 56 freq malaria - 3 freq molière - 22 freq millar - 11 freq milroy - 3 freq malir - 1 freq meeler - 1 freq melro - 1 freq |
MAILR |
| Time to execute Levenshtein function - 0.215483 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.339255 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.031682 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.037739 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.001018 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. |