| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| modler (0) - 1 freq moder (1) - 2 freq modular (2) - 1 freq sodjer (2) - 7 freq model (2) - 78 freq rodger (2) - 4 freq motley (2) - 2 freq ardler (2) - 1 freq holler (2) - 2 freq modern (2) - 144 freq goller (2) - 7 freq moyle (2) - 6 freq fowler (2) - 2 freq cobler (2) - 1 freq moles (2) - 2 freq mddle (2) - 1 freq monger (2) - 1 freq modes (2) - 2 freq sadler (2) - 1 freq mowser (2) - 12 freq modules (2) - 2 freq moger (2) - 1 freq mother (2) - 97 freq sodger (2) - 114 freq rowler (2) - 2 freq |
modler (0) - 1 freq moder (2) - 2 freq modular (2) - 1 freq madder (3) - 5 freq midder (3) - 64 freq modules (3) - 2 freq modere (3) - 1 freq sadler (3) - 1 freq miller (3) - 56 freq model (3) - 78 freq meeler (3) - 1 freq module (3) - 9 freq ardler (3) - 1 freq voller (4) - 2 freq millar (4) - 11 freq ouler (4) - 8 freq godley (4) - 1 freq modail (4) - 3 freq owler (4) - 5 freq dueler (4) - 1 freq hooler (4) - 1 freq malir (4) - 1 freq boiler (4) - 4 freq mover (4) - 1 freq modem (4) - 2 freq |
SoundEx code - M346 metalwurk - 2 freq middler's - 1 freq muddlers - 1 freq metalwarkin - 1 freq modular - 1 freq meddlers - 1 freq modler - 1 freq |
MetaPhone code - MTLR modular - 1 freq modler - 1 freq |
MODLER |
| Time to execute Levenshtein function - 0.238998 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.349371 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.032070 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.045514 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.000889 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. |