| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bannin (0) - 5 freq lannin (1) - 2 freq bannie (1) - 1 freq pannin (1) - 2 freq tannin (1) - 12 freq bannit (1) - 2 freq vannin (1) - 1 freq banning (1) - 2 freq mannin (1) - 1 freq bangin (1) - 41 freq cannin (1) - 3 freq hannin (1) - 3 freq bannan (1) - 1 freq bannid (1) - 1 freq fannin (1) - 9 freq bankin (1) - 19 freq banking (2) - 3 freq runnin (2) - 219 freq mawnin (2) - 5 freq brankin (2) - 5 freq mansin (2) - 5 freq bawlin (2) - 19 freq yarnin (2) - 18 freq punnin (2) - 1 freq ennin (2) - 2 freq |
bannin (0) - 5 freq bannan (1) - 1 freq bannie (2) - 1 freq hannin (2) - 3 freq fannin (2) - 9 freq bankin (2) - 19 freq binnian (2) - 2 freq lannin (2) - 2 freq cannin (2) - 3 freq bannid (2) - 1 freq tannin (2) - 12 freq bangin (2) - 41 freq bannit (2) - 2 freq vannin (2) - 1 freq mannin (2) - 1 freq pannin (2) - 2 freq banning (2) - 2 freq funnin (3) - 7 freq bindin (3) - 6 freq brunnin (3) - 1 freq brennin (3) - 2 freq banned (3) - 35 freq bannet (3) - 1 freq bannos (3) - 1 freq cannen (3) - 3 freq |
SoundEx code - B550 benon - 1 freq bummin - 20 freq bowman - 4 freq beamin - 26 freq bounin - 1 freq banana - 45 freq bohemian - 2 freq boomin - 15 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.223986 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.535161 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.074683 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.081514 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.001006 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. |