| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boondaries (0) - 6 freq boundaries (1) - 6 freq foondries (2) - 2 freq boortries (3) - 1 freq boonies (3) - 1 freq foundries (3) - 1 freq boories (3) - 1 freq boondary (3) - 5 freq doondies (3) - 1 freq soondbites (4) - 1 freq sindries (4) - 1 freq bandies (4) - 1 freq whodares (4) - 2 freq boonces (4) - 4 freq yoonatics (4) - 1 freq bounties (4) - 2 freq 'rosaries (4) - 1 freq booncie (4) - 1 freq boaties (4) - 18 freq bandaras (4) - 2 freq glossaries (4) - 4 freq foonderin (4) - 2 freq booies (4) - 1 freq notaries (4) - 2 freq coories (4) - 5 freq |
boondaries (0) - 6 freq boundaries (1) - 6 freq foondries (3) - 2 freq boondary (4) - 5 freq foundries (4) - 1 freq bandaras (4) - 2 freq bonfires (5) - 8 freq bandara's (5) - 9 freq boonds (5) - 7 freq foonders (5) - 2 freq booncers (5) - 2 freq binders (5) - 1 freq boolders (5) - 8 freq roonders (5) - 2 freq boories (5) - 1 freq bandies (5) - 1 freq sindries (5) - 1 freq benders (5) - 1 freq bandages (5) - 5 freq doondies (5) - 1 freq boundary (5) - 2 freq boortries (5) - 1 freq boonies (5) - 1 freq bond's (6) - 1 freq founders (6) - 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 - BNTRS benders - 1 freq bonders' - 1 freq boundaries - 6 freq boondaries - 6 freq bandaras - 2 freq bandara's - 9 freq binders - 1 freq banterous - 1 freq |
BOONDARIES |
| Time to execute Levenshtein function - 0.368862 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.891544 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.098316 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.107824 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.000939 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. |