| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betocht (0) - 1 freq besocht (1) - 2 freq rethocht (2) - 1 freq bocht (2) - 219 freq yetoch (2) - 1 freq tocht (2) - 166 freq betch (2) - 1 freq bellocht (2) - 1 freq etcht (2) - 1 freq ketcht (2) - 1 freq brocht (2) - 733 freq €˜tocht (2) - 1 freq cocht (3) - 11 freq percht (3) - 2 freq brooch (3) - 9 freq beach' (3) - 1 freq 'nocht (3) - 1 freq retourt (3) - 1 freq lencht (3) - 4 freq watcht (3) - 8 freq procht (3) - 3 freq hoocht (3) - 3 freq i'thocht (3) - 1 freq bicht (3) - 2 freq betrothit (3) - 1 freq |
betocht (0) - 1 freq besocht (2) - 2 freq etcht (3) - 1 freq ketcht (3) - 1 freq bitchit (3) - 1 freq betch (3) - 1 freq brocht (3) - 733 freq bocht (3) - 219 freq tocht (3) - 166 freq hetchit (4) - 1 freq hatcht (4) - 1 freq stecht (4) - 2 freq techt (4) - 2 freq bricht (4) - 442 freq teucht (4) - 1 freq ticht (4) - 228 freq beachit (4) - 6 freq patcht (4) - 2 freq toucht (4) - 13 freq pitcht (4) - 1 freq bleacht (4) - 1 freq botch (4) - 1 freq bycht (4) - 1 freq titcht (4) - 1 freq fetchit (4) - 1 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 - BTXT betocht - 1 freq bedsheet - 2 freq |
BETOCHT |
| Time to execute Levenshtein function - 0.192645 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.380329 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.030556 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.039787 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.000877 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. |