| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pipers (0) - 10 freq pipes (1) - 91 freq piper (1) - 31 freq paipers (1) - 5 freq vipers (1) - 5 freq piers (1) - 7 freq wipers (1) - 4 freq papers (1) - 137 freq piper's (1) - 2 freq pipe's (1) - 2 freq liners (2) - 2 freq peiper (2) - 1 freq misers (2) - 1 freq uisers (2) - 17 freq pikters (2) - 1 freq kivers (2) - 3 freq paupers (2) - 3 freq popery (2) - 2 freq paiters (2) - 1 freq fiers (2) - 6 freq ppera (2) - 24 freq pinters (2) - 1 freq spiders (2) - 6 freq miners (2) - 41 freq pips (2) - 2 freq |
pipers (0) - 10 freq papers (1) - 137 freq paipers (1) - 5 freq uppers (2) - 2 freq peypers (2) - 5 freq paupers (2) - 3 freq peepers (2) - 6 freq paepers (2) - 2 freq pipe's (2) - 2 freq piper (2) - 31 freq vipers (2) - 5 freq pipes (2) - 91 freq wipers (2) - 4 freq piper's (2) - 2 freq piers (2) - 7 freq nippers (3) - 2 freq pouers (3) - 34 freq topers (3) - 1 freq pipies (3) - 1 freq peters (3) - 4 freq dippers (3) - 4 freq peiters (3) - 1 freq pype's (3) - 4 freq pape's (3) - 1 freq paper (3) - 526 freq |
SoundEx code - P162 papers - 137 freq paper's - 2 freq pepper's - 1 freq pibroch - 7 freq peppers - 7 freq pipers - 10 freq paupers - 3 freq peepers - 6 freq puffers - 1 freq piper's - 2 freq poppers - 2 freq paparrazi - 1 freq paparazzi - 1 freq pibroch's - 1 freq peppercorns - 1 freq paepir-kaesin - 1 freq paipers - 5 freq peypers - 5 freq paepers - 2 freq paper-chin - 1 freq papers' - 1 freq peppercoarns - 1 freq peffers - 2 freq papershop - 3 freq peevers - 1 freq pibrochs - 1 freq paperjust - 1 freq papershoap - 1 freq paprika - 3 freq papercraft - 1 freq paperweights - 1 freq paperweight - 1 freq |
MetaPhone code - PPRS papers - 137 freq paper's - 2 freq pepper's - 1 freq peppers - 7 freq pipers - 10 freq paupers - 3 freq peepers - 6 freq piper's - 2 freq poppers - 2 freq paparrazi - 1 freq paparazzi - 1 freq paipers - 5 freq peypers - 5 freq paepers - 2 freq papers' - 1 freq |
PIPERS |
| Time to execute Levenshtein function - 0.201277 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.354750 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.027828 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.037221 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.000930 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. |