Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bubble (0) - 37 freq bubblen (1) - 1 freq bumble (1) - 2 freq bubbled (1) - 10 freq rubble (1) - 7 freq hubble (1) - 3 freq bobble (1) - 1 freq bubbly (1) - 10 freq dubble (1) - 2 freq babble (1) - 2 freq bubbles (1) - 24 freq buile (2) - 1 freq wabble (2) - 3 freq bugle (2) - 2 freq kibble (2) - 1 freq stubble (2) - 13 freq bubblit (2) - 1 freq bubl (2) - 1 freq rumble (2) - 9 freq dibble (2) - 1 freq wobble (2) - 2 freq hubbie (2) - 1 freq rabble (2) - 10 freq bubblin (2) - 29 freq bobbie (2) - 15 freq |
bubble (0) - 37 freq bubbly (1) - 10 freq bobble (1) - 1 freq babble (1) - 2 freq bubblen (2) - 1 freq bubbles (2) - 24 freq rubble (2) - 7 freq dubble (2) - 2 freq bumble (2) - 2 freq hubble (2) - 3 freq bubbled (2) - 10 freq bubbly' (3) - 1 freq 'bubbly (3) - 1 freq babbled (3) - 2 freq bauble (3) - 5 freq babbie (3) - 34 freq jibble (3) - 4 freq pebble (3) - 9 freq bubblan (3) - 2 freq cobble (3) - 5 freq bobbler (3) - 3 freq bubba (3) - 1 freq bible (3) - 95 freq bobbles (3) - 1 freq habble (3) - 2 freq |
SoundEx code - B140 bauble - 5 freq bible - 95 freq by-pley - 1 freq bubble - 37 freq babel - 7 freq bubbly - 10 freq bubbaloo - 3 freq buffalo - 6 freq baffle - 2 freq bubbly' - 1 freq bybil - 1 freq bubl - 1 freq befell - 2 freq babble - 2 freq baffel - 1 freq bublé - 1 freq 'bubbly - 1 freq bobble - 1 freq |
MetaPhone code - BBL bauble - 5 freq bible - 95 freq bubble - 37 freq babel - 7 freq bubbly - 10 freq bubbaloo - 3 freq bubbly' - 1 freq bybil - 1 freq bubl - 1 freq babble - 2 freq bublé - 1 freq 'bubbly - 1 freq bobble - 1 freq |
BUBBLE |
Time to execute Levenshtein function - 0.174010 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.357223 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.027526 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.043076 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.001163 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. |