| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baddest (0) - 1 freq maddest (1) - 3 freq saddest (1) - 5 freq laddert (2) - 1 freq baest (2) - 27 freq bauldest (2) - 1 freq ballest (2) - 3 freq braidest (2) - 8 freq radgest (2) - 2 freq hardest (2) - 17 freq badges (2) - 11 freq oddest (2) - 1 freq addet (2) - 25 freq saddent (2) - 1 freq bawdiest (2) - 1 freq baagest (2) - 7 freq badder (2) - 5 freq bardet (2) - 1 freq aldest (2) - 1 freq badness (2) - 12 freq baddies (2) - 3 freq aaldest (2) - 8 freq fardest (2) - 4 freq maest (3) - 15 freq adds (3) - 23 freq |
baddest (0) - 1 freq saddest (2) - 5 freq maddest (2) - 3 freq braidest (3) - 8 freq baddies (3) - 3 freq bawdiest (3) - 1 freq oddest (3) - 1 freq bauldest (3) - 1 freq buddies (4) - 14 freq brodist (4) - 1 freq buddies' (4) - 1 freq aaldest (4) - 8 freq fardest (4) - 4 freq beddis (4) - 1 freq beddies (4) - 2 freq biddies (4) - 3 freq broadest (4) - 3 freq buddhist (4) - 19 freq budapest (4) - 3 freq beddit (4) - 16 freq bedpost (4) - 1 freq hardest (4) - 17 freq badges (4) - 11 freq addet (4) - 25 freq badness (4) - 12 freq |
SoundEx code - B323 bedside - 20 freq bedecked - 3 freq baddest - 1 freq bitchit - 1 freq buddhist - 19 freq bedsheets - 2 freq budjct - 1 freq budget - 31 freq budget's - 2 freq betwixt - 7 freq bethsaida - 5 freq budged - 1 freq bawdiest - 1 freq betocht - 1 freq bedsit - 4 freq bedsyde - 1 freq bedsteid - 1 freq budgeted - 1 freq budgets - 6 freq bad-used - 1 freq butched - 2 freq bodhisattva - 1 freq bedsheet - 2 freq budgetit - 1 freq buddhists - 2 freq bed-syde - 1 freq beidside - 1 freq bedeckt - 1 freq bathgate - 4 freq bdxtb - 1 freq butwheyisgettingthedrinksin - 1 freq bidscotland - 1 freq budgetin - 1 freq bdzt - 1 freq bootstrapcook - 7 freq btwktk - 1 freq |
MetaPhone code - BTST bedside - 20 freq baddest - 1 freq bawdiest - 1 freq bedsit - 4 freq bedsyde - 1 freq bad-used - 1 freq bed-syde - 1 freq beidside - 1 freq bdzt - 1 freq |
BADDEST bad - 949 freq badder - 5 freq baddest - 1 freq |
| Time to execute Levenshtein function - 0.409373 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.707756 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.035053 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.070534 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.001219 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. |