| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puffed (0) - 18 freq puffe'd (1) - 1 freq guffed (1) - 4 freq muffed (1) - 1 freq fuffed (1) - 1 freq cuffed (1) - 1 freq puffer (1) - 1 freq tuffed (1) - 1 freq buffed (1) - 1 freq huffed (1) - 3 freq gaffed (2) - 13 freq purled (2) - 1 freq biffed (2) - 1 freq pursed (2) - 6 freq puff (2) - 44 freq purfled (2) - 1 freq muffled (2) - 18 freq muffet (2) - 5 freq gluffed (2) - 10 freq tuffet (2) - 2 freq luiffed (2) - 2 freq pufft (2) - 3 freq pussed (2) - 4 freq pulled (2) - 167 freq scuffed (2) - 13 freq |
puffed (0) - 18 freq puffer (2) - 1 freq buffed (2) - 1 freq huffed (2) - 3 freq cuffed (2) - 1 freq tuffed (2) - 1 freq fuffed (2) - 1 freq puffe'd (2) - 1 freq guffed (2) - 4 freq muffed (2) - 1 freq puffa (3) - 1 freq puffin (3) - 33 freq bouffed (3) - 4 freq waffed (3) - 4 freq daffed (3) - 3 freq puffit (3) - 3 freq puffan (3) - 1 freq miffed (3) - 4 freq spaffed (3) - 1 freq puffy (3) - 5 freq puffie (3) - 2 freq toffed (3) - 1 freq doffed (3) - 3 freq pufft (3) - 3 freq puffs (3) - 8 freq |
SoundEx code - P130 papped - 22 freq poopit - 4 freq peeped - 10 freq peeved - 4 freq puffed - 18 freq pipit - 6 freq peivot - 1 freq 'phhft - 3 freq phffft - 1 freq poppt - 3 freq popped - 36 freq poapit - 1 freq paved - 4 freq pufft - 3 freq piped - 12 freq poppet - 8 freq popet - 2 freq pypet - 2 freq puffe'd - 1 freq puppet - 14 freq peep-o-day - 1 freq puffit - 3 freq poupit - 6 freq papt - 6 freq pauvit - 1 freq poppit - 1 freq pappit - 1 freq peevot - 1 freq poo-poohed - 1 freq pupit - 1 freq pouppet - 1 freq poaped - 1 freq pivot - 2 freq |
MetaPhone code - PFT peeved - 4 freq puffed - 18 freq peivot - 1 freq paved - 4 freq pufft - 3 freq puffe'd - 1 freq puffit - 3 freq pfffft - 1 freq pauvit - 1 freq peevot - 1 freq pfft - 3 freq pivot - 2 freq |
PUFFED |
| Time to execute Levenshtein function - 0.233808 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.417220 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.032390 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.037441 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.000977 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. |