| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| breweries (0) - 2 freq brewer's (2) - 1 freq breeties (2) - 1 freq brewery's (2) - 1 freq reveries (2) - 2 freq sweeries (3) - 1 freq beeried (3) - 14 freq bewties (3) - 1 freq batteries (3) - 8 freq breers (3) - 6 freq preterites (3) - 2 freq breeches (3) - 1 freq bravelies (3) - 2 freq breenges (3) - 10 freq peeries (3) - 2 freq freebies (3) - 1 freq leeries (3) - 6 freq arteries (3) - 5 freq remedies (3) - 4 freq reverie (3) - 2 freq groceries (3) - 2 freq beerie (3) - 7 freq butteries (3) - 23 freq reerie (3) - 4 freq beeriet (3) - 26 freq |
breweries (0) - 2 freq brewer's (3) - 1 freq brewery's (3) - 1 freq berries (4) - 26 freq breers (4) - 6 freq brewis (4) - 1 freq brewer (4) - 1 freq breeties (4) - 1 freq brownies (4) - 9 freq reveries (4) - 2 freq brewery (4) - 6 freq bowers (5) - 1 freq rowers (5) - 3 freq referees (5) - 2 freq brawery (5) - 1 freq blowers (5) - 1 freq breezers (5) - 1 freq brawnis (5) - 1 freq growers (5) - 1 freq barries (5) - 1 freq drawers (5) - 52 freq breakers (5) - 2 freq breezes (5) - 2 freq brew's (5) - 1 freq bursaries (5) - 1 freq |
SoundEx code - B662 bearers - 5 freq brur's - 4 freq brurs - 1 freq briers - 2 freq breers - 6 freq brer's - 1 freq barriers - 6 freq brewer's - 1 freq byrewark - 1 freq brairgin - 1 freq brewery's - 1 freq briars - 1 freq bare-arsed - 1 freq breweries - 2 freq |
MetaPhone code - BRWRS brewer's - 1 freq brewery's - 1 freq breweries - 2 freq |
BREWERIES |
| Time to execute Levenshtein function - 0.243536 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.406728 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.029763 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.040057 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.000949 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. |