| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| molière (0) - 22 freq molière's (2) - 2 freq valère (3) - 1 freq motirs (4) - 2 freq molipi's (4) - 1 freq moniave (4) - 3 freq fordèrt (4) - 14 freq eldèrs (4) - 5 freq bolivars (4) - 1 freq molip (4) - 1 freq molipi (4) - 10 freq motòr (4) - 2 freq mire (4) - 14 freq monitors (4) - 4 freq mediocre (4) - 1 freq fordèr (4) - 46 freq folkore (4) - 1 freq guldèrt (4) - 2 freq foliage (4) - 2 freq more (4) - 465 freq mooie (4) - 3 freq olive (4) - 16 freq fordèrs (4) - 3 freq olite (4) - 3 freq litre (4) - 11 freq |
molière (0) - 22 freq molière's (4) - 2 freq valère (4) - 1 freq multure (6) - 1 freq murdèr (6) - 4 freq malcware (6) - 1 freq mulcaire (6) - 4 freq gruyère (6) - 1 freq salève (6) - 1 freq malir (6) - 1 freq military (6) - 43 freq guldèr (6) - 1 freq mettèr (6) - 7 freq motòr (6) - 2 freq moira (7) - 88 freq première (7) - 1 freq solitrie (7) - 1 freq solitary (7) - 15 freq libre (7) - 1 freq mòr (7) - 2 freq meisure (7) - 20 freq flör (7) - 9 freq motir (7) - 12 freq meelmore (7) - 1 freq calibre (7) - 3 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 |
MOLIÈRE |
| Time to execute Levenshtein function - 0.173827 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.369915 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.029706 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.038118 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.000884 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. |