| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banners (0) - 15 freq manners (1) - 17 freq banner (1) - 19 freq bangers (1) - 3 freq fanners (1) - 1 freq wanners (1) - 3 freq sanners (1) - 2 freq tanners (1) - 4 freq bankers (1) - 4 freq cannery (2) - 1 freq landers (2) - 10 freq awners (2) - 3 freq baxters (2) - 4 freq wanner (2) - 17 freq banger (2) - 5 freq winners (2) - 30 freq cinners (2) - 4 freq dinners (2) - 14 freq baegers (2) - 1 freq banker (2) - 12 freq bakers (2) - 23 freq haunners (2) - 1 freq bannet (2) - 1 freq wauners (2) - 1 freq mainners (2) - 20 freq |
banners (0) - 15 freq sanners (2) - 2 freq bankers (2) - 4 freq wanners (2) - 3 freq tanners (2) - 4 freq banner (2) - 19 freq manners (2) - 17 freq bangers (2) - 3 freq fanners (2) - 1 freq burners (3) - 7 freq bennels (3) - 1 freq binner (3) - 2 freq daunners (3) - 1 freq jenners (3) - 6 freq binders (3) - 1 freq benders (3) - 1 freq baunner (3) - 5 freq hunners (3) - 208 freq sinners (3) - 8 freq denners (3) - 11 freq binnert (3) - 1 freq bonnets (3) - 5 freq bunnels (3) - 1 freq bannos (3) - 1 freq rinners (3) - 7 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.193201 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.406769 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.059464 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.037155 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.000875 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. |