| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xmds (0) - 1 freq xmd (1) - 1 freq xmos (1) - 1 freq xmas (1) - 48 freq puds (2) - 1 freq reds (2) - 5 freq m's (2) - 2 freq wmd (2) - 1 freq xmsv (2) - 1 freq sids (2) - 1 freq ads (2) - 9 freq sods (2) - 10 freq gmdx (2) - 1 freq xcd (2) - 1 freq gads (2) - 8 freq teds (2) - 1 freq odds (2) - 91 freq dods (2) - 8 freq mss (2) - 2 freq aids (2) - 9 freq cods (2) - 2 freq huds (2) - 6 freq xmvp (2) - 1 freq mlds (2) - 1 freq bmd (2) - 1 freq |
xmds (0) - 1 freq xmd (2) - 1 freq xmas (2) - 48 freq xmos (2) - 1 freq mods (3) - 4 freq amids (3) - 1 freq mids (3) - 70 freq meds (3) - 3 freq ghds (4) - 1 freq xd (4) - 4 freq neds (4) - 34 freq amd (4) - 2 freq emus (4) - 1 freq tids (4) - 2 freq geds (4) - 1 freq hads (4) - 2 freq rods (4) - 26 freq emdy (4) - 4 freq guds (4) - 1 freq mls (4) - 2 freq lods (4) - 1 freq pmd (4) - 1 freq bmxs (4) - 1 freq pms (4) - 7 freq xs (4) - 2 freq |
SoundEx code - X532 xmds - 1 freq |
MetaPhone code - SMTS sumbiddie's - 1 freq somedy's - 2 freq semmits - 9 freq smiddy's - 2 freq sumbudy's - 1 freq smowts - 1 freq some'dy's - 2 freq sumdy's - 3 freq summits - 5 freq smoots - 2 freq simmets - 2 freq sommat's - 2 freq smitts - 2 freq sumbiddy's - 1 freq simmet's - 1 freq somedie's - 1 freq sombdy's - 1 freq smaads - 1 freq seimits - 1 freq smits - 1 freq smiddies - 1 freq sumdys - 1 freq somedae's - 1 freq smootie's - 6 freq 'smootie's - 1 freq xmds - 1 freq |
XMDS |
| Time to execute Levenshtein function - 0.236966 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.444014 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.031964 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.041116 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.001303 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. |