Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
primer (0) - 10 freq rimer (1) - 1 freq primar (1) - 1 freq prime (1) - 36 freq primed (1) - 3 freq proker (2) - 1 freq grime (2) - 5 freq prized (2) - 3 freq riper (2) - 4 freq rymer (2) - 1 freq primped (2) - 3 freq griter (2) - 1 freq brier (2) - 5 freq prismed (2) - 2 freq pride (2) - 168 freq palmer (2) - 3 freq prior (2) - 18 freq praver (2) - 1 freq crime (2) - 70 freq privet (2) - 9 freq proper (2) - 184 freq paiper (2) - 7 freq primly (2) - 1 freq glimer (2) - 1 freq pricey (2) - 4 freq |
primer (0) - 10 freq primar (1) - 1 freq primary (2) - 173 freq primed (2) - 3 freq premier (2) - 7 freq rimer (2) - 1 freq prime (2) - 36 freq primly (3) - 1 freq proper (3) - 184 freq primp (3) - 5 freq lorimer (3) - 30 freq prefer (3) - 41 freq primarie (3) - 3 freq primus (3) - 6 freq praver (3) - 1 freq praper (3) - 1 freq primal (3) - 3 freq prior (3) - 18 freq prima (3) - 7 freq rymer (3) - 1 freq prizery (3) - 1 freq preser (3) - 1 freq proker (3) - 1 freq dramer (3) - 2 freq prim (3) - 2 freq |
SoundEx code - P656 primary - 173 freq primrose - 13 freq premièred - 1 freq première - 1 freq primaries - 4 freq 'primary - 1 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 - 173 freq première - 1 freq 'primary - 1 freq primar - 1 freq premier - 7 freq primer - 10 freq paramour - 1 freq primarie - 3 freq preemary - 1 freq |
PRIMER |
Time to execute Levenshtein function - 0.520910 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 - 1.302792 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.088988 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.112523 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.001199 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. |