| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| primp (0) - 5 freq prima (1) - 7 freq prime (1) - 36 freq prim (1) - 2 freq crimp (1) - 1 freq wramp (2) - 1 freq privy (2) - 32 freq gimp (2) - 3 freq primal (2) - 2 freq primpin (2) - 1 freq grime (2) - 5 freq grip (2) - 123 freq prism (2) - 2 freq primed (2) - 3 freq trim (2) - 15 freq pram (2) - 18 freq prile (2) - 3 freq frim (2) - 1 freq primus (2) - 6 freq jimp (2) - 34 freq purim (2) - 1 freq mrim (2) - 1 freq prior (2) - 18 freq rime (2) - 8 freq prisk (2) - 1 freq |
primp (0) - 5 freq prim (2) - 2 freq crimp (2) - 1 freq prime (2) - 36 freq prima (2) - 7 freq ramp (3) - 13 freq pomp (3) - 2 freq plump (3) - 16 freq grump (3) - 3 freq primpit (3) - 1 freq primly (3) - 1 freq prom (3) - 8 freq romp (3) - 2 freq prap (3) - 3 freq cramp (3) - 3 freq frump (3) - 1 freq prma (3) - 1 freq prompt (3) - 3 freq crump (3) - 1 freq prum (3) - 1 freq rump (3) - 10 freq rmp (3) - 1 freq promo (3) - 2 freq prep (3) - 5 freq prams (3) - 8 freq |
SoundEx code - P651 promptit - 3 freq promptly - 12 freq pre-nuptial - 1 freq primpett - 1 freq prompted - 1 freq promptin - 3 freq prompt - 3 freq primp - 5 freq primped - 3 freq prenuptial - 1 freq prenup - 2 freq pirnfu - 1 freq promptlike - 1 freq preen-prick - 2 freq peremptor - 2 freq pre-emptive - 1 freq €˜pre-emptive - 1 freq pre-emptit - 1 freq prein-pricks - 1 freq primpit - 1 freq promuivin - 3 freq promuives - 3 freq promeuvin - 1 freq promuive - 3 freq peremptory - 1 freq promoval - 2 freq permeable - 1 freq primpin - 1 freq pornhub - 2 freq primevideo - 1 freq pro-unification - 1 freq proamfootball - 19 freq pharmabhoy - 1 freq |
MetaPhone code - PRMP primp - 5 freq |
PRIMP |
| Time to execute Levenshtein function - 0.174685 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.327155 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.027739 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.037389 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.000842 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. |