Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bubble (0) - 30 freq babble (1) - 2 freq bumble (1) - 2 freq bubbles (1) - 23 freq bubbly (1) - 10 freq hubble (1) - 3 freq dubble (1) - 2 freq rubble (1) - 7 freq bubbled (1) - 10 freq bubblen (1) - 1 freq bobble (1) - 1 freq dubbie (2) - 7 freq bustle (2) - 6 freq bauble (2) - 3 freq stubble (2) - 13 freq nubbie (2) - 1 freq bible (2) - 93 freq ebble (2) - 1 freq rabble (2) - 10 freq bubblin (2) - 29 freq bobbles (2) - 1 freq tumble (2) - 9 freq bobbie (2) - 15 freq bumbles (2) - 1 freq bubble's (2) - 2 freq |
bubble (0) - 30 freq bubbly (1) - 10 freq bobble (1) - 1 freq babble (1) - 2 freq bubbled (2) - 10 freq bubbles (2) - 23 freq rubble (2) - 7 freq bubblen (2) - 1 freq bumble (2) - 2 freq dubble (2) - 2 freq hubble (2) - 3 freq wabble (3) - 3 freq yibble (3) - 3 freq nibble (3) - 8 freq bibbles (3) - 1 freq dabble (3) - 2 freq wobble (3) - 2 freq dibble (3) - 1 freq yabble (3) - 1 freq pebble (3) - 9 freq jibble (3) - 4 freq bubl (3) - 1 freq bubblan (3) - 2 freq gabble (3) - 1 freq cobble (3) - 5 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 |
BUBBLE |
Time to execute Levenshtein function - 0.196031 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.327860 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.027702 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.037489 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.000831 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. |