| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| merits (0) - 7 freq merit (1) - 16 freq befits (2) - 3 freq crits (2) - 1 freq merdils (2) - 1 freq maries (2) - 60 freq maris (2) - 1 freq perils (2) - 2 freq hermits (2) - 1 freq erts (2) - 11 freq merks (2) - 45 freq mercats (2) - 12 freq mnits (2) - 1 freq merries (2) - 6 freq rits (2) - 1 freq medics (2) - 4 freq smerts (2) - 1 freq memries (2) - 9 freq teri's (2) - 1 freq mertins (2) - 2 freq heris (2) - 1 freq meets (2) - 33 freq meats (2) - 2 freq megrims (2) - 1 freq terts (2) - 2 freq |
merits (0) - 7 freq marts (2) - 3 freq merit (2) - 16 freq meinits (3) - 12 freq berts (3) - 1 freq merkis (3) - 2 freq grits (3) - 1 freq perts (3) - 6 freq merkets (3) - 3 freq aerts (3) - 1 freq terts (3) - 2 freq meenits (3) - 244 freq brits (3) - 5 freq mortis (3) - 2 freq marit (3) - 1 freq merles (3) - 1 freq mere's (3) - 1 freq mercs (3) - 1 freq veritas (3) - 1 freq mets (3) - 1 freq herts (3) - 119 freq meats (3) - 2 freq derts (3) - 2 freq ments (3) - 1 freq erts (3) - 11 freq |
SoundEx code - M632 mortgage - 11 freq mortclaith - 2 freq mort-kist - 1 freq mortakty - 1 freq merits - 7 freq murdoch - 18 freq mortice - 4 freq 'mort-safes' - 1 freq morticia - 3 freq mortgages - 4 freq mairtha's - 1 freq mort-kloot - 1 freq mairieds - 1 freq mortis - 2 freq marts - 3 freq murdoch's - 2 freq murdochs - 3 freq martij - 1 freq murdieston - 1 freq murdos - 1 freq meritocracy - 1 freq merridge - 1 freq mirds - 1 freq mortscotty - 1 freq muirtsmith - 1 freq martyguigan - 1 freq mritchiemp - 1 freq mradclyffe - 6 freq myrds - 1 freq murdo's - 1 freq mayordcsdc - 2 freq |
MetaPhone code - MRTS merits - 7 freq mortice - 4 freq mairieds - 1 freq mortis - 2 freq marts - 3 freq murdos - 1 freq mirds - 1 freq myrds - 1 freq murdo's - 1 freq |
MERITS |
| Time to execute Levenshtein function - 0.184444 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.342893 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.027726 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.036733 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.000863 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. |