| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubblen (0) - 1 freq bubblin (1) - 29 freq bubbled (1) - 10 freq bubblan (1) - 2 freq bubbles (1) - 24 freq bubble (1) - 37 freq rubble (2) - 7 freq bubbly' (2) - 1 freq bobbler (2) - 3 freq hubble (2) - 3 freq babblin (2) - 2 freq bubbling (2) - 1 freq bubble's (2) - 2 freq bibbles (2) - 1 freq bobbles (2) - 1 freq bubbly (2) - 10 freq bumble (2) - 2 freq rubbled (2) - 1 freq bumbled (2) - 1 freq babbled (2) - 2 freq bumbles (2) - 1 freq babble (2) - 2 freq bobble (2) - 1 freq bibblin (2) - 2 freq bubblit (2) - 1 freq |
bubblen (0) - 1 freq bubblin (1) - 29 freq bubblan (1) - 2 freq bibblin (2) - 2 freq babblin (2) - 2 freq bubble (2) - 37 freq bubbles (2) - 24 freq bubbled (2) - 10 freq babbled (3) - 2 freq bubbly (3) - 10 freq bobbles (3) - 1 freq bobble (3) - 1 freq babble (3) - 2 freq bubblit (3) - 1 freq bobbler (3) - 3 freq bibbles (3) - 1 freq bubbling (3) - 1 freq bubbly' (3) - 1 freq bubbaloo (4) - 3 freq babbling (4) - 2 freq mbblin (4) - 1 freq babbin (4) - 4 freq rubble (4) - 7 freq babylon (4) - 10 freq nabblin (4) - 1 freq |
SoundEx code - B145 befylin - 1 freq bibblin - 2 freq beef-links - 1 freq bubblin - 29 freq bibblie-nibbit - 1 freq babblin - 2 freq babylon - 10 freq bubblen - 1 freq bafflin - 1 freq bubblan - 2 freq babylonian - 1 freq bubbling - 1 freq babbling - 2 freq baffling - 1 freq |
MetaPhone code - BBLN bibblin - 2 freq bubblin - 29 freq babblin - 2 freq babylon - 10 freq bubblen - 1 freq bubblan - 2 freq |
BUBBLEN |
| Time to execute Levenshtein function - 0.190041 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.353506 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.027876 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.038633 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.001004 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. |