| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| busted (0) - 5 freq dusted (1) - 6 freq busied (1) - 1 freq buited (1) - 1 freq busked (1) - 5 freq buster (1) - 2 freq bussed (1) - 3 freq bested (1) - 2 freq rusted (1) - 5 freq butted (1) - 5 freq dysted (2) - 1 freq listed (2) - 7 freq blurted (2) - 6 freq cutted (2) - 1 freq batted (2) - 1 freq blasted (2) - 7 freq bustit (2) - 2 freq burned (2) - 32 freq suited (2) - 16 freq fushed (2) - 3 freq bashed (2) - 8 freq hunted (2) - 11 freq duster (2) - 12 freq belted (2) - 15 freq bute (2) - 13 freq |
busted (0) - 5 freq bested (1) - 2 freq butted (2) - 5 freq boasted (2) - 1 freq bussed (2) - 3 freq boosted (2) - 1 freq rusted (2) - 5 freq buited (2) - 1 freq busied (2) - 1 freq busked (2) - 5 freq dusted (2) - 6 freq buster (2) - 2 freq bust (3) - 10 freq kisted (3) - 1 freq buskid (3) - 1 freq disted (3) - 1 freq bristed (3) - 3 freq abused (3) - 6 freq hosted (3) - 3 freq hasted (3) - 2 freq bosied (3) - 7 freq posted (3) - 21 freq baited (3) - 1 freq rousted (3) - 2 freq bustle (3) - 6 freq |
SoundEx code - B233 buchtit - 4 freq besotted - 3 freq baghdad - 1 freq boastit - 1 freq busted - 5 freq big-heidit - 3 freq buchtitin - 1 freq bested - 2 freq bustit - 2 freq bigotet - 2 freq bak-hauddit - 1 freq bàstat' - 1 freq back-tae-dunbar - 1 freq bagdad - 2 freq bagdad's - 1 freq boasted - 1 freq boosted - 1 freq backdate - 1 freq boycottit - 1 freq bigoted - 2 freq bucketheidista - 1 freq bbcscotweather - 5 freq bastet - 1 freq |
MetaPhone code - BSTT besotted - 3 freq boastit - 1 freq busted - 5 freq bested - 2 freq bustit - 2 freq bàstat' - 1 freq boasted - 1 freq boosted - 1 freq bastet - 1 freq |
BUSTED |
| Time to execute Levenshtein function - 0.225958 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.404418 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.029679 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.040271 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.000835 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. |