| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bandeira (0) - 1 freq bandara (2) - 11 freq sandra (3) - 51 freq andra (3) - 116 freq pander (3) - 1 freq banker (3) - 12 freq handers (3) - 1 freq wanweiry (3) - 1 freq binders (3) - 1 freq banksia (3) - 1 freq benders (3) - 1 freq bandaras (3) - 2 freq anderina (3) - 1 freq wanderan (3) - 2 freq dander (3) - 61 freq bangers (3) - 3 freq baira (3) - 1 freq duneira (3) - 7 freq bandits (3) - 5 freq banner (3) - 19 freq binder (3) - 23 freq gander (3) - 14 freq balder (3) - 1 freq anders (3) - 1 freq bandies (3) - 1 freq |
bandeira (0) - 1 freq bandara (2) - 11 freq binder (3) - 23 freq bunder (3) - 1 freq bender (3) - 5 freq bandit (4) - 7 freq brander (4) - 2 freq rander (4) - 2 freq balder (4) - 1 freq gander (4) - 14 freq wander (4) - 41 freq bandies (4) - 1 freq bandied (4) - 1 freq banditry (4) - 1 freq badder (4) - 5 freq banger (4) - 5 freq banter (4) - 43 freq sander (4) - 1 freq banefire (4) - 3 freq lander (4) - 13 freq zander (4) - 43 freq binders (4) - 1 freq benders (4) - 1 freq banner (4) - 19 freq pander (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 - 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 |
BANDEIRA |
| Time to execute Levenshtein function - 0.219079 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.406268 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.028136 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.039438 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.000828 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. |