| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brewery (0) - 6 freq brawery (1) - 1 freq brewer (1) - 1 freq breezy (2) - 3 freq breemy (2) - 1 freq beery (2) - 8 freq bribery (2) - 6 freq breer (2) - 11 freq brewed (2) - 6 freq bravery (2) - 6 freq brawer (2) - 9 freq breert (2) - 1 freq breevery (2) - 1 freq brewer's (2) - 1 freq breers (2) - 6 freq bleery (2) - 1 freq brewery's (2) - 1 freq rowers (3) - 3 freq breviary (3) - 1 freq seery (3) - 2 freq flowery (3) - 2 freq breeks (3) - 145 freq breems (3) - 1 freq brendy (3) - 1 freq drawer (3) - 131 freq |
brewery (0) - 6 freq brawery (1) - 1 freq brewer (1) - 1 freq brawer (2) - 9 freq brewed (3) - 6 freq breer (3) - 11 freq breevery (3) - 1 freq bravery (3) - 6 freq bribery (3) - 6 freq brer (4) - 2 freq brawly (4) - 36 freq brawday (4) - 9 freq bower (4) - 10 freq breezer (4) - 5 freq berry (4) - 17 freq brewis (4) - 1 freq byrewark (4) - 1 freq breaker (4) - 4 freq browser (4) - 4 freq blower (4) - 2 freq breweries (4) - 2 freq brews (4) - 3 freq rewire (4) - 2 freq brew (4) - 30 freq broker (4) - 1 freq |
SoundEx code - B660 beirer - 1 freq brawer - 9 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq brewery - 6 freq brawery - 1 freq bruar - 5 freq braar - 1 freq brewer - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
MetaPhone code - BRWR brawer - 9 freq brewery - 6 freq brawery - 1 freq brewer - 1 freq |
BREWERY |
| Time to execute Levenshtein function - 0.236572 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.610400 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.064697 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.043611 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.000771 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. |