| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brammer (0) - 7 freq bremmer (1) - 1 freq grammer (1) - 3 freq brammed (1) - 1 freq bamber (2) - 2 freq brammin (2) - 1 freq bremner (2) - 3 freq brimmed (2) - 4 freq hammer (2) - 44 freq brammles (2) - 10 freq yammer (2) - 5 freq braer (2) - 1 freq rammel (2) - 1 freq drummer (2) - 11 freq grammar (2) - 132 freq grimmer (2) - 1 freq dramer (2) - 2 freq prammed (2) - 3 freq brainer (2) - 1 freq slammer (2) - 1 freq bammed (2) - 1 freq stammer (2) - 1 freq beamer (2) - 12 freq balmer (2) - 2 freq brawer (2) - 9 freq |
brammer (0) - 7 freq bremmer (1) - 1 freq brammed (2) - 1 freq grammer (2) - 3 freq braemar (3) - 27 freq grimmer (3) - 1 freq brammle (3) - 2 freq grammar (3) - 132 freq bummer (3) - 21 freq trimmer (3) - 1 freq drummer (3) - 11 freq brammin (3) - 1 freq bremner (3) - 3 freq brimmed (3) - 4 freq braider (4) - 64 freq lammer (4) - 2 freq brimmin (4) - 13 freq brazier (4) - 5 freq rammed (4) - 9 freq braver (4) - 4 freq brander (4) - 2 freq gremmar (4) - 52 freq brummie (4) - 1 freq brummle (4) - 1 freq brimman (4) - 1 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 |
BRAMMER |
| Time to execute Levenshtein function - 0.292762 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.433132 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.028338 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.039475 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.000900 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. |