| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bane-weary (0) - 2 freq bane-deep (4) - 3 freq baneyerd (4) - 1 freq one-wey (4) - 1 freq a-leary (4) - 1 freq any-whar (4) - 1 freq janwerry (4) - 1 freq brewery (4) - 6 freq wanweiry (4) - 1 freq one-year (4) - 1 freq bane-thirl (4) - 1 freq one-way (4) - 1 freq unnerwear (4) - 1 freq bestiary (5) - 1 freq baetween (5) - 4 freq mantie-wark (5) - 1 freq answers (5) - 72 freq wanceower (5) - 1 freq ae-day (5) - 1 freq half-wey (5) - 1 freq ae-word (5) - 1 freq jack-easy (5) - 2 freq naewey (5) - 11 freq answer- (5) - 1 freq bewaar (5) - 1 freq |
bane-weary (0) - 2 freq brewery (6) - 6 freq wanweiry (6) - 1 freq one-way (6) - 1 freq unnerwear (6) - 1 freq byde-ower (6) - 1 freq one-year (6) - 1 freq any-whar (6) - 1 freq bane-deep (6) - 3 freq one-wey (6) - 1 freq banger (7) - 5 freq banister (7) - 2 freq nae-weel (7) - 6 freq answeir (7) - 2 freq banditry (7) - 1 freq win-ower (7) - 1 freq oneywury (7) - 1 freq brawery (7) - 1 freq pre-war (7) - 2 freq buik-lear (7) - 2 freq banefire (7) - 3 freq bunkery (7) - 2 freq banker (7) - 12 freq bandeira (7) - 1 freq banchory (7) - 6 freq |
SoundEx code - B560 bonnier - 24 freq bummer - 21 freq binner - 2 freq bane-weary - 2 freq banner - 19 freq bainner - 2 freq beamer - 12 freq boomer - 1 freq binary - 4 freq bawmurrie - 1 freq bummerie - 1 freq bynear - 2 freq beemer - 2 freq baunner - 5 freq bmr - 1 freq |
MetaPhone code - BNWR bane-weary - 2 freq |
BANE-WEARY |
| Time to execute Levenshtein function - 0.200684 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.362063 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.027729 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.037792 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.000795 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. |