| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| minority (0) - 156 freq monority (1) - 1 freq 'minority (1) - 3 freq majority (2) - 71 freq €œminority (2) - 3 freq 'minority' (2) - 3 freq minoritie (2) - 30 freq €˜minority (2) - 1 freq minnits (3) - 1 freq minorca (3) - 1 freq midori (3) - 2 freq minnit (3) - 5 freq sincerity (3) - 3 freq minite (3) - 1 freq seniority (3) - 1 freq binort (3) - 1 freq mintit (3) - 28 freq mancity (3) - 2 freq minitt (3) - 1 freq hilarity (3) - 5 freq monolith (3) - 2 freq minty (3) - 15 freq manorial (3) - 1 freq minorities (3) - 17 freq minor (3) - 15 freq |
minority (0) - 156 freq monority (1) - 1 freq minoritie (2) - 30 freq 'minority (2) - 3 freq majority (3) - 71 freq manorial (4) - 1 freq minorities (4) - 17 freq minitt (4) - 1 freq minor (4) - 15 freq minty (4) - 15 freq minors (4) - 1 freq minit (4) - 20 freq mancity (4) - 2 freq maturity (4) - 1 freq moorit (4) - 8 freq mindit (4) - 163 freq midrit (4) - 1 freq minorca (4) - 1 freq €œminority (4) - 3 freq €˜minority (4) - 1 freq 'minority' (4) - 3 freq mintit (4) - 28 freq minnit (4) - 5 freq binort (4) - 1 freq minite (4) - 1 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 |
MINORITY |
| Time to execute Levenshtein function - 0.391569 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.736596 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.077742 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.088863 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.000936 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. |