| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunter (0) - 8 freq bunker (1) - 22 freq aunter (1) - 2 freq dunter (1) - 2 freq buster (1) - 2 freq munter (1) - 1 freq bunder (1) - 1 freq butter (1) - 129 freq banter (1) - 43 freq punter (1) - 15 freq wunter (1) - 27 freq unter (1) - 1 freq hunter (1) - 48 freq chunter (2) - 1 freq beater (2) - 11 freq butted (2) - 5 freq bunnet (2) - 111 freq suner (2) - 3 freq quater (2) - 5 freq munster (2) - 7 freq hunger (2) - 46 freq lunder (2) - 1 freq bitter (2) - 109 freq bute (2) - 13 freq budder (2) - 47 freq |
bunter (0) - 8 freq banter (1) - 43 freq punter (2) - 15 freq unter (2) - 1 freq hunter (2) - 48 freq bunker (2) - 22 freq butter (2) - 129 freq wunter (2) - 27 freq bunder (2) - 1 freq aunter (2) - 2 freq buster (2) - 2 freq dunter (2) - 2 freq munter (2) - 1 freq menter (3) - 1 freq buntin (3) - 4 freq center (3) - 9 freq bender (3) - 4 freq bluiter (3) - 1 freq inter (3) - 2 freq belter (3) - 34 freq buttery (3) - 24 freq buttir (3) - 2 freq quanter (3) - 4 freq penter (3) - 5 freq beter (3) - 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 bantered - 1 freq bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boondaries - 6 freq boundary - 2 freq binder - 22 freq bunder - 1 freq binder-twine - 1 freq bender - 4 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 bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boundary - 2 freq binder - 22 freq bunder - 1 freq bender - 4 freq bandara - 11 freq |
BUNTER |
| Time to execute Levenshtein function - 0.178566 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.348112 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.027723 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.037066 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.000805 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. |