| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumble (0) - 2 freq tumble (1) - 9 freq bubble (1) - 37 freq bumfle (1) - 3 freq bumbles (1) - 1 freq mumble (1) - 3 freq fumble (1) - 1 freq humble (1) - 27 freq bumbled (1) - 1 freq bumbee (1) - 4 freq rumble (1) - 9 freq tumbler (2) - 4 freq cumbie (2) - 1 freq bustle (2) - 6 freq bobble (2) - 1 freq dubble (2) - 2 freq bauble (2) - 5 freq wummle (2) - 1 freq fumbles (2) - 2 freq fumbled (2) - 5 freq bungle (2) - 2 freq bumfly (2) - 1 freq buzzle (2) - 1 freq bugle (2) - 2 freq jumblt (2) - 1 freq |
bumble (0) - 2 freq humble (2) - 27 freq bumbled (2) - 1 freq rumble (2) - 9 freq fumble (2) - 1 freq bumbee (2) - 4 freq mumble (2) - 3 freq tumble (2) - 9 freq bubble (2) - 37 freq bumbles (2) - 1 freq bumfle (2) - 3 freq humbly (3) - 6 freq bubbly (3) - 10 freq wimble (3) - 1 freq nimble (3) - 1 freq bumbees (3) - 1 freq bombe (3) - 1 freq bramble (3) - 1 freq babble (3) - 2 freq bubl (3) - 1 freq bumflie (3) - 2 freq bumbaze (3) - 5 freq bumhole (3) - 1 freq rumbly (3) - 1 freq bible (3) - 95 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 - BML bumble - 2 freq bummel - 1 freq hbmyhl - 1 freq |
BUMBLE |
| Time to execute Levenshtein function - 0.215582 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.361929 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.055413 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.044513 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.001216 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. |