| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brewer (0) - 1 freq breer (1) - 11 freq brewery (1) - 6 freq brewed (1) - 6 freq brawer (1) - 9 freq breem (2) - 8 freq reer (2) - 1 freq breet (2) - 35 freq greyer (2) - 1 freq breez (2) - 1 freq brekker (2) - 2 freq breert (2) - 1 freq greer (2) - 6 freq bieber (2) - 1 freq brewÂ’ (2) - 1 freq rawer (2) - 1 freq brews (2) - 3 freq brier (2) - 5 freq brewster (2) - 3 freq bremmer (2) - 1 freq beer (2) - 142 freq brew (2) - 31 freq crewe (2) - 2 freq drawer (2) - 132 freq bree (2) - 58 freq |
brewer (0) - 1 freq brewery (1) - 6 freq brawer (1) - 9 freq breer (2) - 11 freq brewed (2) - 6 freq brawery (2) - 1 freq brewis (3) - 1 freq grower (3) - 2 freq drawer (3) - 132 freq browser (3) - 4 freq braer (3) - 1 freq brewin (3) - 8 freq brer (3) - 2 freq blower (3) - 2 freq bower (3) - 10 freq rower (3) - 2 freq brew (3) - 31 freq breaker (3) - 4 freq breezer (3) - 5 freq broker (3) - 1 freq braver (3) - 4 freq brews (3) - 3 freq brier (3) - 5 freq rawer (3) - 1 freq breevery (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 |
BREWER |
| Time to execute Levenshtein function - 0.191498 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.381916 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.030123 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.037747 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.000877 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. |