| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubbles (0) - 24 freq bumbles (1) - 1 freq bubble (1) - 37 freq bobbles (1) - 1 freq bibbles (1) - 1 freq bubbled (1) - 10 freq bubblen (1) - 1 freq bubble's (1) - 2 freq babbled (2) - 2 freq bibles (2) - 6 freq baubles (2) - 7 freq bumble (2) - 2 freq fumbles (2) - 2 freq rumbles (2) - 3 freq bubblin (2) - 29 freq bobblies (2) - 1 freq rubble (2) - 7 freq babbies (2) - 13 freq wabbles (2) - 1 freq jumbles (2) - 1 freq hubble (2) - 3 freq bungles (2) - 1 freq bobbler (2) - 3 freq bundles (2) - 4 freq jibbles (2) - 1 freq |
bubbles (0) - 24 freq bibbles (1) - 1 freq bobbles (1) - 1 freq bubble's (2) - 2 freq bubblen (2) - 1 freq bobblies (2) - 1 freq bubbled (2) - 10 freq bumbles (2) - 1 freq bubble (2) - 37 freq jibbles (3) - 1 freq gibbles (3) - 1 freq bobbler (3) - 3 freq hobbles (3) - 2 freq bubbly' (3) - 1 freq nibbles (3) - 2 freq cobbles (3) - 10 freq sibbles (3) - 1 freq babble (3) - 2 freq bubbly (3) - 10 freq wabbles (3) - 1 freq bubblit (3) - 1 freq baubles (3) - 7 freq bibles (3) - 6 freq babbled (3) - 2 freq bubblan (3) - 2 freq |
SoundEx code - B142 bubbly-jock - 7 freq bubbles - 24 freq bibles - 6 freq biblical - 12 freq baubles - 7 freq bobblies - 1 freq bubble's - 2 freq bibliography' - 1 freq bubblyjockitis - 1 freq bubblyjock-and-aipple - 1 freq bubblyjocks - 4 freq bubblyjock - 8 freq bibliography - 3 freq babel's - 1 freq buffaloes - 1 freq bubblie-joks - 1 freq bubbliejok - 1 freq by-place - 1 freq bibbles - 1 freq bevels - 1 freq bubblejock - 1 freq bibliocentrism - 1 freq bubbly-jockies - 1 freq bobbles - 1 freq baffles - 1 freq 'bubblyjock' - 1 freq |
MetaPhone code - BBLS bubbles - 24 freq bibles - 6 freq baubles - 7 freq bobblies - 1 freq bubble's - 2 freq babel's - 1 freq bibbles - 1 freq bobbles - 1 freq |
BUBBLES |
| Time to execute Levenshtein function - 0.181376 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.332410 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.027584 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.039041 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.001012 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. |