| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumps (0) - 8 freq bump (1) - 23 freq bumph (1) - 3 freq bum's (1) - 2 freq humps (1) - 3 freq sumps (1) - 1 freq dumps (1) - 14 freq bumpy (1) - 1 freq bums (1) - 8 freq bump's (1) - 1 freq lumps (1) - 21 freq mumps (1) - 3 freq pumps (1) - 12 freq jumps (1) - 18 freq beeps (2) - 3 freq buses (2) - 45 freq ups (2) - 22 freq lamps (2) - 36 freq cump (2) - 1 freq umes (2) - 1 freq bulls (2) - 10 freq turps (2) - 2 freq bumper (2) - 3 freq burns (2) - 359 freq cumms (2) - 2 freq |
bumps (0) - 8 freq bump's (2) - 1 freq bums (2) - 8 freq lumps (2) - 21 freq pumps (2) - 12 freq jumps (2) - 18 freq bumpy (2) - 1 freq mumps (2) - 3 freq bump (2) - 23 freq dumps (2) - 14 freq bumph (2) - 3 freq bum's (2) - 2 freq sumps (2) - 1 freq humps (2) - 3 freq bumped (3) - 23 freq jimps (3) - 2 freq bps (3) - 1 freq imps (3) - 3 freq camps (3) - 15 freq bams (3) - 19 freq bombs (3) - 25 freq ramps (3) - 2 freq wimps (3) - 1 freq kemps (3) - 4 freq baps (3) - 5 freq |
SoundEx code - B512 bumbazed - 48 freq bum-bizzin - 1 freq bamboozit - 1 freq bumps - 8 freq bombs - 25 freq bumbazin - 8 freq bumbaze - 5 freq bamboozlin - 1 freq boombox - 1 freq bumbazes - 2 freq bumbased - 2 freq bumbazit - 1 freq bamboozlit - 2 freq bump's - 1 freq bombshell - 3 freq bamboozlt - 1 freq bamboozled - 5 freq bumbazement - 6 freq 'benefactors' - 1 freq bombazed - 2 freq bumbaiselt - 1 freq bean-bag - 1 freq beneficial - 4 freq bomb-shards - 1 freq boembs - 1 freq bomb-faas - 1 freq bambaized - 2 freq bumbaised - 2 freq bambaizit - 5 freq bone-pickers - 1 freq benefice - 1 freq bamboozelt - 1 freq bumbaizlement - 1 freq bumbees - 1 freq banffshire - 6 freq benefeicial - 1 freq bumbaized - 1 freq bamboozlet - 1 freq bumbazelt - 1 freq bamaboozled - 1 freq benfica - 1 freq banffacademybxa - 3 freq bambuco - 2 freq bambaze - 1 freq bnbkfmf - 1 freq |
MetaPhone code - BMPS bumps - 8 freq bump's - 1 freq |
BUMPS |
| Time to execute Levenshtein function - 0.485624 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.803294 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.032375 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.072679 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.000815 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. |