| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bane-thirl (0) - 1 freq bane-weary (4) - 2 freq bank-fiel (4) - 3 freq lang-tail (4) - 1 freq neethir (4) - 3 freq neithir (4) - 1 freq banefire (4) - 3 freq bathir (4) - 2 freq aneither (4) - 1 freq banesair (4) - 1 freq ane-time (4) - 1 freq unthirl (4) - 1 freq banffshire (4) - 6 freq lang-tairm (4) - 1 freq nae-tail (4) - 1 freq bane-ticht (4) - 1 freq anithir (4) - 17 freq anithers (5) - 5 freq boathir (5) - 3 freq aneth (5) - 178 freq whethir (5) - 3 freq neither (5) - 169 freq gaether (5) - 5 freq bathing (5) - 1 freq bare-fit (5) - 5 freq |
bane-thirl (0) - 1 freq unthirl (6) - 1 freq funetheral (7) - 1 freq nae-tail (7) - 1 freq bane-ticht (7) - 1 freq benthorn (7) - 1 freq aneither (7) - 1 freq anithir (7) - 17 freq bathir (7) - 2 freq neithir (7) - 1 freq neethir (7) - 3 freq bane-weary (7) - 2 freq enthral (8) - 2 freq anther (8) - 2 freq bethern (8) - 1 freq britherly (8) - 1 freq any-whar (8) - 1 freq blethers (8) - 63 freq brithir (8) - 2 freq naetril (8) - 1 freq yin-chiel (8) - 1 freq nether (8) - 26 freq banchory (8) - 6 freq anither (8) - 2011 freq brethern (8) - 3 freq |
SoundEx code - B536 banter - 43 freq bane-thirl - 1 freq benidorm - 6 freq bunter - 8 freq benders - 1 freq bonders' - 1 freq boundaries - 6 freq banterin - 1 freq bender - 5 freq binder - 23 freq bantered - 1 freq bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boondaries - 6 freq boundary - 2 freq bunder - 1 freq binder-twine - 1 freq bandara - 11 freq bandaras - 2 freq bandara's - 9 freq binders - 1 freq benthorn - 1 freq banterous - 1 freq bendorisrobert - 4 freq |
MetaPhone code - BN0RL bane-thirl - 1 freq |
BANE-THIRL |
| Time to execute Levenshtein function - 0.235518 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.387771 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.028426 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.038567 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.000948 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. |