| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mail-order (0) - 1 freq maimorie (4) - 12 freq milder (4) - 2 freq tailoreen (4) - 2 freq kailyarders (4) - 1 freq mattforde (4) - 1 freq mait-gier (4) - 1 freq maimories (4) - 4 freq hairder (4) - 16 freq camcorder (4) - 1 freq mairower (4) - 11 freq tail-tree (4) - 1 freq tailored (4) - 3 freq pre-order (4) - 2 freq disorder (4) - 7 freq wird-order (4) - 3 freq mallord (4) - 1 freq weel-ordert (4) - 1 freq kaim-ower (4) - 1 freq mairker (4) - 1 freq mildew (5) - 2 freq mairiet (5) - 4 freq mailr (5) - 1 freq eilder (5) - 1 freq calorie (5) - 1 freq |
mail-order (0) - 1 freq mallord (6) - 1 freq pre-order (6) - 2 freq weel-ordert (6) - 1 freq milder (6) - 2 freq all-roonder (7) - 1 freq kailyarders (7) - 1 freq larder (7) - 9 freq mulder (7) - 1 freq bluborder (7) - 3 freq mallard (7) - 1 freq mallards (7) - 2 freq mordor (7) - 3 freq wird-order (7) - 3 freq mairker (7) - 1 freq murder (7) - 86 freq camcorder (7) - 1 freq hairder (7) - 16 freq mairower (7) - 11 freq tail-tree (7) - 1 freq tailored (7) - 3 freq disorder (7) - 7 freq mait-gier (7) - 1 freq mairied (8) - 10 freq aulder (8) - 245 freq |
SoundEx code - M463 m'lord - 1 freq mallord - 1 freq mallards - 2 freq mail-order - 1 freq mallard - 1 freq mill-rodden - 1 freq millartap - 1 freq mlretnphtm - 1 freq |
MetaPhone code - MLRTR mail-order - 1 freq |
MAIL-ORDER |
| Time to execute Levenshtein function - 0.233613 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.370439 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.029862 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.041626 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.000944 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. |