Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
motivation (0) - 11 freq motivations (1) - 2 freq motivatin (1) - 2 freq mitigation (2) - 2 freq motivational (2) - 4 freq mutilation (2) - 2 freq motivator (2) - 1 freq sitivation (2) - 1 freq sitiation (3) - 1 freq litigation (3) - 1 freq maturation (3) - 1 freq molocation (3) - 1 freq notation (3) - 1 freq mediation (3) - 4 freq mutation (3) - 1 freq moderation (3) - 4 freq medication (3) - 8 freq meditation (3) - 12 freq domination (3) - 1 freq nomination (3) - 1 freq motivated (3) - 4 freq seetivation (3) - 1 freq cultivation (3) - 2 freq derivation (3) - 2 freq motivate (3) - 2 freq |
motivation (0) - 11 freq motivatin (1) - 2 freq motivations (2) - 2 freq sitivation (3) - 1 freq motivator (3) - 1 freq mutilation (3) - 2 freq mitigation (3) - 2 freq motivational (3) - 4 freq motivated (4) - 4 freq motivate (4) - 2 freq mutation (4) - 1 freq seetivation (4) - 1 freq maturation (4) - 1 freq sitiation (5) - 1 freq derivation (5) - 2 freq estimation (5) - 1 freq notation (5) - 1 freq sitivautioun (5) - 6 freq rotation (5) - 1 freq cultivation (5) - 2 freq novation (5) - 1 freq molocation (5) - 1 freq mediation (5) - 4 freq medication (5) - 8 freq moderation (5) - 4 freq |
SoundEx code - M313 motivation - 11 freq mud-bath - 1 freq motivational - 4 freq modified - 2 freq motivator - 1 freq modvated - 1 freq motivated - 4 freq modifeed - 1 freq motivations - 2 freq motivatin - 2 freq matthew-fitt's - 1 freq motivate - 2 freq mdavidson - 8 freq |
MetaPhone code - MTFXN motivation - 11 freq |
MOTIVATION |
Time to execute Levenshtein function - 0.214591 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.359915 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.027237 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.037747 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.000943 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. |