| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| premier (0) - 7 freq creamier (2) - 1 freq prefer (2) - 41 freq primer (2) - 10 freq bremner (2) - 3 freq peerier (2) - 17 freq bremmer (2) - 1 freq faemier (2) - 2 freq premium (2) - 2 freq premises (2) - 14 freq preser (2) - 1 freq prettier (2) - 2 freq peedier (2) - 7 freq phemie (2) - 2 freq prenter (2) - 7 freq premiered (2) - 1 freq promis (3) - 7 freq predict (3) - 4 freq spreader (3) - 3 freq redder (3) - 15 freq pepper (3) - 83 freq refer (3) - 37 freq prefert (3) - 2 freq preten (3) - 2 freq première (3) - 1 freq |
premier (0) - 7 freq primer (2) - 10 freq primar (3) - 1 freq premiered (3) - 1 freq premium (3) - 2 freq preser (3) - 1 freq prefer (3) - 41 freq creamier (3) - 1 freq peerier (3) - 17 freq primsie (4) - 1 freq premnay (4) - 1 freq promise (4) - 117 freq paramour (4) - 1 freq tremor (4) - 3 freq prayer (4) - 95 freq praper (4) - 1 freq paerer (4) - 1 freq dramer (4) - 2 freq prime (4) - 36 freq dreamer (4) - 2 freq prepaar (4) - 1 freq proaper (4) - 3 freq proper (4) - 170 freq proker (4) - 1 freq primary (4) - 166 freq |
SoundEx code - P656 primary - 166 freq primrose - 13 freq premièred - 1 freq première - 1 freq primaries - 4 freq prime-rib - 1 freq primar - 1 freq primark - 6 freq primroses - 3 freq primordial - 1 freq premier - 7 freq primer - 10 freq pre-norse - 1 freq paramour - 1 freq primarie - 3 freq paranormal - 1 freq premiered - 1 freq preemary - 1 freq primarily - 2 freq premiership - 2 freq premiersportstv - 3 freq |
MetaPhone code - PRMR primary - 166 freq première - 1 freq primar - 1 freq premier - 7 freq primer - 10 freq paramour - 1 freq primarie - 3 freq preemary - 1 freq |
PREMIER |
| Time to execute Levenshtein function - 0.175632 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.312361 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.027482 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.036816 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.000838 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. |