| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pepper (0) - 83 freq papper (1) - 1 freq peppers (1) - 7 freq peyper (1) - 1 freq pipper (1) - 2 freq peiper (1) - 1 freq peppert (1) - 1 freq popper (1) - 3 freq papier (2) - 1 freq tipper (2) - 14 freq peepee (2) - 18 freq wapper (2) - 2 freq praper (2) - 1 freq capper (2) - 2 freq keppet (2) - 1 freq ripper (2) - 10 freq pewter (2) - 3 freq helper (2) - 5 freq reaper (2) - 16 freq temper (2) - 50 freq pester (2) - 2 freq pappen (2) - 1 freq piper (2) - 24 freq pepperie (2) - 1 freq popped (2) - 36 freq |
pepper (0) - 83 freq popper (1) - 3 freq papper (1) - 1 freq pipper (1) - 2 freq pepperie (2) - 1 freq peppert (2) - 1 freq peppers (2) - 7 freq peyper (2) - 1 freq peiper (2) - 1 freq supper (3) - 171 freq upper (3) - 54 freq proper (3) - 170 freq bopper (3) - 3 freq nipper (3) - 1 freq dipper (3) - 3 freq poppet (3) - 8 freq paper (3) - 511 freq pamper (3) - 2 freq pyper (3) - 4 freq papped (3) - 22 freq pauper (3) - 5 freq rapper (3) - 4 freq tapper (3) - 1 freq paeper (3) - 3 freq dapper (3) - 4 freq |
SoundEx code - P160 paper - 511 freq pepper - 83 freq piper - 24 freq puffer - 1 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pivver - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq peever - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paybrhw - 1 freq paper- - 2 freq |
MetaPhone code - PPR paper - 511 freq pepper - 83 freq piper - 24 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paper- - 2 freq |
PEPPER |
| Time to execute Levenshtein function - 0.186226 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.405179 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.027749 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.044172 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.001040 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. |