| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bsl (0) - 22 freq bse (1) - 4 freq zsl (1) - 1 freq bl (1) - 2 freq vsl (1) - 1 freq bul (1) - 3 freq bs (1) - 6 freq bst (1) - 2 freq bsb (1) - 1 freq dsl (1) - 28 freq 'bsl (1) - 1 freq tsl (1) - 2 freq fsl (1) - 1 freq bsc (1) - 2 freq xsl (1) - 1 freq ssl (1) - 1 freq sl (1) - 7 freq bal (1) - 6 freq asl (1) - 1 freq jsl (1) - 1 freq bil (1) - 1 freq bol (1) - 2 freq aal (2) - 755 freq btv (2) - 1 freq zsb (2) - 1 freq |
bsl (0) - 22 freq sl (2) - 7 freq ssl (2) - 1 freq xsl (2) - 1 freq bsc (2) - 2 freq asl (2) - 1 freq basil (2) - 2 freq bol (2) - 2 freq bil (2) - 1 freq jsl (2) - 1 freq fsl (2) - 1 freq bal (2) - 6 freq vsl (2) - 1 freq zsl (2) - 1 freq bse (2) - 4 freq tsl (2) - 2 freq bul (2) - 3 freq bl (2) - 2 freq dsl (2) - 28 freq bs (2) - 6 freq bsb (2) - 1 freq 'bsl (2) - 1 freq bst (2) - 2 freq sal (3) - 56 freq byle (3) - 16 freq |
SoundEx code - B240 bachle - 1 freq bauchle - 26 freq bogle - 45 freq boays'll - 1 freq bogle' - 1 freq bussell - 1 freq beguile - 6 freq boys'll - 1 freq buckle - 12 freq boag-owl - 1 freq bos'll - 1 freq bugle - 2 freq busily - 6 freq bigly - 2 freq back-alley - 1 freq bauchlie - 1 freq bushel - 5 freq buzzle - 1 freq bachly - 1 freq boysoul - 1 freq bag'll - 1 freq beagle - 2 freq basil - 2 freq boggle - 1 freq bugil - 1 freq bauchly - 1 freq bejewel - 1 freq bauchil - 3 freq bsl - 22 freq bogil - 4 freq boogaloo - 1 freq boswell - 3 freq booglie - 1 freq boxieweel - 1 freq baigle - 1 freq boag-hole - 1 freq begley - 3 freq buswell - 1 freq bbckile - 1 freq bpklw - 1 freq 'bsl - 1 freq bosilla - 1 freq beccsley - 1 freq 'bauchle' - 1 freq |
MetaPhone code - BSL boays'll - 1 freq bussell - 1 freq boys'll - 1 freq bos'll - 1 freq busily - 6 freq buzzle - 1 freq boysoul - 1 freq basil - 2 freq bsl - 22 freq 'bsl - 1 freq bosilla - 1 freq |
BSL |
| Time to execute Levenshtein function - 0.283497 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.506021 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.033718 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.037801 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.000949 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. |