| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumpin (0) - 9 freq bampin (1) - 1 freq mumpin (1) - 6 freq pumpin (1) - 19 freq humpin (1) - 1 freq bumpit (1) - 4 freq bummin (1) - 20 freq bumping (1) - 1 freq dumpin (1) - 5 freq bumin (1) - 1 freq burpin (1) - 1 freq jumpin (1) - 61 freq lumpin (1) - 1 freq bammin (2) - 3 freq dumpid (2) - 1 freq sumhin (2) - 37 freq wummin (2) - 233 freq dumbin (2) - 2 freq mumphin (2) - 1 freq humping (2) - 1 freq kempin (2) - 5 freq mumping (2) - 1 freq bumph (2) - 3 freq plumpin (2) - 9 freq bumpy (2) - 1 freq |
bumpin (0) - 9 freq bampin (1) - 1 freq dumpin (2) - 5 freq bumin (2) - 1 freq lumpin (2) - 1 freq bumping (2) - 1 freq jumpin (2) - 61 freq burpin (2) - 1 freq pumpin (2) - 19 freq bummin (2) - 20 freq humpin (2) - 1 freq mumpin (2) - 6 freq bumpit (2) - 4 freq limpin (3) - 3 freq bump (3) - 23 freq bumps (3) - 9 freq bumper (3) - 4 freq gampin (3) - 1 freq jumpan (3) - 8 freq boppin (3) - 1 freq rampin (3) - 4 freq jimpin (3) - 4 freq rompin (3) - 2 freq bumped (3) - 23 freq tempin (3) - 4 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.185120 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.434603 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.063475 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.039438 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.001076 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. |