| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mortified (0) - 20 freq mortifeed (1) - 1 freq fortified (1) - 4 freq mystified (2) - 2 freq modified (2) - 2 freq horrified (2) - 7 freq notified (2) - 2 freq fortifed (2) - 1 freq mortgaged (3) - 1 freq modifier (3) - 1 freq modifies (3) - 1 freq gratified (3) - 1 freq doitrified (3) - 2 freq codified (3) - 4 freq modifeed (3) - 1 freq mortify (3) - 1 freq setified (3) - 2 freq mummified (3) - 1 freq justified (3) - 9 freq mortice (3) - 4 freq glorified (3) - 6 freq mortifyin (3) - 1 freq terrified (3) - 28 freq motioned (3) - 1 freq horrifeed (3) - 3 freq |
mortified (0) - 20 freq mortifeed (1) - 1 freq fortified (2) - 4 freq mystified (3) - 2 freq fortifed (3) - 1 freq gratified (4) - 1 freq mortifyin (4) - 1 freq ratified (4) - 9 freq mortify (4) - 1 freq mystifeed (4) - 1 freq modified (4) - 2 freq horrified (4) - 7 freq notified (4) - 2 freq horrifeed (5) - 3 freq motioned (5) - 1 freq martyred (5) - 3 freq mortimer (5) - 3 freq settified (5) - 1 freq morticia (5) - 3 freq terrified (5) - 28 freq verified (5) - 2 freq magnified (5) - 2 freq certifies (5) - 1 freq setified (5) - 2 freq modifeed (5) - 1 freq |
SoundEx code - M631 mortified - 20 freq mortifeed - 1 freq mortification - 2 freq mortifyin - 1 freq mirthfu - 1 freq mortify - 1 freq martybullywee - 2 freq mredbyrne - 1 freq mrdaveturner - 1 freq |
MetaPhone code - MRTFT mortified - 20 freq mortifeed - 1 freq |
MORTIFIED |
| Time to execute Levenshtein function - 0.197375 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.358486 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.027596 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.059041 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.000894 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. |