| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| basil (0) - 2 freq bail (1) - 14 freq basic (1) - 47 freq basis (1) - 45 freq fasil (1) - 1 freq basin (1) - 22 freq baim (2) - 1 freq bogil (2) - 4 freq basso (2) - 2 freq aafil (2) - 199 freq masit (2) - 1 freq rail (2) - 29 freq bbsit (2) - 1 freq easin (2) - 11 freq bal (2) - 6 freq atil (2) - 17 freq tail (2) - 263 freq brasi (2) - 1 freq nasl (2) - 1 freq bastils (2) - 1 freq sail (2) - 100 freq banie (2) - 1 freq busie (2) - 1 freq babie (2) - 1 freq asail (2) - 1 freq |
basil (0) - 2 freq bail (2) - 14 freq bsl (2) - 22 freq basin (2) - 22 freq busily (2) - 6 freq fasil (2) - 1 freq basis (2) - 45 freq basic (2) - 47 freq based (3) - 83 freq base (3) - 39 freq bases (3) - 6 freq bali (3) - 1 freq babel (3) - 7 freq nasal (3) - 8 freq asl (3) - 1 freq basalt (3) - 2 freq basm (3) - 1 freq bruil (3) - 1 freq masel (3) - 1006 freq baste (3) - 8 freq baul (3) - 2 freq bybil (3) - 1 freq bawl (3) - 4 freq deasil (3) - 1 freq busin (3) - 1 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 boag-owl - 1 freq buckle - 11 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 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 |
BASIL |
| Time to execute Levenshtein function - 0.488792 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.906400 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.098463 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.104257 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. |