| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumfle (0) - 3 freq bumfly (1) - 1 freq bumflie (1) - 2 freq bumfled (1) - 1 freq bumble (1) - 2 freq bustle (2) - 6 freq bubble (2) - 37 freq bulfie (2) - 1 freq rummle (2) - 21 freq bunnle (2) - 8 freq duffle (2) - 2 freq bumff (2) - 1 freq bungle (2) - 2 freq wummle (2) - 1 freq bumhole (2) - 1 freq buile (2) - 1 freq fumble (2) - 1 freq mumble (2) - 3 freq mummle (2) - 4 freq bumflin (2) - 1 freq rumle (2) - 1 freq tumble (2) - 9 freq burgle (2) - 1 freq baffle (2) - 2 freq jummle (2) - 5 freq |
bumfle (0) - 3 freq bumfly (1) - 1 freq bumflie (1) - 2 freq bumble (2) - 2 freq bumfled (2) - 1 freq bumfils (3) - 1 freq baffle (3) - 2 freq bumff (3) - 1 freq bumhole (3) - 1 freq bumflin (3) - 1 freq fuffle (4) - 1 freq hummle (4) - 12 freq tumflre (4) - 1 freq muffle (4) - 4 freq bundle (4) - 18 freq tummle (4) - 19 freq rumble (4) - 9 freq bumbee (4) - 4 freq fummle (4) - 5 freq buffalo (4) - 6 freq bummel (4) - 1 freq buckle (4) - 12 freq bugle (4) - 2 freq cumfae (4) - 2 freq ruffle (4) - 5 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 - BMFL bumflie - 2 freq bumfly - 1 freq bumphlie - 1 freq bumfle - 3 freq |
BUMFLE |
| Time to execute Levenshtein function - 0.207473 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.367396 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.026896 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.036990 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.000883 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. |