| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benidorm (0) - 6 freq seniors (3) - 2 freq uniform (3) - 49 freq tenior (3) - 1 freq vendor (3) - 1 freq benthorn (3) - 1 freq bender (3) - 5 freq benisoun (3) - 1 freq senior (3) - 40 freq enorm (3) - 11 freq benders (3) - 1 freq fandom (4) - 1 freq rendirs (4) - 2 freq bewildert (4) - 2 freq kendo (4) - 2 freq beirt (4) - 1 freq neibors (4) - 7 freq censor (4) - 3 freq deform (4) - 1 freq rendir (4) - 1 freq binder (4) - 23 freq bendy (4) - 3 freq hendry (4) - 6 freq tenor (4) - 4 freq befio (4) - 1 freq |
benidorm (0) - 6 freq bender (4) - 5 freq benders (4) - 1 freq binder (5) - 23 freq bunder (5) - 1 freq nendrum (5) - 3 freq lendrum (5) - 1 freq binders (5) - 1 freq bandara (5) - 11 freq bedroom (5) - 154 freq vendor (5) - 1 freq enorm (5) - 11 freq uniform (5) - 49 freq enders (6) - 2 freq bangor (6) - 9 freq conform (6) - 14 freq endre (6) - 1 freq uinifurm (6) - 3 freq syndrom (6) - 1 freq buikworm (6) - 1 freq bentham (6) - 1 freq bonjoor (6) - 2 freq blender (6) - 3 freq endonym (6) - 2 freq benedick (6) - 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 - BNTRM benidorm - 6 freq |
BENIDORM |
| Time to execute Levenshtein function - 0.307320 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.414773 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.028055 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.037989 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.000945 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. |