Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pumpin (0) - 17 freq pumpit (1) - 3 freq humpin (1) - 1 freq plumpin (1) - 9 freq dumpin (1) - 5 freq lumpin (1) - 1 freq pumpie (1) - 2 freq pumping (1) - 2 freq jumpin (1) - 61 freq pumpkin (1) - 6 freq bumpin (1) - 9 freq mumpin (1) - 6 freq purpie (2) - 23 freq burpin (2) - 1 freq pulein (2) - 2 freq trumpin (2) - 5 freq mumping (2) - 1 freq rumplin (2) - 1 freq gummin (2) - 1 freq cumin (2) - 70 freq suppin (2) - 9 freq pumpin (2) - 1 freq wumin (2) - 5 freq cummin (2) - 30 freq puin (2) - 6 freq |
pumpin (0) - 17 freq jumpin (2) - 61 freq bumpin (2) - 9 freq mumpin (2) - 6 freq pumpit (2) - 3 freq pumping (2) - 2 freq pumpkin (2) - 6 freq plumpin (2) - 9 freq pumpie (2) - 2 freq humpin (2) - 1 freq dumpin (2) - 5 freq lumpin (2) - 1 freq campin (3) - 4 freq pump (3) - 29 freq peepin (3) - 6 freq pumps (3) - 12 freq pumped (3) - 15 freq rampin (3) - 4 freq pappin (3) - 7 freq primpin (3) - 1 freq plypin (3) - 1 freq poopin (3) - 1 freq jimpin (3) - 4 freq pipin (3) - 8 freq papin (3) - 2 freq |
SoundEx code - P515 pom-poms - 1 freq pumpin - 17 freq pin-point - 1 freq penny-pincheen - 1 freq pinpoint - 2 freq pam-pon - 1 freq pin-pointin - 1 freq pinpointed - 1 freq pumping - 2 freq pinpint - 1 freq piano-piano - 1 freq pompoms - 1 freq pinpynt - 1 freq pumpin - 1 freq |
MetaPhone code - PMPN pumpin - 17 freq pam-pon - 1 freq pumpin - 1 freq |
PUMPIN |
Time to execute Levenshtein function - 0.179670 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.374289 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.027039 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.036745 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. |