Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
primar (0) - 1 freq primal (1) - 3 freq primer (1) - 10 freq primary (1) - 173 freq prima (1) - 7 freq primark (1) - 6 freq rimer (2) - 1 freq primus (2) - 6 freq prior (2) - 18 freq briar (2) - 1 freq primp (2) - 5 freq prime (2) - 36 freq prma (2) - 1 freq weimar (2) - 1 freq primed (2) - 3 freq prim (2) - 2 freq pima (2) - 1 freq 'primary (2) - 1 freq primly (2) - 1 freq cromar (2) - 1 freq primarie (2) - 3 freq friar (2) - 1 freq draar (3) - 6 freq caiman (3) - 1 freq preat (3) - 1 freq |
primar (0) - 1 freq primary (1) - 173 freq primer (1) - 10 freq primarie (2) - 3 freq primark (2) - 6 freq prima (2) - 7 freq primal (2) - 3 freq premier (3) - 7 freq primed (3) - 3 freq 'primary (3) - 1 freq preemary (3) - 1 freq cromar (3) - 1 freq primly (3) - 1 freq prim (3) - 2 freq primus (3) - 6 freq prma (3) - 1 freq prior (3) - 18 freq rimer (3) - 1 freq primp (3) - 5 freq prime (3) - 36 freq praver (4) - 1 freq prepaar (4) - 1 freq paramour (4) - 1 freq armur (4) - 1 freq primula (4) - 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 |
PRIMAR |
Time to execute Levenshtein function - 0.231462 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.374697 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.030980 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.040349 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.000850 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. |