| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boondary (0) - 5 freq boundary (1) - 2 freq roonder (3) - 4 freq booncy (3) - 11 freq foondy (3) - 1 freq nlonday (3) - 1 freq boondaries (3) - 6 freq boondin (3) - 1 freq boonty (3) - 1 freq doonward (3) - 5 freq moanday (3) - 1 freq cowdary (3) - 1 freq ornary (3) - 1 freq foundry (3) - 4 freq binary (3) - 4 freq boolder (3) - 1 freq 'monday (3) - 1 freq booncers (3) - 2 freq foonders (3) - 2 freq bondage (3) - 2 freq monday (3) - 231 freq bandara (3) - 11 freq roonders (3) - 2 freq boonds (3) - 7 freq doonwart (3) - 3 freq |
boondary (0) - 5 freq boundary (1) - 2 freq bandara (3) - 11 freq byordar (4) - 1 freq boolder (4) - 1 freq binary (4) - 4 freq boonds (4) - 7 freq bunder (4) - 1 freq soonder (4) - 1 freq bender (4) - 5 freq boond (4) - 9 freq foundry (4) - 4 freq bondage (4) - 2 freq boondin (4) - 1 freq binder (4) - 23 freq boondaries (4) - 6 freq roonder (4) - 4 freq bandy (5) - 13 freq brander (5) - 2 freq bendan (5) - 1 freq bondic (5) - 1 freq bandaras (5) - 2 freq bolder (5) - 2 freq boundaries (5) - 6 freq bunkery (5) - 2 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 |
BOONDARY |
| Time to execute Levenshtein function - 0.244939 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.600710 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.069980 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.077027 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.000987 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. |