| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bounin (0) - 1 freq boundin (1) - 7 freq boufin (1) - 3 freq brounin (1) - 1 freq sounin (1) - 8 freq bouin (1) - 5 freq bouncin (1) - 12 freq roupin (2) - 4 freq bonie (2) - 13 freq poutin (2) - 2 freq bokin (2) - 5 freq rousin (2) - 5 freq blumin (2) - 1 freq bonnie (2) - 811 freq louin (2) - 1 freq moanin (2) - 24 freq connin (2) - 1 freq bulin (2) - 1 freq drounin (2) - 12 freq busin (2) - 1 freq beinin (2) - 1 freq boldin (2) - 1 freq bombin (2) - 4 freq tunin (2) - 12 freq bodmin (2) - 1 freq |
bounin (0) - 1 freq bonnie (2) - 811 freq beinin (2) - 1 freq bonn (2) - 2 freq bouncin (2) - 12 freq bunn (2) - 1 freq bunion (2) - 1 freq bouin (2) - 5 freq boufin (2) - 3 freq boundin (2) - 7 freq sounin (2) - 8 freq brounin (2) - 1 freq soonin (3) - 1 freq boonsin (3) - 1 freq bootin (3) - 2 freq haunin (3) - 7 freq joinin (3) - 7 freq nonin (3) - 1 freq boanny (3) - 4 freq bobin (3) - 1 freq bann (3) - 9 freq bruin (3) - 1 freq boatin (3) - 1 freq bount (3) - 1 freq boxin (3) - 13 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 |
BOUNIN |
| Time to execute Levenshtein function - 0.226579 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.513806 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.028183 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.077590 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.001210 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. |