| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bandit (0) - 7 freq handit (1) - 27 freq bendit (1) - 2 freq landit (1) - 52 freq pandit (1) - 57 freq brandit (1) - 5 freq randit (1) - 1 freq bannit (1) - 2 freq bondit (1) - 1 freq bankit (1) - 1 freq bandits (1) - 5 freq mankit (2) - 9 freq landet (2) - 5 freq dandie (2) - 1 freq beardit (2) - 2 freq windit (2) - 5 freq haudit (2) - 42 freq handin (2) - 15 freq baldin (2) - 1 freq wanlit (2) - 4 freq braidit (2) - 3 freq dangit (2) - 1 freq bankie (2) - 2 freq fadit (2) - 10 freq raidit (2) - 2 freq |
bandit (0) - 7 freq bondit (1) - 1 freq bendit (1) - 2 freq bankit (2) - 1 freq handit (2) - 27 freq bannit (2) - 2 freq bandits (2) - 5 freq boundit (2) - 1 freq randit (2) - 1 freq landit (2) - 52 freq pandit (2) - 57 freq brandit (2) - 5 freq bindie (3) - 1 freq mandat (3) - 2 freq banditry (3) - 1 freq blaudit (3) - 2 freq bardet (3) - 1 freq bendie (3) - 2 freq bondic (3) - 1 freq bendin (3) - 15 freq bandied (3) - 1 freq fundit (3) - 19 freq tendit (3) - 19 freq bannet (3) - 1 freq laandit (3) - 4 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 |
BANDIT |
| Time to execute Levenshtein function - 0.187975 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.329837 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.028268 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.039827 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.001297 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. |