Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
monority (0) - 1 freq minority (1) - 156 freq majority (2) - 71 freq monolith (2) - 2 freq 'minority (2) - 3 freq moorit (2) - 8 freq manorial (3) - 1 freq priority (3) - 25 freq coorit (3) - 2 freq moorie (3) - 5 freq mobility (3) - 6 freq moory (3) - 3 freq concaity (3) - 1 freq monty (3) - 23 freq maturity (3) - 1 freq monteith (3) - 2 freq mancity (3) - 2 freq monarchy (3) - 8 freq motorist (3) - 2 freq 'minority' (3) - 3 freq €œminority (3) - 3 freq €˜minority (3) - 1 freq monopoly (3) - 3 freq moort (3) - 4 freq motorists (3) - 3 freq |
monority (0) - 1 freq minority (1) - 156 freq minoritie (3) - 30 freq moorit (3) - 8 freq 'minority (3) - 3 freq majority (3) - 71 freq moort (4) - 4 freq monty (4) - 23 freq seniority (4) - 1 freq manorial (4) - 1 freq maturity (4) - 1 freq mancity (4) - 2 freq monolith (4) - 2 freq mindit (5) - 163 freq ignoret (5) - 4 freq manor (5) - 4 freq moonlit (5) - 5 freq meenity (5) - 2 freq minorca (5) - 1 freq menit (5) - 2 freq mennit (5) - 1 freq unrit (5) - 1 freq monroe (5) - 2 freq majoritie (5) - 3 freq mendit (5) - 9 freq |
SoundEx code - M563 maynard - 1 freq maynard's - 1 freq manured - 3 freq 'minority' - 3 freq minority - 156 freq mannered - 1 freq minorities - 17 freq minoritie - 30 freq maun-read - 1 freq monority - 1 freq 'minorities' - 1 freq 'minority - 3 freq €˜minority - 1 freq €œminority - 3 freq minoriteesed - 1 freq minoritised - 2 freq mannert - 1 freq |
MetaPhone code - MNRT maynard - 1 freq manured - 3 freq 'minority' - 3 freq minority - 156 freq mannered - 1 freq minoritie - 30 freq maun-read - 1 freq monority - 1 freq 'minority - 3 freq €˜minority - 1 freq €œminority - 3 freq mannert - 1 freq |
MONORITY |
Time to execute Levenshtein function - 0.212129 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.396076 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.028867 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.038370 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.000894 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. |