| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banter (0) - 43 freq banger (1) - 5 freq banker (1) - 12 freq batter (1) - 74 freq anter (1) - 1 freq baxter (1) - 16 freq canter (1) - 3 freq ranter (1) - 1 freq barter (1) - 3 freq banner (1) - 19 freq bunter (1) - 8 freq batted (2) - 1 freq pander (2) - 1 freq sanger (2) - 1 freq better (2) - 1704 freq water (2) - 258 freq baitter (2) - 1 freq penter (2) - 5 freq maiter (2) - 71 freq banterin (2) - 1 freq eater (2) - 2 freq jater (2) - 1 freq walter (2) - 57 freq ganfer (2) - 2 freq batters (2) - 8 freq |
banter (0) - 43 freq bunter (1) - 8 freq barter (2) - 3 freq banner (2) - 19 freq banker (2) - 12 freq ranter (2) - 1 freq banger (2) - 5 freq canter (2) - 3 freq anter (2) - 1 freq batter (2) - 74 freq baxter (2) - 16 freq blinter (3) - 2 freq dunter (3) - 2 freq biter (3) - 1 freq bantie (3) - 3 freq pinter (3) - 7 freq belter (3) - 34 freq minter (3) - 1 freq beater (3) - 11 freq bator (3) - 1 freq enter (3) - 74 freq painter (3) - 9 freq naeter (3) - 1 freq bantu (3) - 1 freq quanter (3) - 4 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 - BNTR banter - 43 freq bunter - 8 freq bender - 5 freq binder - 23 freq bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boundary - 2 freq bunder - 1 freq bandara - 11 freq |
BANTER |
| Time to execute Levenshtein function - 0.199299 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.375188 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.027797 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.043776 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.001139 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. |