| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedeckin (0) - 1 freq begeckit (2) - 1 freq bedecked (2) - 3 freq bleckin (2) - 1 freq deckin (2) - 2 freq bedeck (2) - 1 freq breckin (2) - 2 freq bedeckt (2) - 1 freq beekin (2) - 10 freq beseekin (2) - 2 freq bedein (2) - 2 freq blenkin (3) - 1 freq keechin (3) - 5 freq beheidin (3) - 3 freq deckit (3) - 6 freq bedeen (3) - 1 freq beemin (3) - 1 freq bekkin (3) - 1 freq dickin (3) - 3 freq duckin (3) - 3 freq skeckin (3) - 2 freq expeckin (3) - 21 freq beelin (3) - 22 freq beeching (3) - 1 freq declin (3) - 1 freq |
bedeckin (0) - 1 freq bedeck (3) - 1 freq breckin (3) - 2 freq deckin (3) - 2 freq bedeckt (3) - 1 freq bleckin (3) - 1 freq bedecked (3) - 3 freq brickin (4) - 2 freq duckin (4) - 3 freq dockin (4) - 3 freq brackin (4) - 2 freq blockin (4) - 17 freq dickin (4) - 3 freq blackin (4) - 5 freq buckin (4) - 3 freq bloackin (4) - 1 freq beckon (4) - 1 freq bedein (4) - 2 freq backin (4) - 41 freq beseekin (4) - 2 freq beekin (4) - 10 freq begeckit (4) - 1 freq baechin (5) - 1 freq begowkin (5) - 6 freq geckin (5) - 3 freq |
SoundEx code - B325 botswana - 9 freq botswana's - 1 freq budgin - 3 freq beautician - 8 freq bedchaumers - 3 freq bedchaumer - 5 freq bewitchin - 1 freq bed-chaumer - 1 freq buddhism - 7 freq beauticians - 1 freq beautician's - 1 freq bits-on-the-side - 1 freq bodie-kyn - 1 freq betoken - 1 freq bitchin - 2 freq botswanan - 1 freq baudkin - 1 freq betokened - 1 freq body-snatchers - 2 freq body-snatcher - 1 freq bedeckin - 1 freq bitsun - 1 freq buits-on-the-street - 1 freq bitching - 1 freq bitsnbobs - 1 freq btywgnclxf - 1 freq batesmoira - 6 freq budsmam - 1 freq botcoin - 1 freq bidixm - 1 freq |
MetaPhone code - BTKN bodie-kyn - 1 freq betoken - 1 freq baudkin - 1 freq bedeckin - 1 freq botcoin - 1 freq |
BEDECKIN |
| Time to execute Levenshtein function - 0.247362 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.397031 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.028111 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.043750 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.001167 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. |