| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| minority (0) - 154 freq 'minority (1) - 3 freq monority (1) - 1 freq 'minority' (2) - 3 freq majority (2) - 70 freq minoritie (2) - 30 freq €œminority (2) - 3 freq €˜minority (2) - 1 freq moorit (3) - 8 freq minors (3) - 1 freq minnit (3) - 5 freq minorities (3) - 17 freq enormity (3) - 3 freq binort (3) - 1 freq midrit (3) - 1 freq priority (3) - 25 freq midori (3) - 2 freq monolith (3) - 2 freq mancity (3) - 2 freq minitt (3) - 1 freq hilarity (3) - 5 freq minite (3) - 1 freq mintit (3) - 28 freq minnits (3) - 1 freq minit (3) - 20 freq |
minority (0) - 154 freq monority (1) - 1 freq 'minority (2) - 3 freq minoritie (2) - 30 freq majority (3) - 70 freq minor (4) - 15 freq minit (4) - 20 freq minite (4) - 1 freq minitt (4) - 1 freq minorca (4) - 1 freq maturity (4) - 1 freq seniority (4) - 1 freq mancity (4) - 2 freq manorial (4) - 1 freq minty (4) - 15 freq mindit (4) - 162 freq mintit (4) - 28 freq minnit (4) - 5 freq minorities (4) - 17 freq minors (4) - 1 freq moorit (4) - 8 freq 'minority' (4) - 3 freq €œminority (4) - 3 freq binort (4) - 1 freq €˜minority (4) - 1 freq |
SoundEx code - M563 maynard - 1 freq maynard's - 1 freq manured - 3 freq 'minority' - 3 freq mannered - 1 freq minorities - 17 freq minoritie - 30 freq minority - 154 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 mannered - 1 freq minoritie - 30 freq minority - 154 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.202944 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.405350 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.029479 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.037566 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.000882 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. |