| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bandits (0) - 5 freq bandies (1) - 1 freq bandit (1) - 7 freq bendit (2) - 2 freq banditry (2) - 1 freq bankins (2) - 2 freq baits (2) - 3 freq band's (2) - 1 freq handis (2) - 1 freq randit (2) - 1 freq bawdies (2) - 1 freq baddies (2) - 3 freq banditti (2) - 1 freq bankit (2) - 1 freq banis (2) - 1 freq bannit (2) - 2 freq anits (2) - 2 freq landit (2) - 52 freq bondit (2) - 1 freq bants (2) - 5 freq randies (2) - 2 freq brandies (2) - 1 freq landis (2) - 6 freq brandit (2) - 5 freq landins (2) - 3 freq |
bandits (0) - 5 freq bandit (2) - 7 freq bandies (2) - 1 freq bants (3) - 5 freq bondit (3) - 1 freq bindins (3) - 1 freq banties (3) - 1 freq banditti (3) - 1 freq pundits (3) - 7 freq bands (3) - 41 freq bendit (3) - 2 freq band's (3) - 1 freq banditry (3) - 1 freq bunnets (4) - 9 freq bonnets (4) - 5 freq baund's (4) - 1 freq bandages (4) - 5 freq binds (4) - 7 freq bunts (4) - 1 freq bawdies (4) - 1 freq bond's (4) - 1 freq baunds (4) - 5 freq conduits (4) - 1 freq binders (4) - 1 freq bundles (4) - 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 - BNTTS bandits - 5 freq |
BANDITS |
| Time to execute Levenshtein function - 0.187213 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.345320 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.027661 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.037139 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. |