| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| binder (0) - 23 freq binders (1) - 1 freq blinder (1) - 3 freq minder (1) - 4 freq tinder (1) - 8 freq binner (1) - 2 freq finder (1) - 5 freq bigder (1) - 7 freq bidder (1) - 1 freq bunder (1) - 1 freq winder (1) - 112 freq kinder (1) - 5 freq bender (1) - 5 freq sinder (1) - 13 freq cinder (1) - 2 freq hinder (1) - 20 freq rinder (1) - 1 freq minger (2) - 7 freq bieber (2) - 1 freq bridder (2) - 26 freq kindey (2) - 1 freq linker (2) - 1 freq binge (2) - 4 freq biden (2) - 9 freq kidder (2) - 4 freq |
binder (0) - 23 freq bunder (1) - 1 freq bender (1) - 5 freq minder (2) - 4 freq kinder (2) - 5 freq cinder (2) - 2 freq hinder (2) - 20 freq binders (2) - 1 freq rinder (2) - 1 freq winder (2) - 112 freq sinder (2) - 13 freq binner (2) - 2 freq blinder (2) - 3 freq tinder (2) - 8 freq finder (2) - 5 freq bigder (2) - 7 freq bidder (2) - 1 freq yonder (3) - 67 freq pander (3) - 1 freq banker (3) - 12 freq builder (3) - 14 freq bunden (3) - 1 freq hender (3) - 1 freq 'under (3) - 2 freq budder (3) - 47 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 |
BINDER |
| Time to execute Levenshtein function - 0.217833 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.383946 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.028053 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.037665 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.000884 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. |