| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunion (0) - 1 freq union (1) - 192 freq bunions (1) - 2 freq bunsen (2) - 28 freq button (2) - 92 freq bunn (2) - 1 freq union' (2) - 1 freq bunlan (2) - 1 freq bulin (2) - 1 freq uinion (2) - 1 freq lundon (2) - 2 freq burnin (2) - 131 freq unison (2) - 8 freq junior (2) - 30 freq tunin (2) - 12 freq buin (2) - 12 freq burron (2) - 1 freq buyin (2) - 84 freq benon (2) - 1 freq minion (2) - 3 freq unions (2) - 8 freq bungin (2) - 3 freq bunden (2) - 1 freq benign (2) - 2 freq brunton (2) - 24 freq |
bunion (0) - 1 freq bounin (2) - 1 freq benon (2) - 1 freq bunn (2) - 1 freq bunno (2) - 1 freq union (2) - 192 freq bunions (2) - 2 freq bonn (3) - 2 freq inion (3) - 1 freq buxin (3) - 2 freq onion (3) - 14 freq buon (3) - 1 freq buntin (3) - 4 freq buirn (3) - 2 freq bukin (3) - 1 freq reunion (3) - 6 freq bann (3) - 9 freq bunny (3) - 4 freq busin (3) - 1 freq benign (3) - 2 freq beinn (3) - 2 freq bumin (3) - 1 freq beinin (3) - 1 freq benson (3) - 1 freq tunin (3) - 12 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 |
BUNION |
| Time to execute Levenshtein function - 0.208365 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.361127 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.030741 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.038214 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.000952 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. |