Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
banners (0) - 15 freq manners (1) - 17 freq bankers (1) - 4 freq tanners (1) - 4 freq sanners (1) - 2 freq fanners (1) - 1 freq bangers (1) - 3 freq wanners (1) - 3 freq banner (1) - 19 freq banter (2) - 43 freq dannert (2) - 3 freq baters (2) - 2 freq mangers (2) - 1 freq rangers (2) - 55 freq pansers (2) - 2 freq bakers (2) - 24 freq hinners (2) - 5 freq awners (2) - 3 freq manner' (2) - 2 freq baines (2) - 1 freq hauners (2) - 6 freq anne's (2) - 2 freq winners (2) - 30 freq jenners (2) - 6 freq gauners (2) - 1 freq |
banners (0) - 15 freq bangers (2) - 3 freq banner (2) - 19 freq fanners (2) - 1 freq wanners (2) - 3 freq sanners (2) - 2 freq manners (2) - 17 freq bankers (2) - 4 freq tanners (2) - 4 freq haunners (3) - 1 freq henners (3) - 1 freq mainners (3) - 20 freq gunners (3) - 1 freq waunners (3) - 2 freq runners (3) - 9 freq wunners (3) - 21 freq bunnels (3) - 1 freq menners (3) - 2 freq bainner (3) - 2 freq bonkers (3) - 5 freq burners (3) - 7 freq cinners (3) - 4 freq sinners (3) - 8 freq denners (3) - 11 freq tenners (3) - 4 freq |
SoundEx code - B562 banners - 15 freq bummers - 18 freq bunroku - 1 freq bonnyrigg - 23 freq bonnyrigg's - 4 freq beaumarchais - 1 freq bummer's - 2 freq boomers - 1 freq bmraqbp - 1 freq benreez - 1 freq bnrwj - 1 freq banhorseracing - 1 freq bonnyriggrose - 26 freq bonnyriggams - 1 freq bonnyriggs - 1 freq |
MetaPhone code - BNRS banners - 15 freq benreez - 1 freq |
BANNERS |
Time to execute Levenshtein function - 0.187328 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.381937 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.029324 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.037857 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.000903 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. |