| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedsheet (0) - 2 freq bedsheets (1) - 2 freq benshees (2) - 2 freq besseen (3) - 1 freq sheet (3) - 89 freq reeshlet (3) - 1 freq wershest (3) - 1 freq belshaft (3) - 1 freq beestee (3) - 1 freq beseek (3) - 1 freq behest (3) - 2 freq bestest (3) - 5 freq bedsit (3) - 4 freq bedside (3) - 20 freq beset (3) - 4 freq banshee (3) - 15 freq beshrew (3) - 1 freq reishelt (3) - 1 freq reeshelt (3) - 2 freq braidsheet (3) - 2 freq bedsteid (3) - 1 freq bedsyde (3) - 1 freq banshees (3) - 6 freq red-het (3) - 1 freq bedeen (3) - 1 freq |
bedsheet (0) - 2 freq bedsheets (2) - 2 freq bedsit (4) - 4 freq braidsheet (4) - 2 freq benshees (4) - 2 freq sheet (5) - 89 freq bedsteid (5) - 1 freq banshee (5) - 15 freq banshees (5) - 6 freq red-het (5) - 1 freq breesht (5) - 5 freq berthet (5) - 1 freq beset (5) - 4 freq bedsyde (5) - 1 freq belshaft (5) - 1 freq bedside (5) - 20 freq beestee (5) - 1 freq behest (5) - 2 freq ashet (6) - 25 freq fesht (6) - 2 freq obedient (6) - 2 freq bedeckt (6) - 1 freq gushet (6) - 2 freq bassett (6) - 1 freq budget (6) - 31 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 betwixt - 7 freq bethsaida - 5 freq budged - 1 freq bawdiest - 1 freq betocht - 1 freq budget's - 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 - BTXT betocht - 1 freq bedsheet - 2 freq |
BEDSHEET |
| Time to execute Levenshtein function - 0.347431 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.565920 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.030034 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.071647 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.001063 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. |