| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumbling (0) - 2 freq fumbling (1) - 2 freq humbling (1) - 1 freq rumbling (1) - 1 freq bubbling (1) - 1 freq tumbling (1) - 1 freq mumbling (1) - 1 freq tumblin (2) - 4 freq bubblin (2) - 29 freq bundling (2) - 1 freq humblin (2) - 1 freq mumblin (2) - 2 freq numbing (2) - 1 freq bumping (2) - 1 freq bumflin (2) - 1 freq rambling (2) - 3 freq sembling (2) - 1 freq stumbling (2) - 1 freq babbling (2) - 2 freq gambling (2) - 3 freq bustling (2) - 1 freq rumiling (2) - 1 freq rumblin (2) - 12 freq fumblin (2) - 1 freq mumblins (2) - 1 freq |
bumbling (0) - 2 freq tumbling (2) - 1 freq bubbling (2) - 1 freq mumbling (2) - 1 freq fumbling (2) - 2 freq humbling (2) - 1 freq rumbling (2) - 1 freq sembling (3) - 1 freq rambling (3) - 3 freq bombing (3) - 2 freq gambling (3) - 3 freq babbling (3) - 2 freq fumblin (4) - 1 freq rumiling (4) - 1 freq crumbling (4) - 3 freq bumming (4) - 2 freq bustling (4) - 1 freq bummlin (4) - 2 freq dumpling (4) - 3 freq mumblins (4) - 1 freq rumblin (4) - 12 freq humblin (4) - 1 freq bubblin (4) - 29 freq stumbling (4) - 1 freq tumblin (4) - 4 freq |
SoundEx code - B514 bumflie - 2 freq bumbles - 1 freq bumfly - 1 freq beanpole - 1 freq beanpole's - 1 freq benevolent - 4 freq bumbaleerie - 1 freq bumbled - 1 freq benevolence - 1 freq bumphlie - 1 freq bumble - 2 freq bumble-a-leary - 1 freq bumblebee's - 1 freq bumfle - 3 freq bumfled - 1 freq bumflin - 1 freq bumfils - 1 freq benphilip - 4 freq bumfluff - 1 freq bumbling - 2 freq bumblingmum - 150 freq |
MetaPhone code - BMLNK bumbling - 2 freq |
BUMBLING |
| Time to execute Levenshtein function - 0.217295 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.415185 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.028019 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.037583 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.000924 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. |