| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubblin (0) - 29 freq bubblen (1) - 1 freq bibblin (1) - 2 freq bubblan (1) - 2 freq bubbling (1) - 1 freq babblin (1) - 2 freq bubblit (1) - 1 freq mumblin (2) - 2 freq tumblin (2) - 5 freq jibblin (2) - 1 freq nabblin (2) - 1 freq bubbles (2) - 24 freq dublin (2) - 29 freq rubbin (2) - 50 freq nibblin (2) - 7 freq burlin (2) - 8 freq babbin (2) - 4 freq dibblin (2) - 1 freq bummlin (2) - 2 freq gobblin (2) - 1 freq gubbin (2) - 3 freq bumflin (2) - 1 freq rumblin (2) - 12 freq dubbin (2) - 1 freq bebbin (2) - 1 freq |
bubblin (0) - 29 freq bubblen (1) - 1 freq bubblan (1) - 2 freq bibblin (1) - 2 freq babblin (1) - 2 freq bubblit (2) - 1 freq bubbling (2) - 1 freq bebbin (3) - 1 freq mbblin (3) - 1 freq bobbin (3) - 22 freq bubbly (3) - 10 freq gobblin (3) - 1 freq bubbled (3) - 10 freq gabblin (3) - 4 freq bubbly' (3) - 1 freq hobblin (3) - 2 freq wobblin (3) - 3 freq yabblin (3) - 2 freq bubbles (3) - 24 freq birblin (3) - 1 freq nabblin (3) - 1 freq jibblin (3) - 1 freq wabblin (3) - 5 freq dibblin (3) - 1 freq bubble (3) - 37 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.187129 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.339615 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.028652 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.037484 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.000930 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. |