| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bubblit (0) - 1 freq bubblin (1) - 29 freq babblin (2) - 2 freq bobbit (2) - 2 freq bubblen (2) - 1 freq bibblin (2) - 2 freq bubbled (2) - 10 freq bubbles (2) - 24 freq bubbly (2) - 10 freq bubbling (2) - 1 freq bullit (2) - 1 freq rubbit (2) - 49 freq bubble (2) - 37 freq bucklit (2) - 1 freq wabblit (2) - 1 freq bubblan (2) - 2 freq bubbly' (2) - 1 freq babbit (2) - 2 freq buildit (3) - 1 freq jabblie (3) - 1 freq mumblet (3) - 2 freq robbit (3) - 2 freq blabbit (3) - 1 freq wabblie (3) - 1 freq oubit (3) - 2 freq |
bubblit (0) - 1 freq bubblin (2) - 29 freq wabblit (3) - 1 freq bubble (3) - 37 freq bubbly' (3) - 1 freq babbit (3) - 2 freq bubblan (3) - 2 freq bubbly (3) - 10 freq bubblen (3) - 1 freq bobbit (3) - 2 freq babblin (3) - 2 freq bibblin (3) - 2 freq bubbled (3) - 10 freq bubbles (3) - 24 freq gabblet (4) - 1 freq bibbles (4) - 1 freq gabblt (4) - 1 freq babbled (4) - 2 freq bobbler (4) - 3 freq babble (4) - 2 freq bobblar (4) - 1 freq bobbles (4) - 1 freq cobblet (4) - 1 freq bubbaloo (4) - 3 freq bobble (4) - 1 freq |
SoundEx code - B143 bubbled - 10 freq babbled - 2 freq biblioteca - 1 freq bibliothecks - 2 freq by-fleitin - 1 freq bubblit - 1 freq baffled - 4 freq baffelt - 1 freq bubble-thin - 1 freq |
MetaPhone code - BBLT bubbled - 10 freq babbled - 2 freq bubblit - 1 freq |
BUBBLIT |
| Time to execute Levenshtein function - 0.504228 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 - 1.069580 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.094090 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.105639 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.001038 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. |