| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pumped (0) - 15 freq dumped (1) - 21 freq bumped (1) - 23 freq lumped (1) - 2 freq humped (1) - 2 freq pulped (1) - 1 freq jumped (1) - 66 freq mumped (1) - 1 freq pulied (2) - 1 freq pumpit (2) - 3 freq puffed (2) - 18 freq lumpen (2) - 1 freq peeped (2) - 10 freq rumpled (2) - 2 freq popped (2) - 36 freq pumpin (2) - 17 freq purred (2) - 8 freq pumps (2) - 12 freq summed (2) - 5 freq plumed (2) - 1 freq primped (2) - 3 freq pushed (2) - 92 freq pamper (2) - 2 freq puled (2) - 6 freq dumpled (2) - 1 freq |
pumped (0) - 15 freq pulped (2) - 1 freq jumped (2) - 66 freq humped (2) - 2 freq mumped (2) - 1 freq lumped (2) - 2 freq dumped (2) - 21 freq bumped (2) - 23 freq pumpie (3) - 2 freq limped (3) - 1 freq pimpled (3) - 1 freq jimped (3) - 6 freq pumpt (3) - 1 freq ramped (3) - 3 freq papped (3) - 22 freq tamped (3) - 1 freq poaped (3) - 1 freq lamped (3) - 2 freq romped (3) - 1 freq camped (3) - 6 freq dumpid (3) - 1 freq upped (3) - 5 freq piped (3) - 12 freq pump (3) - 29 freq pompei (3) - 1 freq |
SoundEx code - P513 pumped - 15 freq pumpit - 3 freq pumpt - 1 freq ppmbt - 1 freq pnfttxni - 1 freq pnnptazuhi - 1 freq pnapdclnvd - 1 freq pmfdvsprf - 1 freq |
MetaPhone code - PMPT pumped - 15 freq pumpit - 3 freq pumpt - 1 freq |
PUMPED |
| Time to execute Levenshtein function - 0.177145 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.329293 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.027734 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.036555 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.000831 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. |