| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mirdit (0) - 1 freq mirdin (1) - 1 freq mindit (1) - 163 freq wirdit (1) - 1 freq smirdit (1) - 1 freq yirdit (1) - 29 freq mirkit (1) - 1 freq dirdit (1) - 5 freq widdit (2) - 2 freq mistit (2) - 1 freq firgit (2) - 13 freq lardit (2) - 1 freq markit (2) - 18 freq birsit (2) - 1 freq mirrie (2) - 7 freq yirdie (2) - 2 freq midst (2) - 34 freq airmit (2) - 4 freq merrit (2) - 6 freq merkit (2) - 32 freq wirmit (2) - 1 freq mairit (2) - 11 freq moldit (2) - 2 freq wirdie (2) - 17 freq midrit (2) - 1 freq |
mirdit (0) - 1 freq yirdit (2) - 29 freq dirdit (2) - 5 freq smirdit (2) - 1 freq mirkit (2) - 1 freq wirdit (2) - 1 freq mindit (2) - 163 freq mirdin (2) - 1 freq mairkit (3) - 4 freq herdit (3) - 8 freq mardi (3) - 2 freq myndit (3) - 28 freq mindet (3) - 2 freq marrit (3) - 1 freq weirdit (3) - 5 freq muirfit (3) - 1 freq margit (3) - 32 freq buirdit (3) - 1 freq murnit (3) - 1 freq mendit (3) - 9 freq mirlt (3) - 1 freq beirdit (3) - 1 freq gairdit (3) - 6 freq fairdit (3) - 1 freq mird (3) - 6 freq |
SoundEx code - M633 mort-heid - 1 freq mertet - 1 freq meredith - 1 freq mirdit - 1 freq marriedatfirstsight - 1 freq mareetoddmsp - 8 freq marytait - 1 freq |
MetaPhone code - MRTT mertet - 1 freq mirdit - 1 freq marytait - 1 freq |
MIRDIT |
| Time to execute Levenshtein function - 0.315827 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.682658 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.037329 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.073811 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.000829 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. |