Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pufft (0) - 3 freq ufft (1) - 1 freq puffa (1) - 1 freq puffy (1) - 5 freq bufft (1) - 1 freq mufft (1) - 3 freq hufft (1) - 1 freq puff (1) - 43 freq pfft (1) - 3 freq fufft (1) - 5 freq puffs (1) - 8 freq puffit (1) - 3 freq cuffs (2) - 7 freq huffy (2) - 5 freq luft (2) - 2 freq pullt (2) - 36 freq huffs (2) - 2 freq boufft (2) - 1 freq wafft (2) - 5 freq putt (2) - 28 freq luff (2) - 4 freq ouff (2) - 1 freq pusst (2) - 1 freq cuff (2) - 4 freq ruffs (2) - 1 freq |
pufft (0) - 3 freq pfft (1) - 3 freq puffit (1) - 3 freq puff (2) - 43 freq hufft (2) - 1 freq fufft (2) - 5 freq puffs (2) - 8 freq mufft (2) - 3 freq puffa (2) - 1 freq ufft (2) - 1 freq bufft (2) - 1 freq puffy (2) - 5 freq tuffet (3) - 2 freq piff (3) - 1 freq fft (3) - 1 freq dafft (3) - 2 freq puffed (3) - 18 freq puffin (3) - 43 freq pluffit (3) - 1 freq puffie (3) - 2 freq puffer (3) - 1 freq muffet (3) - 5 freq offt (3) - 1 freq paff (3) - 1 freq buffet (3) - 11 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 pfffft - 3 freq pffffft - 1 freq puffit - 3 freq pauvit - 1 freq peevot - 1 freq pfft - 3 freq pivot - 2 freq |
PUFFT |
Time to execute Levenshtein function - 0.183932 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.337706 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.027429 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.036818 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.000922 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. |