| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benthorn (0) - 1 freq bethern (2) - 1 freq banchory (3) - 6 freq inkhorn (3) - 2 freq bentowre (3) - 1 freq bntton (3) - 1 freq benson (3) - 1 freq hawthorn (3) - 3 freq mentor (3) - 2 freq beaton (3) - 35 freq bethan (3) - 1 freq enshore (3) - 2 freq bentham (3) - 1 freq lentern (3) - 3 freq brethern (3) - 3 freq findhorn (3) - 2 freq gethern (3) - 1 freq beethoven (3) - 1 freq bertson (3) - 1 freq leathern (3) - 3 freq renton (3) - 4 freq sentor (3) - 1 freq benidorm (3) - 6 freq benisoun (3) - 1 freq bentos (3) - 1 freq |
benthorn (0) - 1 freq bethern (3) - 1 freq bothern (4) - 4 freq brethern (4) - 3 freq batherin (5) - 5 freq bletherin (5) - 81 freq juntherin (5) - 3 freq bleatherin (5) - 1 freq brethren (5) - 1 freq blethrin (5) - 1 freq thorn (5) - 9 freq betther (5) - 18 freq bighorn (5) - 1 freq whithorn (5) - 2 freq wuntherin (5) - 1 freq belther (5) - 1 freq berthen (5) - 3 freq botherin (5) - 13 freq leathern (5) - 3 freq wantherin (5) - 2 freq bletheran (5) - 1 freq beethoven (5) - 1 freq hawthorn (5) - 3 freq banterin (5) - 1 freq bentowre (5) - 1 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 - BN0RN benthorn - 1 freq |
BENTHORN |
| Time to execute Levenshtein function - 0.236023 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.398123 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.029876 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.037950 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.001080 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. |