| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pernelle (0) - 3 freq purnell (2) - 1 freq pernee (2) - 1 freq pannelled (3) - 1 freq kernel (3) - 1 freq merlle (3) - 1 freq peronall (3) - 1 freq perceive (3) - 3 freq petronella (3) - 1 freq penelope (3) - 7 freq pensells (3) - 3 freq pengelly (3) - 3 freq rebelle (3) - 1 freq mervellt (3) - 1 freq cornell (3) - 1 freq peelie (3) - 9 freq perverse (3) - 5 freq pensell (3) - 2 freq eternell (3) - 1 freq eersell (3) - 1 freq permeable (3) - 1 freq terrell (3) - 4 freq purelie (3) - 1 freq pannells (3) - 1 freq peelce (3) - 1 freq |
pernelle (0) - 3 freq purnell (2) - 1 freq peronall (3) - 1 freq eternell (4) - 1 freq cornell (4) - 1 freq pernee (4) - 1 freq petronella (4) - 1 freq fenella (5) - 4 freq parallel (5) - 21 freq penel (5) - 106 freq fernlie (5) - 1 freq penels (5) - 7 freq panelled (5) - 2 freq pertlie (5) - 1 freq kirnells (5) - 1 freq weenell (5) - 8 freq gornall (5) - 1 freq prinkle (5) - 1 freq eternally (5) - 7 freq prolly (5) - 8 freq personally (5) - 31 freq yersell (5) - 26 freq pringle (5) - 1 freq hersell (5) - 12 freq prnielk (5) - 1 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 - PRNL purnell - 1 freq perennial - 3 freq peronall - 1 freq pernelle - 3 freq |
PERNELLE |
| Time to execute Levenshtein function - 0.202404 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.417598 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.043362 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.049881 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.000878 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. |