| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunnet (0) - 111 freq bunnel (1) - 1 freq bonnet (1) - 34 freq bannet (1) - 1 freq burnet (1) - 2 freq bunnet' (1) - 2 freq punnet (1) - 1 freq dunnet (1) - 1 freq bunnets (1) - 9 freq bunnit (1) - 1 freq wunnet (1) - 1 freq bunnies (2) - 4 freq sonnet (2) - 12 freq dunnett (2) - 6 freq bunnles (2) - 3 freq boannet (2) - 1 freq bunnyel (2) - 1 freq dunnit (2) - 1 freq dunnert (2) - 1 freq funnel (2) - 7 freq unner (2) - 454 freq dunner (2) - 6 freq buttet (2) - 6 freq tunnel (2) - 85 freq buriet (2) - 14 freq |
bunnet (0) - 111 freq bannet (1) - 1 freq bunnit (1) - 1 freq bonnet (1) - 34 freq bunnel (2) - 1 freq bannit (2) - 2 freq boannet (2) - 1 freq bunnets (2) - 9 freq wunnet (2) - 1 freq burnet (2) - 2 freq punnet (2) - 1 freq bunnet' (2) - 2 freq dunnet (2) - 1 freq bennett (3) - 6 freq burnt (3) - 88 freq gannet (3) - 10 freq bunnil (3) - 8 freq banned (3) - 34 freq jennet (3) - 94 freq pinnet (3) - 1 freq basnet (3) - 2 freq hannet (3) - 2 freq bunnle (3) - 8 freq binned (3) - 1 freq dinnet (3) - 1 freq |
SoundEx code - B530 boomed - 8 freq bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 111 freq bandy - 13 freq bend - 102 freq bound - 57 freq beneath - 33 freq band - 159 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq behind - 246 freq beamed - 6 freq bund - 12 freq beyond - 99 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 beyont - 7 freq boned - 2 freq banned - 34 freq bond - 16 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 - 111 freq bandy - 13 freq bend - 102 freq bound - 57 freq band - 159 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 boned - 2 freq banned - 34 freq bond - 16 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 |
BUNNET |
| Time to execute Levenshtein function - 0.200339 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.402875 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.028341 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.037221 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.000861 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. |