| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bremmer (0) - 1 freq bremner (1) - 3 freq brammer (1) - 7 freq grimmer (2) - 1 freq gemmer (2) - 1 freq brewer (2) - 1 freq dremmed (2) - 1 freq bummer (2) - 21 freq breaker (2) - 4 freq brimmed (2) - 4 freq premier (2) - 7 freq gremmar (2) - 52 freq drummer (2) - 11 freq bremen (2) - 1 freq memmer (2) - 35 freq hemmer (2) - 21 freq brammed (2) - 1 freq breezer (2) - 5 freq breer (2) - 11 freq grammer (2) - 3 freq dreamer (2) - 2 freq brekker (2) - 2 freq breme (2) - 1 freq beamer (2) - 12 freq bremners (2) - 1 freq |
bremmer (0) - 1 freq brammer (1) - 7 freq bremner (2) - 3 freq gremmar (3) - 52 freq brimmed (3) - 4 freq brammed (3) - 1 freq grammer (3) - 3 freq drummer (3) - 11 freq bummer (3) - 21 freq grimmer (3) - 1 freq trimmer (3) - 1 freq brammle (4) - 2 freq braemar (4) - 27 freq beemer (4) - 2 freq brummle (4) - 1 freq brummil (4) - 2 freq brimman (4) - 1 freq brimmin (4) - 13 freq brummie (4) - 1 freq beamer (4) - 12 freq grammar (4) - 132 freq brammin (4) - 1 freq bremners (4) - 1 freq bremen (4) - 1 freq memmer (4) - 35 freq |
SoundEx code - B656 barnhourie - 1 freq byornar - 13 freq braemar - 27 freq bernard's - 2 freq burners - 7 freq burners' - 1 freq brainer - 1 freq barnardo's - 1 freq brammer - 7 freq bairn-rhyme - 2 freq burner - 3 freq brannèrt - 1 freq bernard - 5 freq bairn-reft - 1 freq bairn-rhymes - 4 freq burner-o-cuddies - 1 freq bairn-rape - 1 freq berneyardis - 1 freq bremner's - 1 freq bremner - 3 freq broony-red - 1 freq broony-reid - 1 freq brianmoore - 1 freq brooners - 1 freq braemargathering - 1 freq brianr - 3 freq bremmer - 1 freq bremners - 1 freq bairnrhymes - 10 freq bernards - 1 freq brianwr - 1 freq bernardjmolloy - 1 freq |
MetaPhone code - BRMR braemar - 27 freq brammer - 7 freq bremmer - 1 freq |
BREMMER |
| Time to execute Levenshtein function - 0.347426 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.762923 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.032145 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.078696 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.001292 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. |