| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| primly (0) - 1 freq grimly (1) - 13 freq aprily (2) - 2 freq faimly (2) - 185 freq drumly (2) - 3 freq prile (2) - 3 freq primula (2) - 2 freq prolly (2) - 8 freq prim (2) - 2 freq frilly (2) - 8 freq puirly (2) - 3 freq primer (2) - 10 freq grumly (2) - 1 freq pritty (2) - 2 freq prime (2) - 36 freq probly (2) - 40 freq primar (2) - 1 freq primus (2) - 6 freq drily (2) - 1 freq gritly (2) - 1 freq prissy (2) - 1 freq wrily (2) - 1 freq primed (2) - 3 freq mimly (2) - 2 freq pricky (2) - 5 freq |
primly (0) - 1 freq primula (2) - 2 freq grimly (2) - 13 freq primal (2) - 3 freq presly (3) - 2 freq primus (3) - 6 freq primar (3) - 1 freq primp (3) - 5 freq primed (3) - 3 freq primary (3) - 173 freq prima (3) - 7 freq probly (3) - 40 freq prime (3) - 36 freq drumly (3) - 3 freq prim (3) - 2 freq prolly (3) - 8 freq prile (3) - 3 freq puirly (3) - 3 freq aprily (3) - 2 freq grumly (3) - 1 freq primer (3) - 10 freq peril (4) - 7 freq pirl (4) - 7 freq proodly (4) - 39 freq poorly (4) - 5 freq |
SoundEx code - P654 primal - 3 freq phrenology - 1 freq purnell - 1 freq promulgatin - 1 freq primula - 2 freq primly - 1 freq prummle - 3 freq 'prummle' - 2 freq perennial - 3 freq preammle - 1 freq peronall - 1 freq pre-enlightened - 1 freq pernelle - 3 freq promulgate - 1 freq paramilitary - 1 freq prnielk - 1 freq perennialunder - 1 freq |
MetaPhone code - PRML primal - 3 freq primula - 2 freq primly - 1 freq prummle - 3 freq 'prummle' - 2 freq preammle - 1 freq |
PRIMLY |
| Time to execute Levenshtein function - 0.263066 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.392893 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.028307 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.037746 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.000954 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. |