| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bantered (0) - 1 freq santered (1) - 2 freq battered (1) - 37 freq wandered (2) - 25 freq watered (2) - 6 freq entered (2) - 40 freq battened (2) - 2 freq tattered (2) - 7 freq batteren (2) - 1 freq contered (2) - 2 freq mastered (2) - 1 freq banter (2) - 43 freq mattered (2) - 5 freq baegered (2) - 1 freq wintered (2) - 2 freq mannered (2) - 1 freq sauntered (2) - 5 freq ventered (2) - 1 freq cattered (2) - 2 freq dandered (2) - 11 freq naitered (2) - 1 freq bettered (2) - 4 freq dannered (2) - 1 freq blintered (2) - 2 freq banefed (2) - 2 freq |
bantered (0) - 1 freq battered (2) - 37 freq santered (2) - 2 freq naitered (3) - 1 freq sauntered (3) - 5 freq bettered (3) - 4 freq banterin (3) - 1 freq buttered (3) - 19 freq centered (3) - 1 freq wintered (3) - 2 freq blintered (3) - 2 freq ventered (3) - 1 freq contered (3) - 2 freq banter (3) - 43 freq entered (3) - 40 freq hattered (4) - 7 freq captered (4) - 1 freq bastard (4) - 102 freq wattered (4) - 8 freq antlered (4) - 1 freq wannered (4) - 3 freq cankered (4) - 1 freq yattered (4) - 1 freq pattered (4) - 1 freq bunter (4) - 8 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 - BNTRT bantered - 1 freq |
BANTERED |
| Time to execute Levenshtein function - 0.214831 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.367743 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.028623 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.038150 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.001301 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. |