| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banterin (0) - 1 freq batterin (1) - 28 freq canterin (1) - 1 freq santerin (1) - 1 freq barterin (1) - 1 freq blatterin (2) - 5 freq wanderin (2) - 36 freq winterin (2) - 1 freq alterin (2) - 2 freq danderin (2) - 6 freq banter (2) - 43 freq batteren (2) - 1 freq watterin (2) - 12 freq wantherin (2) - 2 freq batterit (2) - 1 freq patterin (2) - 6 freq hankerin (2) - 3 freq barberin (2) - 1 freq wannerin (2) - 9 freq matterin (2) - 1 freq mantein (2) - 1 freq walterin (2) - 3 freq natterin (2) - 4 freq batherin (2) - 5 freq yatterin (2) - 4 freq |
banterin (0) - 1 freq batterin (2) - 28 freq santerin (2) - 1 freq barterin (2) - 1 freq canterin (2) - 1 freq antrin (3) - 67 freq interin (3) - 1 freq anteran (3) - 1 freq saunterin (3) - 5 freq bastern (3) - 2 freq binnerin (3) - 1 freq lantern (3) - 29 freq aunterin (3) - 1 freq bantered (3) - 1 freq butterin (3) - 2 freq winterin (3) - 1 freq blinterin (3) - 8 freq enterin (3) - 20 freq banter (3) - 43 freq conterin (3) - 7 freq batteren (3) - 1 freq betterin (3) - 3 freq badderin (4) - 1 freq battering (4) - 2 freq branderin (4) - 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 - BNTRN banterin - 1 freq |
BANTERIN |
| Time to execute Levenshtein function - 0.303098 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.622120 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.029193 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.044639 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.000893 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. |