| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bannet (0) - 1 freq hannet (1) - 2 freq gannet (1) - 10 freq basnet (1) - 2 freq bunnet (1) - 113 freq bannit (1) - 2 freq boannet (1) - 1 freq bonnet (1) - 34 freq barnet (1) - 3 freq banned (1) - 35 freq banner (1) - 19 freq 'anne (2) - 3 freq barnett (2) - 1 freq cannen (2) - 3 freq baney (2) - 12 freq lannot (2) - 4 freq bane- (2) - 1 freq bunnit (2) - 1 freq punnet (2) - 1 freq kennet (2) - 1 freq hannit (2) - 20 freq linnet (2) - 1 freq banter (2) - 43 freq bannin (2) - 5 freq jennet (2) - 94 freq |
bannet (0) - 1 freq bunnet (1) - 113 freq boannet (1) - 1 freq bannit (1) - 2 freq bonnet (1) - 34 freq banner (2) - 19 freq bunnit (2) - 1 freq banned (2) - 35 freq barnet (2) - 3 freq hannet (2) - 2 freq gannet (2) - 10 freq basnet (2) - 2 freq bandit (3) - 7 freq mannt (3) - 1 freq bunnet' (3) - 2 freq pinnet (3) - 1 freq dinnet (3) - 1 freq dunnet (3) - 1 freq cannot (3) - 19 freq bann (3) - 9 freq binned (3) - 1 freq baunner (3) - 5 freq binner (3) - 2 freq banquet (3) - 7 freq bayonet (3) - 6 freq |
SoundEx code - B530 boomed - 8 freq bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 113 freq bandy - 13 freq bend - 102 freq bound - 58 freq beneath - 35 freq band - 181 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq behind - 261 freq beamed - 6 freq bund - 12 freq beyond - 102 freq bunnet' - 2 freq bammed - 1 freq baund - 21 freq boond - 9 freq bummed - 11 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq binweed - 1 freq bond - 17 freq banned - 35 freq beyont - 7 freq boned - 2 freq behint - 5 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bumed - 1 freq bumt - 1 freq bouned - 3 freq boonty - 1 freq 'behind' - 1 freq bunnit - 1 freq behiynd - 1 freq bayonet - 6 freq bonnieheid - 1 freq beand - 1 freq binwuid - 1 freq 'beyond - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq buoyant - 2 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bmd - 1 freq bnto - 1 freq byamat - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
MetaPhone code - BNT bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 113 freq bandy - 13 freq bend - 102 freq bound - 58 freq band - 181 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq bund - 12 freq bunnet' - 2 freq baund - 21 freq boond - 9 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq bond - 17 freq banned - 35 freq boned - 2 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bouned - 3 freq boonty - 1 freq bunnit - 1 freq beand - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bnto - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
BANNET |
| Time to execute Levenshtein function - 0.198230 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.378151 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.029280 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.039049 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.001168 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. |