| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubbled (0) - 10 freq babbled (1) - 2 freq bumbled (1) - 1 freq rubbled (1) - 1 freq bubblen (1) - 1 freq bubbles (1) - 23 freq bubble (1) - 30 freq jibbled (2) - 1 freq bubble's (2) - 2 freq tumbled (2) - 9 freq dabbled (2) - 1 freq bobbed (2) - 1 freq bubblin (2) - 29 freq jumbled (2) - 2 freq bobble (2) - 1 freq cobbled (2) - 12 freq bumbles (2) - 1 freq bubbly (2) - 10 freq gubbed (2) - 10 freq buckled (2) - 7 freq burled (2) - 2 freq bubbly' (2) - 1 freq babbed (2) - 1 freq babble (2) - 2 freq dubbed (2) - 2 freq |
bubbled (0) - 10 freq babbled (1) - 2 freq bubbles (2) - 23 freq bubblen (2) - 1 freq bubble (2) - 30 freq rubbled (2) - 1 freq bumbled (2) - 1 freq bobbles (3) - 1 freq dibbled (3) - 1 freq hobbled (3) - 2 freq nibbled (3) - 8 freq bubblit (3) - 1 freq babble (3) - 2 freq gobbled (3) - 4 freq yabbled (3) - 1 freq bobsled (3) - 1 freq bibbles (3) - 1 freq babbed (3) - 1 freq gabbled (3) - 1 freq bubblan (3) - 2 freq bobbler (3) - 3 freq wobbled (3) - 1 freq hibbled (3) - 1 freq bubblin (3) - 29 freq jibbled (3) - 1 freq |
SoundEx code - B143 bubbled - 10 freq babbled - 2 freq biblioteca - 1 freq bibliothecks - 2 freq by-fleitin - 1 freq bubblit - 1 freq baffled - 4 freq baffelt - 1 freq bubble-thin - 1 freq |
MetaPhone code - BBLT bubbled - 10 freq babbled - 2 freq bubblit - 1 freq |
BUBBLED |
| Time to execute Levenshtein function - 0.219589 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.398211 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.028993 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.044716 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.000987 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. |