| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| basketbaa (0) - 1 freq basketbaw (1) - 5 freq base-baa (2) - 1 freq basebaa (2) - 1 freq basketball (2) - 4 freq basebaw (3) - 4 freq baskets (3) - 8 freq basket (3) - 62 freq basket's (3) - 1 freq baaket (4) - 1 freq bak-raa (4) - 1 freq basker (4) - 1 freq casket (4) - 1 freq 'asterbaw (4) - 1 freq bassett (4) - 1 freq basnet (4) - 2 freq bakemeat (4) - 1 freq baetan (4) - 1 freq baseball (4) - 7 freq bastet (4) - 1 freq baskan (4) - 1 freq backet (4) - 8 freq asterbaw (4) - 8 freq gasket (4) - 2 freq backeth (4) - 1 freq |
basketbaa (0) - 1 freq basketbaw (2) - 5 freq baskets (4) - 8 freq basket (4) - 62 freq basebaa (4) - 1 freq base-baa (4) - 1 freq basketball (4) - 4 freq baisket (5) - 1 freq basket's (5) - 1 freq gasket (6) - 2 freq backet (6) - 8 freq baskan (6) - 1 freq backeth (6) - 1 freq asket (6) - 1 freq bastet (6) - 1 freq biskit (6) - 1 freq beskit (6) - 3 freq buskit (6) - 33 freq bassett (6) - 1 freq basker (6) - 1 freq baaket (6) - 1 freq basebaw (6) - 4 freq casket (6) - 1 freq basnet (6) - 2 freq beset (7) - 4 freq |
SoundEx code - B231 back-tae-front - 4 freq bowsied-app - 1 freq bus-stap - 2 freq backed-up - 1 freq bucketfu - 1 freq backstabbins - 1 freq basketball - 4 freq basketbaw - 5 freq bus-stop - 1 freq back-step - 1 freq boozed-up - 2 freq basketbaa - 1 freq boastful - 1 freq bucketfaes - 1 freq bqdv - 1 freq bestbehaviour - 1 freq bestpainterinhawick - 2 freq bctv - 1 freq bestbehavedbat - 1 freq besutiful - 1 freq beachedbirdsurvey - 1 freq bbcoutofdoors - 3 freq bbcdebatenight - 2 freq bpgtbkn - 1 freq bgtbhlub - 1 freq backstabbers - 1 freq bestford - 1 freq |
MetaPhone code - BSKTB basketbaw - 5 freq basketbaa - 1 freq |
BASKETBAA |
| Time to execute Levenshtein function - 0.197202 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.358425 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.028138 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.037655 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.000901 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. |