Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
modified (0) - 2 freq modifies (1) - 1 freq modifeed (1) - 1 freq codified (1) - 4 freq modifier (1) - 1 freq notified (2) - 2 freq mortified (2) - 20 freq modifiers (2) - 4 freq fortified (3) - 4 freq mairied (3) - 10 freq toddied (3) - 1 freq modvated (3) - 1 freq monifieth (3) - 1 freq mortifeed (3) - 1 freq setified (3) - 2 freq verified (3) - 2 freq mummified (3) - 1 freq mystified (3) - 2 freq magnified (3) - 2 freq maitied (3) - 1 freq mid-field (3) - 1 freq defied (3) - 5 freq midfield (3) - 18 freq monied (3) - 3 freq bodied (3) - 2 freq |
modified (0) - 2 freq modifeed (1) - 1 freq modifier (2) - 1 freq codified (2) - 4 freq modifies (2) - 1 freq midfield (4) - 18 freq miffed (4) - 4 freq defied (4) - 5 freq modifiers (4) - 4 freq mediated (4) - 2 freq notified (4) - 2 freq mortified (4) - 20 freq modelled (5) - 1 freq ratified (5) - 9 freq unified (5) - 3 freq middie (5) - 7 freq madrid (5) - 8 freq mudged (5) - 1 freq bodied (5) - 2 freq muffed (5) - 1 freq ossified (5) - 1 freq amplified (5) - 1 freq pacified (5) - 1 freq motioned (5) - 1 freq mortifeed (5) - 1 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 - MTFT modified - 2 freq modifeed - 1 freq motivate - 2 freq |
MODIFIED |
Time to execute Levenshtein function - 0.302791 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.579237 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.027846 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.078646 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.001204 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. |