| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| minorities (0) - 17 freq minoritie (1) - 30 freq minoritised (2) - 2 freq 'minorities' (2) - 1 freq majorities (2) - 4 freq minties (3) - 10 freq inimities (3) - 1 freq priorities (3) - 19 freq minoriteesed (3) - 1 freq majoritie (3) - 3 freq autorities (3) - 2 freq minority (3) - 154 freq intries (4) - 1 freq ninevites (4) - 2 freq sindries (4) - 1 freq vanities (4) - 1 freq owthorities (4) - 2 freq minors (4) - 1 freq similarities (4) - 8 freq northies (4) - 9 freq forties (4) - 4 freq uinitie (4) - 1 freq charities (4) - 4 freq maimories (4) - 4 freq deformities (4) - 1 freq |
minorities (0) - 17 freq minoritie (2) - 30 freq majorities (3) - 4 freq minoritised (3) - 2 freq minoriteesed (4) - 1 freq minority (4) - 154 freq 'minorities' (4) - 1 freq minties (4) - 10 freq minors (5) - 1 freq impurities (5) - 2 freq monority (5) - 1 freq menties (5) - 1 freq minutes (5) - 188 freq mortis (5) - 2 freq minnits (5) - 1 freq amenities (5) - 4 freq majoritie (5) - 3 freq priorities (5) - 19 freq inimities (5) - 1 freq autorities (5) - 2 freq migrates (5) - 1 freq nories (6) - 25 freq asperities (6) - 1 freq densities (6) - 1 freq norries (6) - 5 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 - MNRTS maynard's - 1 freq minorities - 17 freq 'minorities' - 1 freq |
MINORITIES |
| Time to execute Levenshtein function - 0.255219 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.396614 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.027795 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.040792 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.000871 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. |