| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pippered (0) - 1 freq tippered (1) - 1 freq lippered (1) - 2 freq peppered (1) - 1 freq papered (2) - 1 freq pipper (2) - 2 freq hippened (2) - 1 freq pictered (2) - 2 freq rappered (2) - 1 freq lippened (2) - 11 freq pampered (2) - 1 freq pipperin (2) - 3 freq pivvered (2) - 1 freq slippered (2) - 2 freq tippexed (2) - 1 freq ripper's (3) - 4 freq plittered (3) - 1 freq ripped (3) - 41 freq tiltered (3) - 1 freq tippeen (3) - 1 freq widdered (3) - 2 freq bickered (3) - 1 freq rippled (3) - 1 freq pokered (3) - 1 freq pottered (3) - 1 freq |
pippered (0) - 1 freq peppered (1) - 1 freq lippered (2) - 2 freq tippered (2) - 1 freq rappered (3) - 1 freq pipperin (3) - 3 freq pipper (3) - 2 freq papered (3) - 1 freq pampered (3) - 1 freq pepperin (4) - 3 freq peppert (4) - 1 freq papped (4) - 22 freq appeared (4) - 137 freq poppers (4) - 2 freq peppers (4) - 7 freq papper (4) - 1 freq pepperie (4) - 1 freq pappled (4) - 2 freq pepper (4) - 83 freq popper (4) - 3 freq slippered (4) - 2 freq pivvered (4) - 1 freq pictered (4) - 2 freq lippened (4) - 11 freq tippexed (4) - 1 freq |
SoundEx code - P163 peppert - 1 freq pavarotti - 3 freq poverty - 38 freq powbrade - 1 freq povertee - 1 freq puberty - 3 freq pee-yoo-ber-tee - 1 freq pippered - 1 freq paper-thin - 1 freq pivvered - 1 freq peppered - 1 freq papered - 1 freq |
MetaPhone code - PPRT peppert - 1 freq pippered - 1 freq peppered - 1 freq papered - 1 freq |
PIPPERED |
| Time to execute Levenshtein function - 0.204177 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.361598 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.033843 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.043336 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.000898 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. |