| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pump (0) - 31 freq pulp (1) - 4 freq cump (1) - 1 freq tump (1) - 1 freq pup (1) - 37 freq sump (1) - 3 freq lump (1) - 62 freq rump (1) - 10 freq pomp (1) - 2 freq pumps (1) - 13 freq puma (1) - 2 freq bump (1) - 23 freq dump (1) - 31 freq gump (1) - 1 freq hump (1) - 15 freq mump (1) - 3 freq plump (1) - 16 freq pumpt (1) - 1 freq jump (1) - 85 freq pum (1) - 3 freq numb (2) - 25 freq aums (2) - 1 freq sum (2) - 416 freq plip (2) - 1 freq romp (2) - 2 freq |
pump (0) - 31 freq pomp (1) - 2 freq hump (2) - 15 freq dump (2) - 31 freq mump (2) - 3 freq gump (2) - 1 freq plump (2) - 16 freq pum (2) - 3 freq jump (2) - 85 freq pumpt (2) - 1 freq bump (2) - 23 freq pumpie (2) - 2 freq tump (2) - 1 freq pulp (2) - 4 freq puma (2) - 2 freq pup (2) - 37 freq cump (2) - 1 freq pumps (2) - 13 freq sump (2) - 3 freq rump (2) - 10 freq lump (2) - 62 freq php (3) - 1 freq pompei (3) - 1 freq camp (3) - 53 freq ramp (3) - 13 freq |
SoundEx code - P510 pawnwife - 1 freq pump - 31 freq pamby - 1 freq pompay - 1 freq painfu - 5 freq pomp - 2 freq pumpie - 2 freq pompeii - 1 freq pompei - 1 freq pmfw - 1 freq pnfw - 1 freq |
MetaPhone code - PMP pump - 31 freq pompay - 1 freq pomp - 2 freq pumpie - 2 freq pompeii - 1 freq pompei - 1 freq |
PUMP |
| Time to execute Levenshtein function - 0.171601 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.337039 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.027183 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.036845 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.000867 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. |