| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baunner (0) - 5 freq bainner (1) - 2 freq daunner (1) - 12 freq blunner (1) - 1 freq banner (1) - 19 freq 'hunner (2) - 2 freq bauer (2) - 1 freq brunnen (2) - 1 freq waunnert (2) - 6 freq bunnet (2) - 113 freq mainner (2) - 46 freq ganner (2) - 1 freq bunder (2) - 1 freq dauncer (2) - 11 freq dunner (2) - 6 freq gunner (2) - 2 freq banned (2) - 35 freq bunter (2) - 8 freq waunners (2) - 2 freq wauner (2) - 2 freq banter (2) - 43 freq daunners (2) - 1 freq daenner (2) - 1 freq bannet (2) - 1 freq daunder (2) - 40 freq |
baunner (0) - 5 freq bainner (1) - 2 freq banner (1) - 19 freq binner (2) - 2 freq blunner (2) - 1 freq daunner (2) - 12 freq dainner (3) - 3 freq runner (3) - 19 freq banger (3) - 5 freq funner (3) - 1 freq bonnier (3) - 24 freq banners (3) - 15 freq hunner (3) - 442 freq danner (3) - 13 freq bouncer (3) - 24 freq inunner (3) - 1 freq unner (3) - 461 freq manner (3) - 19 freq aonner (3) - 1 freq bunker (3) - 23 freq wunner (3) - 282 freq tanner (3) - 10 freq wanner (3) - 18 freq banker (3) - 12 freq ahunner (3) - 1 freq |
SoundEx code - B560 bonnier - 24 freq bummer - 21 freq binner - 2 freq bane-weary - 2 freq banner - 19 freq bainner - 2 freq beamer - 12 freq boomer - 1 freq binary - 4 freq bawmurrie - 1 freq bummerie - 1 freq bynear - 2 freq beemer - 2 freq baunner - 5 freq bmr - 1 freq |
MetaPhone code - BNR bonnier - 24 freq binner - 2 freq banner - 19 freq bainner - 2 freq binary - 4 freq bynear - 2 freq baunner - 5 freq |
BAUNNER |
| Time to execute Levenshtein function - 0.240844 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.457301 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.033737 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.042170 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.000891 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. |