| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muttontief (0) - 11 freq actiontiff (4) - 1 freq attintien (4) - 6 freq mutton (4) - 24 freq huttonian (4) - 1 freq mctoonie (4) - 2 freq montie (4) - 1 freq untentie (4) - 2 freq buttonin (4) - 4 freq buttoned (4) - 11 freq motif (5) - 1 freq twentiet (5) - 3 freq cottonwid (5) - 1 freq auctoritie (5) - 1 freq pittodrie (5) - 16 freq thoctie (5) - 1 freq untied (5) - 7 freq stentie (5) - 1 freq moontide (5) - 1 freq atotie (5) - 1 freq commontie (5) - 2 freq sunties (5) - 2 freq butterie (5) - 7 freq motie (5) - 1 freq buttrie (5) - 4 freq |
muttontief (0) - 11 freq mittent (6) - 1 freq mutton (6) - 24 freq attintien (6) - 6 freq muttin (7) - 3 freq mutatit (7) - 1 freq muttert (7) - 25 freq attintion (7) - 3 freq attentik (7) - 1 freq mitton (7) - 1 freq mutant (7) - 3 freq attention (7) - 183 freq mittened (7) - 1 freq attentive (7) - 1 freq mutterit (7) - 2 freq mutation (7) - 1 freq montie (7) - 1 freq untentie (7) - 2 freq mctoonie (7) - 2 freq huttonian (7) - 1 freq actiontiff (7) - 1 freq buttonin (7) - 4 freq buttoned (7) - 11 freq twantie (8) - 2 freq muntin (8) - 11 freq |
SoundEx code - M353 mathematies - 2 freq maddened - 1 freq mutant - 3 freq mathematics - 7 freq mid-twentieth - 2 freq maidenheid - 1 freq mid-winter - 4 freq moutent - 3 freq mathematical - 4 freq midwinter - 3 freq mutton-dummy - 1 freq motioned - 1 freq mathematick - 1 freq maidenhoods - 1 freq moat-and-castle-biggin - 1 freq mid-twinties - 1 freq mittened - 1 freq mathematician - 1 freq mittent - 1 freq muttontief - 11 freq maitand - 1 freq maidenhead - 1 freq maidenwatford - 2 freq meattwenty - 1 freq mtmdavbzku - 1 freq mattmaytum - 3 freq |
MetaPhone code - MTNTF muttontief - 11 freq |
MUTTONTIEF |
| Time to execute Levenshtein function - 0.733045 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 - 1.297276 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.084991 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.093051 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.000848 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. |