| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paprika (0) - 3 freq afrika (2) - 5 freq parka (2) - 2 freq paerish (3) - 1 freq ulrika (3) - 2 freq pairks (3) - 6 freq panik (3) - 2 freq pairins (3) - 1 freq pavia (3) - 2 freq prima (3) - 7 freq packa (3) - 1 freq parkas (3) - 1 freq patricia (3) - 21 freq paiks (3) - 9 freq pairk (3) - 35 freq april (3) - 117 freq parity (3) - 2 freq lariks (3) - 1 freq papish (3) - 1 freq lanrik (3) - 2 freq pairing (3) - 2 freq africa (3) - 35 freq para (3) - 12 freq pannik (3) - 1 freq parins (3) - 3 freq |
paprika (0) - 3 freq parka (3) - 2 freq pairk (4) - 35 freq park (4) - 426 freq parke (4) - 2 freq papier (4) - 1 freq afrika (4) - 5 freq paperin (4) - 2 freq lapraik (4) - 1 freq papist (5) - 3 freq paris (5) - 52 freq papa (5) - 16 freq parrie (5) - 4 freq aprile (5) - 36 freq patriot (5) - 3 freq purk (5) - 1 freq parks (5) - 92 freq paplin (5) - 1 freq patrick (5) - 32 freq pappie (5) - 1 freq aprily (5) - 2 freq park' (5) - 2 freq pairis (5) - 2 freq spraik (5) - 1 freq porky (5) - 4 freq |
SoundEx code - P162 papers - 137 freq paper's - 2 freq pepper's - 1 freq pibroch - 7 freq peppers - 7 freq pipers - 10 freq paupers - 3 freq peepers - 6 freq puffers - 1 freq piper's - 2 freq poppers - 2 freq paparrazi - 1 freq paparazzi - 1 freq pibroch's - 1 freq peppercorns - 1 freq paepir-kaesin - 1 freq paipers - 5 freq peypers - 5 freq paepers - 2 freq paper-chin - 1 freq papers' - 1 freq peppercoarns - 1 freq peffers - 2 freq papershop - 3 freq peevers - 1 freq pibrochs - 1 freq paperjust - 1 freq papershoap - 1 freq paprika - 3 freq papercraft - 1 freq paperweights - 1 freq paperweight - 1 freq |
MetaPhone code - PPRK paprika - 3 freq |
PAPRIKA |
| Time to execute Levenshtein function - 0.291204 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.568245 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.027584 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.068346 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.000967 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. |