| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| busiest (0) - 3 freq busied (2) - 1 freq busie (2) - 1 freq bushes (2) - 41 freq biest (2) - 1 freq busses (2) - 18 freq buist (2) - 5 freq bussies (2) - 1 freq buses' (2) - 1 freq busier (2) - 3 freq aesiest (2) - 1 freq easiest (2) - 17 freq bestest (2) - 5 freq buriet (2) - 14 freq buses (2) - 45 freq business (2) - 295 freq bosies (2) - 18 freq briest (2) - 5 freq basnet (3) - 2 freq cuist (3) - 14 freq puirest (3) - 3 freq buster (3) - 2 freq auldest (3) - 46 freq brunies (3) - 1 freq gushet (3) - 2 freq |
busiest (0) - 3 freq easiest (3) - 17 freq aesiest (3) - 1 freq buses (3) - 45 freq bosies (3) - 18 freq bisset (3) - 4 freq briest (3) - 5 freq buses' (3) - 1 freq bestest (3) - 5 freq busses (3) - 18 freq buist (3) - 5 freq biest (3) - 1 freq bussies (3) - 1 freq gusset (4) - 1 freq basses (4) - 2 freq beest (4) - 11 freq basket (4) - 62 freq bussie (4) - 7 freq wusst (4) - 3 freq blisst (4) - 19 freq bassett (4) - 1 freq burst (4) - 187 freq basis (4) - 46 freq best (4) - 1613 freq suist (4) - 1 freq |
SoundEx code - B223 begowkt - 1 freq biggest - 141 freq besieged - 2 freq begeckit - 1 freq begaikit - 1 freq beseeched - 1 freq biggist - 2 freq bogwhistle - 1 freq bigest - 1 freq besocht - 2 freq bequesting - 1 freq begowkit - 3 freq busiest - 3 freq baagest - 7 freq beegest - 1 freq beswakkit - 1 freq bequestin - 1 freq beseigit - 1 freq bbcquestiontime - 6 freq bxhksdm - 1 freq bookweekscot - 9 freq bjiokqhtoo - 1 freq bookweekscotland - 4 freq bbceastscot - 7 freq |
MetaPhone code - BSST busiest - 3 freq |
BUSIEST |
| Time to execute Levenshtein function - 0.209921 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.423793 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.028224 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.037961 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.000928 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. |