| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pipperin (0) - 3 freq tipperin (1) - 2 freq pepperin (1) - 3 freq lipperin (1) - 8 freq kipperin (1) - 1 freq wimperin (2) - 1 freq pipper (2) - 2 freq simperin (2) - 1 freq lapperin (2) - 1 freq lipperan (2) - 2 freq paperin (2) - 2 freq pipterino (2) - 1 freq picterin (2) - 1 freq skipperin (2) - 3 freq pepperie (2) - 1 freq clipperin (2) - 2 freq pippered (2) - 1 freq lippenin (2) - 29 freq winderin (3) - 17 freq sinderin (3) - 7 freq nicherin (3) - 2 freq simmerin (3) - 7 freq giowerin (3) - 1 freq taperin (3) - 1 freq peerin (3) - 34 freq |
pipperin (0) - 3 freq pepperin (1) - 3 freq lipperin (2) - 8 freq kipperin (2) - 1 freq tipperin (2) - 2 freq pipterino (3) - 1 freq pepperoni (3) - 3 freq pippered (3) - 1 freq paperin (3) - 2 freq pepperie (3) - 1 freq lipperan (3) - 2 freq pipper (3) - 2 freq lapperin (3) - 1 freq papplin (4) - 2 freq poppin (4) - 22 freq peppers (4) - 7 freq popper (4) - 3 freq tapperon (4) - 1 freq peppert (4) - 1 freq pappin (4) - 7 freq preparin (4) - 7 freq papper (4) - 1 freq pepper (4) - 83 freq pappen (4) - 1 freq peppered (4) - 1 freq |
SoundEx code - P165 pepperami - 1 freq pepperoni - 3 freq papier-maché - 1 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 |
PIPPERIN |
| Time to execute Levenshtein function - 0.207733 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.387215 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.028694 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.039227 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.000866 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. |