| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banana (0) - 45 freq bananae (1) - 2 freq bananas (1) - 17 freq alana (2) - 12 freq sanna (2) - 5 freq nanna (2) - 1 freq bakan (2) - 1 freq bannan (2) - 1 freq baand (2) - 13 freq kanani (2) - 1 freq gangna (2) - 1 freq canada (2) - 39 freq bangan (2) - 1 freq banana's (2) - 2 freq nana (2) - 11 freq ganna (2) - 8 freq wanna (2) - 17 freq banannas (2) - 1 freq kanada (2) - 1 freq bonanza (2) - 2 freq bananaes (2) - 1 freq babaza (2) - 1 freq canna (2) - 1230 freq kanna (2) - 1 freq bayan (2) - 4 freq |
banana (0) - 45 freq bananae (1) - 2 freq bananas (2) - 17 freq bann (2) - 9 freq binna (2) - 29 freq bonn (3) - 2 freq banns (3) - 3 freq balaena (3) - 1 freq anna (3) - 18 freq bayan (3) - 4 freq basan (3) - 1 freq baank (3) - 1 freq bajan (3) - 2 freq kanna (3) - 1 freq bunny (3) - 4 freq bonny (3) - 501 freq benny (3) - 2 freq binne (3) - 1 freq benn (3) - 1 freq bunno (3) - 1 freq bannie (3) - 1 freq hanna (3) - 11 freq manna (3) - 12 freq canna (3) - 1230 freq nana (3) - 11 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 |
BANANA |
| Time to execute Levenshtein function - 0.245314 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.423764 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.028691 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.036977 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.000857 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. |