| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bannin (0) - 5 freq bannid (1) - 1 freq lannin (1) - 2 freq bangin (1) - 40 freq hannin (1) - 3 freq mannin (1) - 1 freq bannan (1) - 1 freq bannie (1) - 1 freq pannin (1) - 2 freq bannit (1) - 2 freq bankin (1) - 19 freq tannin (1) - 8 freq fannin (1) - 9 freq banning (1) - 2 freq vannin (1) - 1 freq cannin (1) - 3 freq mansin (2) - 5 freq ennin (2) - 2 freq sennin (2) - 12 freq dansin (2) - 14 freq jannie (2) - 10 freq baffin (2) - 1 freq jandin (2) - 1 freq wankin (2) - 4 freq barin (2) - 4 freq |
bannin (0) - 5 freq bannan (1) - 1 freq tannin (2) - 8 freq bankin (2) - 19 freq fannin (2) - 9 freq banning (2) - 2 freq binnian (2) - 2 freq cannin (2) - 3 freq bannit (2) - 2 freq vannin (2) - 1 freq bannid (2) - 1 freq pannin (2) - 2 freq lannin (2) - 2 freq bangin (2) - 40 freq bannie (2) - 1 freq mannin (2) - 1 freq hannin (2) - 3 freq lennin (3) - 2 freq mennin (3) - 3 freq banns (3) - 3 freq lunnin (3) - 1 freq sannn (3) - 1 freq fannan (3) - 1 freq tinnin (3) - 1 freq banner (3) - 19 freq |
SoundEx code - B550 benon - 1 freq bummin - 20 freq bowman - 4 freq beamin - 25 freq bounin - 1 freq banana - 45 freq bohemian - 2 freq boomin - 14 freq bammin - 3 freq binnian - 2 freq bananae - 2 freq booman - 2 freq by-nem - 1 freq bannan - 1 freq bannin - 5 freq bumin - 1 freq bemoan - 1 freq beinin - 1 freq byenem - 1 freq beamiin - 1 freq bonhomie - 1 freq bunion - 1 freq binmen - 1 freq bonum - 1 freq beemin - 1 freq |
MetaPhone code - BNN benon - 1 freq bounin - 1 freq banana - 45 freq binnian - 2 freq bananae - 2 freq benign - 2 freq bannan - 1 freq bannin - 5 freq beinin - 1 freq bunion - 1 freq |
BANNIN |
| Time to execute Levenshtein function - 0.231413 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.426671 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.026975 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.038893 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.000885 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. |