| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| meeler (0) - 1 freq meelers (1) - 1 freq peeler (1) - 3 freq deefer (2) - 1 freq meeded (2) - 1 freq meesel (2) - 2 freq meeeh (2) - 3 freq wheeler (2) - 4 freq peever (2) - 1 freq lee-er (2) - 1 freq peeled (2) - 17 freq menner (2) - 4 freq miller (2) - 56 freq efler (2) - 1 freq memmer (2) - 35 freq merle (2) - 4 freq neeper (2) - 5 freq meiner (2) - 2 freq meedle (2) - 1 freq metter (2) - 53 freq keeled (2) - 5 freq feeger (2) - 1 freq melter (2) - 1 freq eeger (2) - 1 freq meeeem (2) - 1 freq |
meeler (0) - 1 freq peeler (2) - 3 freq meelers (2) - 1 freq melro (3) - 1 freq dealer (3) - 15 freq melea (3) - 3 freq meter (3) - 8 freq mele (3) - 1 freq malir (3) - 1 freq healer (3) - 1 freq meyer (3) - 5 freq meel (3) - 3 freq meneer (3) - 1 freq melee (3) - 3 freq meelie (3) - 3 freq mailr (3) - 1 freq beyler (3) - 1 freq meesery (3) - 5 freq meyle (3) - 1 freq dueler (3) - 1 freq melter (3) - 1 freq efler (3) - 1 freq modler (3) - 1 freq metier (3) - 1 freq raeler (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 |
MEELER |
| Time to execute Levenshtein function - 0.191365 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.391324 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.027508 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.037720 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.000873 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. |