Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
babble (0) - 2 freq jabble (1) - 2 freq bauble (1) - 3 freq babbled (1) - 2 freq babbie (1) - 34 freq bobble (1) - 1 freq yabble (1) - 1 freq dabble (1) - 2 freq habble (1) - 2 freq rabble (1) - 10 freq wabble (1) - 3 freq gabble (1) - 1 freq bubble (1) - 30 freq gable (2) - 8 freq nabbie (2) - 7 freq tibble (2) - 18 freq taeble (2) - 3 freq jabblie (2) - 1 freq gobble (2) - 3 freq gabbled (2) - 1 freq bramble (2) - 1 freq dabbled (2) - 1 freq table (2) - 674 freq bumble (2) - 2 freq bastle (2) - 1 freq |
babble (0) - 2 freq bobble (1) - 1 freq bubble (1) - 30 freq bubbly (2) - 10 freq gabble (2) - 1 freq jabble (2) - 2 freq babbled (2) - 2 freq rabble (2) - 10 freq wabble (2) - 3 freq babbie (2) - 34 freq habble (2) - 2 freq bauble (2) - 3 freq dabble (2) - 2 freq yabble (2) - 1 freq babbit (3) - 2 freq bible (3) - 93 freq babel (3) - 7 freq babby (3) - 25 freq dubble (3) - 2 freq bibbles (3) - 1 freq bubbled (3) - 10 freq kibble (3) - 1 freq bobbler (3) - 3 freq bubbles (3) - 23 freq babblin (3) - 2 freq |
SoundEx code - B140 bauble - 3 freq bible - 93 freq by-pley - 1 freq bubble - 30 freq babel - 7 freq bubbly - 10 freq buffalo - 6 freq baffle - 2 freq bubbly' - 1 freq bubbaloo - 2 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 - 3 freq bible - 93 freq bubble - 30 freq babel - 7 freq bubbly - 10 freq bubbly' - 1 freq bubbaloo - 2 freq bybil - 1 freq bubl - 1 freq babble - 2 freq bublé - 1 freq 'bubbly - 1 freq bobble - 1 freq |
BABBLE |
Time to execute Levenshtein function - 0.396108 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.705169 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.028375 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.091254 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.000824 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. |