| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mcfables (0) - 1 freq fables (2) - 10 freq mccabes (2) - 1 freq cables (2) - 6 freq fable (3) - 8 freq fabled (3) - 3 freq mcfarlanes (3) - 1 freq gables (3) - 4 freq mumbles (3) - 4 freq parables (3) - 9 freq measles (3) - 5 freq miralles (3) - 2 freq carles (3) - 6 freq cable (3) - 12 freq enables (3) - 1 freq scraibles (3) - 1 freq charles (3) - 51 freq cradles (3) - 6 freq chablis (3) - 1 freq mccabe (3) - 2 freq vocables (3) - 1 freq cobbles (3) - 10 freq coagles (3) - 1 freq stables (3) - 18 freq mcarle (3) - 2 freq |
mcfables (0) - 1 freq mccabes (4) - 1 freq cables (4) - 6 freq fables (4) - 10 freq vocables (5) - 1 freq chablis (5) - 1 freq cobbles (5) - 10 freq marbles (5) - 5 freq cobles (5) - 2 freq mccabe's (5) - 4 freq mcfarlan (5) - 10 freq scraibles (5) - 1 freq mcfarlanes (5) - 1 freq mumbles (5) - 4 freq nables (6) - 1 freq mcfadden (6) - 2 freq scales (6) - 22 freq mochles (6) - 7 freq mcphails (6) - 3 freq michaels (6) - 1 freq mobiles (6) - 5 freq mable (6) - 2 freq scuffles (6) - 2 freq foibles (6) - 2 freq muckles (6) - 1 freq |
SoundEx code - M211 mcfables - 1 freq misbehave - 1 freq misbehaves - 2 freq misbehavin - 1 freq mis-behaviour - 1 freq mspaberdeen - 12 freq missbabington - 3 freq |
MetaPhone code - MKFBLS mcfables - 1 freq |
MCFABLES |
| Time to execute Levenshtein function - 0.208503 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.362790 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.028507 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.037869 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.000952 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. |