| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubbles (0) - 23 freq bumbles (1) - 1 freq bubbled (1) - 10 freq bubble (1) - 30 freq bubble's (1) - 2 freq bobbles (1) - 1 freq bibbles (1) - 1 freq bubblen (1) - 1 freq bubbly' (2) - 1 freq babbies (2) - 13 freq fumbles (2) - 2 freq pebbles (2) - 8 freq gibbles (2) - 1 freq babble (2) - 2 freq bunnles (2) - 3 freq babbled (2) - 2 freq bubbly (2) - 10 freq baubles (2) - 5 freq bundles (2) - 4 freq bobbler (2) - 3 freq hubble (2) - 3 freq bubblit (2) - 1 freq rubble (2) - 7 freq sibbles (2) - 1 freq bibles (2) - 6 freq |
bubbles (0) - 23 freq bobbles (1) - 1 freq bibbles (1) - 1 freq bumbles (2) - 1 freq bubble (2) - 30 freq bubblen (2) - 1 freq bubble's (2) - 2 freq bubbled (2) - 10 freq jibbles (3) - 1 freq wabbles (3) - 1 freq bibles (3) - 6 freq sibbles (3) - 1 freq cobbles (3) - 10 freq bobble (3) - 1 freq bubblin (3) - 29 freq bubblit (3) - 1 freq nibbles (3) - 2 freq bobbies (3) - 31 freq bubblan (3) - 2 freq bobbler (3) - 3 freq gibbles (3) - 1 freq pebbles (3) - 8 freq babbies (3) - 13 freq bubbly' (3) - 1 freq babbled (3) - 2 freq |
SoundEx code - B142 bubbly-jock - 7 freq bubbles - 23 freq bibles - 6 freq biblical - 12 freq bubble's - 2 freq baubles - 5 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 - 23 freq bibles - 6 freq bubble's - 2 freq baubles - 5 freq babel's - 1 freq bibbles - 1 freq bobbles - 1 freq |
BUBBLES |
| Time to execute Levenshtein function - 0.210717 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.333553 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.027205 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.037098 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.000797 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. |