| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bandied (0) - 1 freq andied (1) - 1 freq bandies (1) - 1 freq sandier (2) - 2 freq bonxied (2) - 1 freq sandie (2) - 32 freq banties (2) - 1 freq dandie (2) - 1 freq candid (2) - 1 freq bondie (2) - 3 freq fancied (2) - 31 freq baldie (2) - 23 freq bandit (2) - 7 freq bawdies (2) - 1 freq bandaged (2) - 2 freq bindie (2) - 1 freq wandred (2) - 1 freq brandie (2) - 2 freq jundied (2) - 4 freq bonded (2) - 3 freq handled (2) - 7 freq bawdie (2) - 2 freq bankie (2) - 2 freq bardies (2) - 1 freq bundled (2) - 1 freq |
bandied (0) - 1 freq bended (2) - 4 freq bonded (2) - 3 freq bandies (2) - 1 freq andied (2) - 1 freq handed (3) - 49 freq branded (3) - 5 freq baddie (3) - 2 freq vanded (3) - 1 freq banned (3) - 35 freq bodied (3) - 2 freq bundie (3) - 1 freq banged (3) - 26 freq bannid (3) - 1 freq banjoed (3) - 1 freq bounded (3) - 7 freq banefed (3) - 2 freq banked (3) - 2 freq landed (3) - 70 freq bendie (3) - 2 freq andoed (3) - 1 freq bundled (3) - 1 freq bandaged (3) - 2 freq bondie (3) - 3 freq bandit (3) - 7 freq |
SoundEx code - B533 bindwood - 2 freq bounded - 7 freq banditti - 1 freq bonded - 3 freq bended - 4 freq bendit - 2 freq bandit - 7 freq banditry - 1 freq bondit - 1 freq bandits - 5 freq bawn-heided - 1 freq bindweed - 2 freq bindwuid - 3 freq bandied - 1 freq boundit - 1 freq beamtet - 1 freq |
MetaPhone code - BNTT bounded - 7 freq banditti - 1 freq bonded - 3 freq bended - 4 freq bendit - 2 freq bandit - 7 freq bondit - 1 freq bandied - 1 freq boundit - 1 freq |
BANDIED |
| Time to execute Levenshtein function - 0.219293 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.406632 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.033858 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.045302 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.001102 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. |