| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mortis (0) - 2 freq morris (1) - 14 freq moots (2) - 3 freq sortit (2) - 51 freq hornis (2) - 2 freq fortin (2) - 1 freq lordis (2) - 3 freq moreas (2) - 1 freq morcas (2) - 1 freq moutit (2) - 1 freq gorjis (2) - 1 freq cornis (2) - 1 freq murgis (2) - 1 freq sortie (2) - 2 freq mossis (2) - 1 freq markis (2) - 1 freq morvin (2) - 2 freq norris (2) - 1 freq poltis (2) - 1 freq dortie (2) - 3 freq mootie (2) - 16 freq multis (2) - 2 freq merkis (2) - 2 freq hartis (2) - 1 freq morn's (2) - 49 freq |
mortis (0) - 2 freq morris (2) - 14 freq marts (2) - 4 freq monts (3) - 5 freq mortify (3) - 1 freq merits (3) - 7 freq mertins (3) - 2 freq martij (3) - 1 freq mortem (3) - 1 freq mertin (3) - 2 freq sorts (3) - 71 freq mort (3) - 3 freq mortice (3) - 4 freq mores (3) - 1 freq morns (3) - 7 freq mortal (3) - 54 freq mortals (3) - 11 freq mentis (3) - 1 freq marris (3) - 2 freq motts (3) - 1 freq ports (3) - 10 freq mantis (3) - 2 freq martins (3) - 2 freq moras (3) - 1 freq montes (3) - 1 freq |
SoundEx code - M632 mortgage - 12 freq mortclaith - 2 freq mort-kist - 1 freq mortakty - 1 freq marts - 4 freq mortgaged - 1 freq mort-saufs - 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 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 marts - 4 freq merits - 7 freq mortice - 4 freq mairieds - 1 freq mortis - 2 freq murdos - 1 freq mirds - 1 freq myrds - 1 freq murdo's - 1 freq |
MORTIS |
| Time to execute Levenshtein function - 0.250744 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.415380 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.030010 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.037619 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.000952 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. |