| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumpin (0) - 9 freq bumin (1) - 1 freq humpin (1) - 1 freq pumpin (1) - 17 freq lumpin (1) - 1 freq bampin (1) - 1 freq mumpin (1) - 6 freq burpin (1) - 1 freq bumping (1) - 1 freq bummin (1) - 20 freq bumpit (1) - 4 freq jumpin (1) - 61 freq dumpin (1) - 5 freq sumyin (2) - 1 freq buyin (2) - 84 freq bukin (2) - 1 freq buzzin (2) - 37 freq hummin (2) - 18 freq dumpie (2) - 1 freq sumhin (2) - 37 freq dumpit (2) - 6 freq buxin (2) - 2 freq buckin (2) - 3 freq wumpil (2) - 1 freq dupin (2) - 1 freq |
bumpin (0) - 9 freq bampin (1) - 1 freq bumping (2) - 1 freq bummin (2) - 20 freq bumpit (2) - 4 freq dumpin (2) - 5 freq burpin (2) - 1 freq jumpin (2) - 61 freq mumpin (2) - 6 freq bumin (2) - 1 freq humpin (2) - 1 freq pumpin (2) - 17 freq lumpin (2) - 1 freq bumper (3) - 3 freq rampin (3) - 4 freq jimpin (3) - 4 freq bammin (3) - 3 freq gampin (3) - 1 freq bump (3) - 23 freq beepin (3) - 3 freq lumpen (3) - 1 freq campin (3) - 4 freq bombin (3) - 4 freq lampin (3) - 6 freq bumpy (3) - 1 freq |
SoundEx code - B515 bumpin - 9 freq bombin - 4 freq boom-boom-boomin - 1 freq bombing - 2 freq bampin - 1 freq bonbons - 3 freq boom-boom-boom - 1 freq beeinmabonnet - 1 freq bumping - 1 freq |
MetaPhone code - BMPN bumpin - 9 freq bampin - 1 freq |
BUMPIN |
| Time to execute Levenshtein function - 0.276706 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.377957 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.028228 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.036713 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.000833 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. |