| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butcher (0) - 36 freq buther (1) - 11 freq butcherj (1) - 3 freq buncher (1) - 1 freq bucher (1) - 1 freq butchery (1) - 2 freq butchert (1) - 1 freq gutcher (1) - 1 freq butchers (1) - 12 freq butched (1) - 2 freq 'butcher (1) - 1 freq pitcher (2) - 1 freq butchered (2) - 4 freq bunches (2) - 6 freq watcher (2) - 1 freq €œbutcher (2) - 1 freq bither (2) - 12 freq bruther (2) - 1 freq bitches (2) - 6 freq uther (2) - 9 freq brocher (2) - 2 freq bother (2) - 322 freq butter (2) - 129 freq wuther (2) - 3 freq bucer (2) - 1 freq |
butcher (0) - 36 freq butchery (1) - 2 freq butchers (2) - 12 freq 'butcher (2) - 1 freq buther (2) - 11 freq gutcher (2) - 1 freq butched (2) - 2 freq butcherj (2) - 3 freq butchert (2) - 1 freq buncher (2) - 1 freq bucher (2) - 1 freq brocher (3) - 2 freq bother (3) - 322 freq blecher (3) - 2 freq butchart (3) - 1 freq betther (3) - 18 freq bather (3) - 58 freq butch (3) - 4 freq catcher (3) - 2 freq bither (3) - 12 freq bitches (3) - 6 freq butchered (3) - 4 freq watcher (3) - 1 freq pitcher (3) - 1 freq ticher (4) - 3 freq |
SoundEx code - B326 butcher's - 19 freq budweisers - 3 freq butcher - 36 freq butchert - 1 freq bootcher's - 1 freq butchered - 4 freq body-swerve - 1 freq budwiser - 2 freq butchers - 12 freq badger - 6 freq buttcher's - 1 freq budweiser - 3 freq butchery - 2 freq bodygaird - 1 freq bodyswerve - 1 freq €œbutcher - 1 freq butchering - 1 freq butchermeat - 1 freq butchart - 1 freq beautycreep - 1 freq 'butcher - 1 freq biodegradable - 2 freq butcherj - 3 freq |
MetaPhone code - BXR butcher - 36 freq bucher - 1 freq beshrew - 1 freq bow-cheir - 3 freq butchery - 2 freq €œbutcher - 1 freq bshara - 1 freq 'butcher - 1 freq |
BUTCHER |
| Time to execute Levenshtein function - 0.312722 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.568506 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.027427 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.067631 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.000835 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. |