Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bobble (0) - 1 freq bubble (1) - 37 freq bobbles (1) - 1 freq cobble (1) - 5 freq babble (1) - 2 freq gobble (1) - 3 freq bobbler (1) - 3 freq wobble (1) - 2 freq bobbie (1) - 15 freq nibble (2) - 8 freq bobbies (2) - 33 freq bobby (2) - 45 freq yibble (2) - 3 freq dobbie (2) - 1 freq wobbly (2) - 6 freq cobblet (2) - 1 freq hobbles (2) - 2 freq wobbled (2) - 1 freq bombe (2) - 1 freq gabble (2) - 1 freq dibble (2) - 1 freq boyle (2) - 17 freq gobbled (2) - 4 freq wobbles (2) - 1 freq babbie (2) - 34 freq |
bobble (0) - 1 freq babble (1) - 2 freq bubble (1) - 37 freq wobble (2) - 2 freq bobbie (2) - 15 freq bobbler (2) - 3 freq bubbly (2) - 10 freq gobble (2) - 3 freq bobbles (2) - 1 freq cobble (2) - 5 freq wabble (3) - 3 freq habble (3) - 2 freq yabble (3) - 1 freq bobbin (3) - 22 freq bubbles (3) - 24 freq bobbed (3) - 1 freq bubbled (3) - 10 freq ebble (3) - 1 freq dabble (3) - 2 freq gibble (3) - 1 freq dubble (3) - 2 freq sibble (3) - 1 freq bumble (3) - 2 freq bibbles (3) - 1 freq rubble (3) - 7 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 |
BOBBLE |
Time to execute Levenshtein function - 0.231775 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.386725 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.034426 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.041566 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.000913 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. |