| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bump (0) - 23 freq pump (1) - 29 freq bumpy (1) - 1 freq bum (1) - 43 freq sump (1) - 3 freq gump (1) - 1 freq jump (1) - 84 freq bumt (1) - 1 freq rump (1) - 10 freq bums (1) - 8 freq lump (1) - 62 freq bumps (1) - 8 freq hump (1) - 15 freq bum' (1) - 1 freq bumph (1) - 3 freq mump (1) - 3 freq burp (1) - 9 freq cump (1) - 1 freq dump (1) - 30 freq stump (2) - 19 freq hup (2) - 5 freq 'um (2) - 27 freq jimp (2) - 34 freq hum (2) - 44 freq bm (2) - 5 freq |
bump (0) - 23 freq bumpy (1) - 1 freq bum' (2) - 1 freq hump (2) - 15 freq bumps (2) - 8 freq bumph (2) - 3 freq burp (2) - 9 freq cump (2) - 1 freq lump (2) - 62 freq mump (2) - 3 freq dump (2) - 30 freq bums (2) - 8 freq bum (2) - 43 freq pump (2) - 29 freq gump (2) - 1 freq sump (2) - 3 freq jump (2) - 84 freq rump (2) - 10 freq bumt (2) - 1 freq temp (3) - 734 freq bmd (3) - 1 freq bmg (3) - 1 freq bumpit (3) - 4 freq hemp (3) - 3 freq bdp (3) - 1 freq |
SoundEx code - B510 bumbee - 4 freq bamboo - 9 freq bumph - 3 freq bump - 23 freq bonnify - 2 freq bomb - 30 freq 'bmv - 1 freq bombay - 5 freq bnb - 1 freq banff - 45 freq b'nb - 2 freq benbuie - 2 freq bombe - 1 freq bumpy - 1 freq bambi - 1 freq banffie - 2 freq bnp - 1 freq banoffee - 1 freq bvnwupi - 1 freq banf - 1 freq bumff - 1 freq bimbo - 1 freq |
MetaPhone code - BMP bump - 23 freq bumpy - 1 freq |
BUMP |
| Time to execute Levenshtein function - 0.177803 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.315679 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.026943 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.043767 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.000840 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. |