| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peppert (0) - 1 freq pepper (1) - 83 freq peppers (1) - 7 freq pipper (2) - 2 freq pepperie (2) - 1 freq pepper's (2) - 1 freq pepperin (2) - 3 freq petert (2) - 1 freq keppet (2) - 1 freq poppet (2) - 8 freq keppers (2) - 1 freq lippert (2) - 1 freq despert (2) - 4 freq peppered (2) - 1 freq peepers (2) - 6 freq tempert (2) - 2 freq heppent (2) - 7 freq peyper (2) - 1 freq poppers (2) - 2 freq lappert (2) - 1 freq pervert (2) - 1 freq peypers (2) - 5 freq peiper (2) - 1 freq appert (2) - 1 freq 'expert (2) - 1 freq |
peppert (0) - 1 freq peppers (2) - 7 freq pepper (2) - 83 freq papper (3) - 1 freq lippert (3) - 1 freq peppered (3) - 1 freq poppers (3) - 2 freq lappert (3) - 1 freq popper (3) - 3 freq appert (3) - 1 freq poppet (3) - 8 freq pipper (3) - 2 freq pepperie (3) - 1 freq pepperin (3) - 3 freq puppet (3) - 14 freq reappeart (4) - 4 freq appeart (4) - 80 freq appeert (4) - 2 freq support (4) - 341 freq prepart (4) - 1 freq pipperin (4) - 3 freq poppit (4) - 1 freq apperit (4) - 3 freq property (4) - 35 freq pasport (4) - 5 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 |
PEPPERT |
| Time to execute Levenshtein function - 0.199214 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.364524 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.028124 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.039925 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.000934 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. |