| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bannan (0) - 1 freq annan (1) - 4 freq gannan (1) - 1 freq rannan (1) - 1 freq fannan (1) - 1 freq bangan (1) - 1 freq bannin (1) - 5 freq vannan (1) - 1 freq bajan (2) - 2 freq bann (2) - 9 freq balkan (2) - 1 freq bannos (2) - 1 freq bangin (2) - 41 freq fandan (2) - 7 freq manna (2) - 12 freq yarnan (2) - 3 freq sanna (2) - 5 freq baskan (2) - 1 freq gainan (2) - 1 freq binnian (2) - 2 freq cannen (2) - 3 freq baidan (2) - 1 freq kannae (2) - 1 freq bakan (2) - 1 freq baetan (2) - 1 freq |
bannan (0) - 1 freq bannin (1) - 5 freq binnian (2) - 2 freq bangan (2) - 1 freq vannan (2) - 1 freq fannan (2) - 1 freq gannan (2) - 1 freq annan (2) - 4 freq rannan (2) - 1 freq bannet (3) - 1 freq bananae (3) - 2 freq bannid (3) - 1 freq runnan (3) - 25 freq winnan (3) - 1 freq kennan (3) - 14 freq bankin (3) - 19 freq rinnan (3) - 3 freq banner (3) - 19 freq pennan (3) - 2 freq banns (3) - 3 freq bunlan (3) - 1 freq mannin (3) - 1 freq brennan (3) - 15 freq bannie (3) - 1 freq hannin (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 |
BANNAN |
| Time to execute Levenshtein function - 0.206748 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.368230 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.029128 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.041758 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.001316 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. |