| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puffers (0) - 1 freq puffer (1) - 1 freq suffers (1) - 7 freq buffers (1) - 1 freq peffers (1) - 2 freq buffert (2) - 4 freq offers (2) - 67 freq gaffers (2) - 2 freq pluffer (2) - 7 freq puffe'd (2) - 1 freq duffer (2) - 6 freq putters (2) - 1 freq oaffers (2) - 1 freq dufners (2) - 1 freq puffins (2) - 5 freq suffer (2) - 58 freq punters (2) - 25 freq ruifers (2) - 1 freq niffers (2) - 1 freq pluffert (2) - 2 freq prefers (2) - 3 freq punders (2) - 2 freq puffed (2) - 18 freq suffert (2) - 9 freq coffers (2) - 2 freq |
puffers (0) - 1 freq peffers (1) - 2 freq suffers (2) - 7 freq buffers (2) - 1 freq puffer (2) - 1 freq niffers (3) - 1 freq prefers (3) - 3 freq puffins (3) - 5 freq puffs (3) - 8 freq oaffers (3) - 1 freq heffers (3) - 1 freq coffers (3) - 2 freq differs (3) - 39 freq offers (3) - 67 freq gaffers (3) - 2 freq effeirs (4) - 13 freq buffer (4) - 2 freq buffert (4) - 4 freq dufners (4) - 1 freq fifers (4) - 8 freq coffars (4) - 1 freq deiffers (4) - 2 freq fyfers (4) - 7 freq pluffer (4) - 7 freq poofters (4) - 1 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 - PFRS puffers - 1 freq peffers - 2 freq peevers - 1 freq pffruz - 1 freq |
PUFFERS |
| Time to execute Levenshtein function - 0.239456 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.387049 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.027679 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.037715 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.000890 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. |