| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubblin (0) - 29 freq bubblen (1) - 1 freq bubblit (1) - 1 freq bibblin (1) - 2 freq bubblan (1) - 2 freq babblin (1) - 2 freq bubbling (1) - 1 freq nabblin (2) - 1 freq bubbly (2) - 10 freq mumblin (2) - 2 freq rubbin (2) - 48 freq nibblin (2) - 7 freq jibblin (2) - 1 freq wabblin (2) - 5 freq gubbin (2) - 3 freq dublin (2) - 29 freq rumblin (2) - 12 freq bebbin (2) - 1 freq fumblin (2) - 1 freq gabblin (2) - 4 freq yabblin (2) - 2 freq bubble (2) - 30 freq bobbin (2) - 21 freq bustlin (2) - 4 freq bubbles (2) - 23 freq |
bubblin (0) - 29 freq bubblan (1) - 2 freq bibblin (1) - 2 freq babblin (1) - 2 freq bubblen (1) - 1 freq bubbling (2) - 1 freq bubblit (2) - 1 freq babbling (3) - 2 freq hobblin (3) - 2 freq mbblin (3) - 1 freq bobbin (3) - 21 freq bubbles (3) - 23 freq dibblin (3) - 1 freq bubbly' (3) - 1 freq birblin (3) - 1 freq wobblin (3) - 3 freq bubble (3) - 30 freq babbin (3) - 4 freq gobblin (3) - 1 freq bubbled (3) - 10 freq yabblin (3) - 2 freq jibblin (3) - 1 freq bebbin (3) - 1 freq bubbly (3) - 10 freq nabblin (3) - 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 |
BUBBLIN |
| Time to execute Levenshtein function - 0.261701 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.459313 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.033878 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.048658 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.001172 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. |