Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
minoritised (0) - 2 freq minoriteesed (2) - 1 freq minoritie (2) - 30 freq minorities (2) - 17 freq prioritised (3) - 2 freq majoritie (4) - 3 freq motorised (4) - 1 freq prioritise (4) - 1 freq minimises (4) - 1 freq minority (4) - 156 freq majorities (4) - 4 freq memorised (4) - 2 freq digitised (4) - 1 freq sanitised (4) - 2 freq 'minorities' (4) - 1 freq mobilised (4) - 1 freq minimise (4) - 1 freq profitised (4) - 2 freq 'minority' (5) - 3 freq notified (5) - 2 freq miscried (5) - 1 freq minutie (5) - 3 freq glorified (5) - 6 freq minted (5) - 10 freq mortified (5) - 20 freq |
minoritised (0) - 2 freq minoriteesed (2) - 1 freq minorities (3) - 17 freq minoritie (4) - 30 freq prioritised (5) - 2 freq majorities (6) - 4 freq sanitised (6) - 2 freq 'minorities' (6) - 1 freq minority (6) - 156 freq memorised (6) - 2 freq motorised (6) - 1 freq snorted (7) - 7 freq advertised (7) - 8 freq minnits (7) - 1 freq monority (7) - 1 freq materialised (7) - 1 freq modernised (7) - 1 freq generalised (7) - 1 freq imprivysed (7) - 1 freq nottesed (7) - 1 freq imoressed (7) - 1 freq minties (7) - 10 freq mintioned (7) - 2 freq mortifeed (7) - 1 freq energised (7) - 3 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 - MNRTST minoriteesed - 1 freq minoritised - 2 freq |
MINORITISED |
Time to execute Levenshtein function - 0.551072 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.645170 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.075985 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.077318 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.000900 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. |