| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bumbaleerie (0) - 1 freq tapaleerie (4) - 1 freq balmageerie (4) - 1 freq bummerie (4) - 1 freq buccaneerin (4) - 1 freq dumbledore (5) - 22 freq bumbaze (5) - 5 freq tumblers (5) - 4 freq bullerin (5) - 1 freq 'galerie (5) - 1 freq fullyerie (5) - 1 freq muntaneerin (5) - 1 freq bumbled (5) - 1 freq unbeeriet (5) - 1 freq ramskeerie (5) - 1 freq dundeerie (5) - 1 freq bumflie (5) - 2 freq butterie (5) - 7 freq queerie (5) - 8 freq 'meerie (5) - 6 freq leerie (5) - 22 freq blearie (5) - 5 freq tapsalteerie (5) - 34 freq bulderin (5) - 2 freq bumbaised (5) - 2 freq |
bumbaleerie (0) - 1 freq bumble (6) - 2 freq bumbles (6) - 1 freq bummerie (6) - 1 freq bumbled (6) - 1 freq tumbler (6) - 4 freq bumbazin (7) - 8 freq nambarrie (7) - 1 freq bumbazed (7) - 48 freq bumbased (7) - 2 freq bamber (7) - 2 freq bumbazit (7) - 1 freq bumbee (7) - 4 freq bumbazes (7) - 2 freq bumbard (7) - 1 freq bumbazelt (7) - 1 freq bomber (7) - 3 freq bumbaized (7) - 1 freq bumbaiselt (7) - 1 freq bumbees (7) - 1 freq bumbaised (7) - 2 freq gambler (7) - 4 freq tumblers (7) - 4 freq dumbledore (7) - 22 freq bumflie (7) - 2 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 - BMLR bumbaleerie - 1 freq |
BUMBALEERIE |
| Time to execute Levenshtein function - 0.307161 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.439595 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.027852 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.038083 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.000845 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. |