| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boswell (0) - 3 freq foswell (1) - 6 freq roswell (1) - 1 freq boswells (1) - 1 freq buswell (1) - 1 freq orwell (2) - 4 freq bussell (2) - 1 freq aswell (2) - 6 freq bos'll (2) - 1 freq sowell (2) - 1 freq bowel (2) - 16 freq swell (2) - 17 freq do-well (2) - 2 freq bowels (2) - 9 freq bothwell (2) - 160 freq no-weel (3) - 1 freq bosied (3) - 7 freq stell (3) - 31 freq oswald (3) - 4 freq eesell (3) - 1 freq boys'll (3) - 1 freq bowly (3) - 3 freq uswall (3) - 1 freq 'spell (3) - 3 freq brussell (3) - 1 freq |
boswell (0) - 3 freq buswell (1) - 1 freq boswells (2) - 1 freq foswell (2) - 6 freq roswell (2) - 1 freq swell (3) - 17 freq sowell (3) - 1 freq bos'll (3) - 1 freq bussell (3) - 1 freq aswell (3) - 6 freq boys'll (4) - 1 freq swoll (4) - 1 freq sewell (4) - 1 freq swall (4) - 21 freq swill (4) - 2 freq asweill (4) - 2 freq uswall (4) - 1 freq alsweill (4) - 1 freq bowel (4) - 16 freq do-well (4) - 2 freq bothwell (4) - 160 freq bowels (4) - 9 freq orwell (4) - 4 freq 'smell (5) - 2 freq 'sell (5) - 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 boys'll - 1 freq buckle - 12 freq boag-owl - 1 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 |
BOSWELL |
| Time to execute Levenshtein function - 0.205714 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.476720 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.043138 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.037543 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.000888 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. |