Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mortice (0) - 4 freq morrice (1) - 150 freq mornice (1) - 2 freq morice (1) - 1 freq morrices (2) - 6 freq mootie (2) - 16 freq notice (2) - 175 freq morticia (2) - 3 freq portico (2) - 1 freq morlich (2) - 3 freq portie (2) - 3 freq mortimer (2) - 3 freq sortie (2) - 2 freq mortify (2) - 1 freq montie (2) - 1 freq tortie (2) - 5 freq dortie (2) - 3 freq motrice (2) - 1 freq nottice (2) - 4 freq motie (2) - 1 freq cornice (2) - 1 freq fortie (2) - 5 freq mortis (2) - 2 freq gtice (3) - 1 freq fortune (3) - 87 freq |
mortice (0) - 4 freq morticia (2) - 3 freq morice (2) - 1 freq morrice (2) - 150 freq mornice (2) - 2 freq portico (3) - 1 freq mortis (3) - 2 freq mortify (3) - 1 freq martial (4) - 5 freq mastic (4) - 2 freq mertin (4) - 2 freq maritime (4) - 4 freq marcie (4) - 1 freq martyne (4) - 1 freq maurice (4) - 4 freq mystic (4) - 9 freq mort (4) - 3 freq martino (4) - 1 freq mortem (4) - 1 freq morocco (4) - 1 freq martian (4) - 7 freq martin (4) - 47 freq artic (4) - 2 freq martij (4) - 1 freq mortar (4) - 9 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 |
MORTICE |
Time to execute Levenshtein function - 0.199768 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.392567 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.027629 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.039606 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.000918 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. |