| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pepperoni (0) - 3 freq pepperin (2) - 3 freq pepperami (2) - 1 freq redperoni (2) - 1 freq tapperon (3) - 1 freq pepper's (3) - 1 freq peppert (3) - 1 freq pepper (3) - 83 freq pepperie (3) - 1 freq peppermint (3) - 2 freq peppers (3) - 7 freq pepperbox (3) - 1 freq pipperin (3) - 3 freq peppercorns (3) - 1 freq peppered (3) - 1 freq popper (4) - 3 freq heppens (4) - 4 freq aeaeron (4) - 5 freq heppent (4) - 7 freq pipterino (4) - 1 freq pestering (4) - 1 freq heppenins (4) - 1 freq peppermints (4) - 2 freq pesterin (4) - 2 freq emperors (4) - 2 freq |
pepperoni (0) - 3 freq pepperin (2) - 3 freq pipperin (3) - 3 freq pepperami (3) - 1 freq pepperie (4) - 1 freq peppers (4) - 7 freq pepper (4) - 83 freq peppert (4) - 1 freq peppered (4) - 1 freq redperoni (4) - 1 freq tapperon (4) - 1 freq papper (5) - 1 freq paperin (5) - 2 freq tipperin (5) - 2 freq lipperin (5) - 8 freq lipperan (5) - 2 freq pipterino (5) - 1 freq poppers (5) - 2 freq pippered (5) - 1 freq popper (5) - 3 freq pepperbox (5) - 1 freq peppermint (5) - 2 freq pepper's (5) - 1 freq pappen (5) - 1 freq kipperin (5) - 1 freq |
SoundEx code - P165 pepperami - 1 freq pepperoni - 3 freq paperin - 2 freq pipperin - 3 freq pepperin - 3 freq pivveran - 1 freq peppermills - 1 freq peffermill - 3 freq pepper-mashie - 1 freq peppermints - 2 freq paper-mills - 1 freq pawprints - 1 freq peppermint - 2 freq paper-news - 1 freq papayranger - 4 freq |
MetaPhone code - PPRN pepperoni - 3 freq paperin - 2 freq pipperin - 3 freq pepperin - 3 freq pæprin - 1 freq |
PEPPERONI |
| Time to execute Levenshtein function - 0.201420 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.403317 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.032761 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.037550 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.000796 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. |