| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| plumpin (0) - 9 freq slumpin (1) - 3 freq plumbin (1) - 5 freq lumpin (1) - 1 freq pumpin (1) - 17 freq clumpin (1) - 1 freq plumin (1) - 1 freq thumpin (2) - 18 freq plypin (2) - 1 freq pluggin (2) - 3 freq bumpin (2) - 9 freq pumping (2) - 2 freq jumpin (2) - 61 freq plunkin (2) - 6 freq sluppin (2) - 3 freq dumpin (2) - 5 freq stumpin (2) - 4 freq humpin (2) - 1 freq trumpin (2) - 5 freq limpin (2) - 3 freq mumpin (2) - 6 freq plumpt (2) - 1 freq clampin (2) - 2 freq lampin (2) - 6 freq pumpit (2) - 3 freq |
plumpin (0) - 9 freq plumin (2) - 1 freq pumpin (2) - 17 freq clumpin (2) - 1 freq lumpin (2) - 1 freq plumbin (2) - 5 freq slumpin (2) - 3 freq lampin (3) - 6 freq clampin (3) - 2 freq limpin (3) - 3 freq pleepin (3) - 1 freq plumpt (3) - 1 freq plumman (3) - 1 freq plumps (3) - 8 freq flampin (3) - 1 freq plump (3) - 16 freq plappin (3) - 2 freq primpin (3) - 1 freq lumpen (3) - 1 freq plypin (3) - 1 freq pleumen (4) - 1 freq lampan (4) - 1 freq pleepan (4) - 1 freq crumpin (4) - 1 freq ploppan (4) - 1 freq |
SoundEx code - P451 plump - 16 freq plumpt - 1 freq plenipotent - 1 freq plumber's - 1 freq plumber - 14 freq plampish - 1 freq plumpin - 9 freq plumbin - 5 freq plumbers - 6 freq plainwife - 1 freq plumpness - 1 freq plumps - 8 freq plumb - 1 freq poleinbelfast - 5 freq palm-up - 1 freq |
MetaPhone code - PLMPN plumpin - 9 freq |
PLUMPIN |
| Time to execute Levenshtein function - 0.293767 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.438096 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.027170 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.036954 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.000810 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. |