| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| primarily (0) - 2 freq primarie (2) - 3 freq primaries (2) - 4 freq primary (2) - 173 freq 'primary (3) - 1 freq primark (3) - 6 freq summarily (3) - 1 freq primly (3) - 1 freq primar (3) - 1 freq ordinarily (3) - 2 freq priority (3) - 25 freq drearily (3) - 1 freq primal (3) - 3 freq privately (3) - 2 freq preparing (4) - 4 freq triakil (4) - 1 freq prima (4) - 7 freq hilarity (4) - 5 freq pairtly (4) - 15 freq prematurely (4) - 1 freq primordial (4) - 1 freq prime-rib (4) - 1 freq privacy (4) - 12 freq grumpily (4) - 1 freq gramarie (4) - 1 freq |
primarily (0) - 2 freq primarie (3) - 3 freq primary (3) - 173 freq primaries (3) - 4 freq primar (4) - 1 freq primal (4) - 3 freq primly (4) - 1 freq primark (4) - 6 freq primer (5) - 10 freq primula (5) - 2 freq primrose (5) - 13 freq preemary (5) - 1 freq properly (5) - 60 freq prematurely (5) - 1 freq primordial (5) - 1 freq priority (5) - 25 freq 'primary (5) - 1 freq summarily (5) - 1 freq privately (5) - 2 freq drearily (5) - 1 freq preparin (6) - 7 freq primpin (6) - 1 freq prizery (6) - 1 freq princely (6) - 2 freq grammarly (6) - 1 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 - PRMRL primarily - 2 freq |
PRIMARILY |
| Time to execute Levenshtein function - 0.207340 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.355781 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.027513 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.037534 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.000928 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. |