| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mutilation (0) - 2 freq mutation (2) - 1 freq mutilatit (2) - 1 freq mitigation (2) - 2 freq motivation (2) - 11 freq litigation (3) - 1 freq humiliation (3) - 5 freq motivations (3) - 2 freq automation (3) - 1 freq sitiation (3) - 1 freq mediation (3) - 4 freq ventilation (3) - 2 freq sitivation (3) - 1 freq maturation (3) - 1 freq motivatin (3) - 2 freq estimation (3) - 1 freq medication (3) - 8 freq meditation (3) - 12 freq cultivation (3) - 2 freq retaliation (4) - 2 freq masticatin (4) - 1 freq manipulation (4) - 2 freq ruinaetion (4) - 1 freq population (4) - 85 freq derivation (4) - 2 freq |
mutilation (0) - 2 freq mutation (3) - 1 freq mitigation (3) - 2 freq motivation (3) - 11 freq mutilatit (3) - 1 freq motivatin (4) - 2 freq maturation (4) - 1 freq tiltin (5) - 6 freq meditation (5) - 12 freq retaliation (5) - 2 freq milton (5) - 4 freq stilton (5) - 2 freq mutton (5) - 24 freq muttin (5) - 3 freq magilton (5) - 2 freq imitation (5) - 4 freq medication (5) - 8 freq sitiation (5) - 1 freq humiliation (5) - 5 freq estimation (5) - 1 freq motivations (5) - 2 freq mediation (5) - 4 freq sitivation (5) - 1 freq ventilation (5) - 2 freq litigation (5) - 1 freq |
SoundEx code - M343 mutilatit - 1 freq midlothian - 20 freq metaility - 1 freq matilda - 372 freq matilda's - 25 freq 'matilda - 8 freq mottled - 2 freq modellit - 1 freq muddled - 4 freq metalheid - 3 freq modelled - 1 freq modulates - 1 freq modality - 2 freq middleton - 7 freq modelt - 1 freq muddelt - 1 freq mutilation - 2 freq madlad - 1 freq |
MetaPhone code - MTLXN mutilation - 2 freq |
MUTILATION |
| Time to execute Levenshtein function - 0.234906 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.452849 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.027957 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.037134 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. |