| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banditti (0) - 1 freq bandits (2) - 5 freq bandit (2) - 7 freq banditry (2) - 1 freq bandied (3) - 1 freq bandies (3) - 1 freq bannit (3) - 2 freq bankit (3) - 1 freq landit (3) - 52 freq pacitti (3) - 2 freq bendit (3) - 2 freq randit (3) - 1 freq bondit (3) - 1 freq pandit-ji (3) - 9 freq handit (3) - 27 freq barkitt (3) - 1 freq barfittit (3) - 1 freq pandit (3) - 57 freq sandirt (3) - 1 freq brandit (3) - 5 freq dabaittie (4) - 2 freq wanlit (4) - 4 freq bawdie (4) - 2 freq bardet (4) - 1 freq wantit (4) - 280 freq |
banditti (0) - 1 freq bandit (3) - 7 freq banditry (3) - 1 freq bandits (3) - 5 freq bendit (4) - 2 freq bondit (4) - 1 freq bundlet (5) - 2 freq sandirt (5) - 1 freq brandit (5) - 5 freq bandicoot (5) - 1 freq abandont (5) - 5 freq boundit (5) - 1 freq bundelt (5) - 1 freq benedict (5) - 5 freq pandit (5) - 57 freq vendetta (5) - 1 freq bennett (5) - 6 freq landit (5) - 52 freq bankit (5) - 1 freq bandies (5) - 1 freq bandied (5) - 1 freq randit (5) - 1 freq bannit (5) - 2 freq barkitt (5) - 1 freq handit (5) - 27 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 |
BANDITTI |
| Time to execute Levenshtein function - 0.255049 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.417502 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.037058 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.043256 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.000917 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. |