| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pluffie (0) - 1 freq puffie (1) - 2 freq pluffit (1) - 1 freq pluffin (1) - 2 freq scuffie (2) - 4 freq gluffit (2) - 1 freq stuffie (2) - 5 freq puffit (2) - 3 freq pluffer (2) - 7 freq bluffin (2) - 1 freq pluffen (2) - 4 freq guffie (2) - 3 freq gliffie (2) - 1 freq pluff (2) - 4 freq fuffie (2) - 1 freq pluffy (2) - 1 freq chuffie (2) - 3 freq pluffins (2) - 2 freq puffin (2) - 43 freq gluff (3) - 19 freq affie (3) - 6 freq flushie (3) - 1 freq pluntee (3) - 5 freq plumin (3) - 1 freq puffy (3) - 5 freq |
pluffie (0) - 1 freq pluff (2) - 4 freq puffie (2) - 2 freq pluffin (2) - 2 freq pluffy (2) - 1 freq pluffit (2) - 1 freq pluffer (3) - 7 freq gliffie (3) - 1 freq pluffen (3) - 4 freq bluff (4) - 4 freq puffa (4) - 1 freq fluffy (4) - 20 freq puffy (4) - 5 freq fluff (4) - 5 freq lyffe (4) - 3 freq plaefil (4) - 1 freq gluffy (4) - 2 freq luff (4) - 4 freq puff (4) - 43 freq puffin (4) - 43 freq fuffie (4) - 1 freq guffie (4) - 3 freq bluffin (4) - 1 freq puffit (4) - 3 freq gluffit (4) - 1 freq |
SoundEx code - P410 philp - 10 freq plav - 1 freq philip - 19 freq pluff - 4 freq pluffy - 1 freq plip - 1 freq pelf - 6 freq pleb - 4 freq pluffie - 1 freq pulp - 4 freq palava - 1 freq philippe - 1 freq palf - 1 freq philippi - 1 freq phïlip - 2 freq phillipi - 1 freq pheelip - 2 freq plowp - 3 freq playboy - 1 freq plop - 4 freq pleep - 3 freq pælfoo - 1 freq phílip - 1 freq philiphaw - 1 freq phillip - 2 freq pulpy - 1 freq philope - 2 freq philhope - 8 freq plap - 2 freq ploop - 1 freq philippaw - 8 freq play-off - 1 freq paulphi - 1 freq philippa - 2 freq plebby - 1 freq |
MetaPhone code - PLF plav - 1 freq pluff - 4 freq pluffy - 1 freq pleugh - 2 freq pelf - 6 freq pluffie - 1 freq palava - 1 freq palf - 1 freq plough - 7 freq pælfoo - 1 freq play-off - 1 freq paulphi - 1 freq |
PLUFFIE |
| Time to execute Levenshtein function - 0.204090 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.374005 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.029095 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.037287 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.000854 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. |