| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buswell (0) - 1 freq bussell (1) - 1 freq boswell (1) - 3 freq foswell (2) - 6 freq aswell (2) - 6 freq burrell (2) - 4 freq brussell (2) - 1 freq bushel (2) - 5 freq swell (2) - 17 freq uswall (2) - 1 freq bushels (2) - 1 freq russell (2) - 37 freq boswells (2) - 1 freq roswell (2) - 1 freq well (3) - 1394 freq bushes (3) - 41 freq busily (3) - 6 freq bell (3) - 210 freq maxwell (3) - 16 freq busied (3) - 1 freq mussels (3) - 5 freq sell (3) - 164 freq eisweel (3) - 3 freq €œwell (3) - 23 freq burrel (3) - 1 freq |
buswell (0) - 1 freq boswell (1) - 3 freq bussell (2) - 1 freq uswall (3) - 1 freq roswell (3) - 1 freq boswells (3) - 1 freq swell (3) - 17 freq aswell (3) - 6 freq foswell (3) - 6 freq swill (4) - 2 freq sewell (4) - 1 freq swall (4) - 20 freq alsweill (4) - 1 freq sowell (4) - 1 freq asweill (4) - 2 freq swoll (4) - 1 freq uswally (4) - 1 freq bos'll (4) - 1 freq bushel (4) - 5 freq russell (4) - 37 freq brussell (4) - 1 freq bushels (4) - 1 freq burrell (4) - 4 freq bowels (5) - 9 freq hisell (5) - 2 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 - BSWL boswell - 3 freq buswell - 1 freq |
BUSWELL |
| Time to execute Levenshtein function - 0.253637 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.408086 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.028317 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.037278 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.000796 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. |