| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pumping (0) - 2 freq jumping (1) - 9 freq dumping (1) - 1 freq bumping (1) - 1 freq mumping (1) - 1 freq humping (1) - 1 freq pumpin (1) - 19 freq cumming (2) - 1 freq dumpin (2) - 5 freq dumpling (2) - 3 freq pulsing (2) - 3 freq jumpin (2) - 61 freq jumpin' (2) - 7 freq numbing (2) - 1 freq humpin (2) - 1 freq purring (2) - 1 freq lumpin (2) - 1 freq puffing (2) - 2 freq thumping (2) - 2 freq plumpin (2) - 9 freq cuming (2) - 1 freq peeping (2) - 2 freq whumping (2) - 1 freq pudding (2) - 12 freq purging (2) - 1 freq |
pumping (0) - 2 freq humping (2) - 1 freq mumping (2) - 1 freq pumpin (2) - 19 freq jumping (2) - 9 freq dumping (2) - 1 freq bumping (2) - 1 freq piping (3) - 5 freq popping (3) - 1 freq camping (3) - 3 freq peeping (3) - 2 freq pumpit (4) - 3 freq burping (4) - 1 freq sumhing (4) - 4 freq putting (4) - 17 freq pulling (4) - 11 freq fuming (4) - 2 freq pumpie (4) - 2 freq pumpkin (4) - 6 freq yapping (4) - 5 freq pampering (4) - 1 freq papingo (4) - 4 freq humming (4) - 3 freq cupping (4) - 1 freq pumpin (4) - 1 freq |
SoundEx code - P515 pom-poms - 1 freq pumpin - 19 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 - PMPNK pumping - 2 freq |
PUMPING |
| Time to execute Levenshtein function - 0.187172 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.397094 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.029187 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.037887 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.000913 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. |