| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pluffert (0) - 2 freq bluffert (1) - 1 freq pluffer (1) - 7 freq fluffer (2) - 3 freq blaffert (2) - 1 freq suffert (2) - 9 freq pluffen (2) - 4 freq puffers (2) - 1 freq pluffit (2) - 1 freq buffert (2) - 4 freq puffer (2) - 1 freq proffert (2) - 2 freq effert (3) - 1 freq puffe'd (3) - 1 freq pluffie (3) - 1 freq plunket (3) - 1 freq duffer (3) - 6 freq gluffit (3) - 1 freq plastert (3) - 1 freq plunder (3) - 5 freq pufft (3) - 3 freq puffit (3) - 3 freq fluffed (3) - 1 freq pluffin (3) - 2 freq shuffelt (3) - 1 freq |
pluffert (0) - 2 freq pluffer (2) - 7 freq bluffert (2) - 1 freq pluffit (3) - 1 freq proffert (3) - 2 freq blaffert (3) - 1 freq fluffer (4) - 3 freq suffert (4) - 9 freq puffer (4) - 1 freq buffert (4) - 4 freq pluffen (4) - 4 freq puffers (4) - 1 freq niffert (5) - 1 freq pluffy (5) - 1 freq sclaffert (5) - 1 freq flufferin (5) - 1 freq prefert (5) - 2 freq pluffins (5) - 2 freq offert (5) - 42 freq flaffer (5) - 3 freq glufft (5) - 2 freq plestert (5) - 2 freq sufferit (5) - 1 freq peffers (5) - 2 freq pufft (5) - 3 freq |
SoundEx code - P416 palaver - 10 freq pulverisin - 1 freq pilaaver - 1 freq palfrey - 6 freq playpark - 1 freq plover - 9 freq palaiver - 2 freq pley-fere - 1 freq pulverise - 1 freq pluffert - 2 freq playfair - 20 freq playfair's - 2 freq pullover - 1 freq pleyferes - 1 freq plavver - 2 freq €˜pulverised - 1 freq pluffer - 7 freq pulverised - 1 freq polvara - 2 freq paulbernaluk - 2 freq pluperfect- - 1 freq philipbrannan - 1 freq |
MetaPhone code - PLFRT pluffert - 2 freq |
PLUFFERT |
| Time to execute Levenshtein function - 0.403395 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.999061 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.110081 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.180361 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.000895 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. |