| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| breer (0) - 11 freq breers (1) - 6 freq breek (1) - 3 freq breez (1) - 1 freq brier (1) - 5 freq breet (1) - 35 freq breed (1) - 58 freq braer (1) - 1 freq greer (1) - 6 freq freer (1) - 2 freq breert (1) - 1 freq breem (1) - 8 freq beer (1) - 142 freq bree (1) - 58 freq brewer (1) - 1 freq reer (1) - 1 freq brer (1) - 2 freq breezer (2) - 5 freq reet (2) - 8 freq bleers (2) - 1 freq border (2) - 145 freq abreed (2) - 5 freq beeger (2) - 6 freq brens (2) - 1 freq beep (2) - 11 freq |
breer (0) - 11 freq brier (1) - 5 freq braer (1) - 1 freq brer (1) - 2 freq bruar (2) - 5 freq braar (2) - 1 freq reer (2) - 1 freq brur (2) - 23 freq berr (2) - 2 freq brr (2) - 5 freq bree (2) - 58 freq briar (2) - 1 freq brewer (2) - 1 freq breers (2) - 6 freq beer (2) - 142 freq breet (2) - 35 freq breez (2) - 1 freq breek (2) - 3 freq breed (2) - 58 freq greer (2) - 6 freq breem (2) - 8 freq breert (2) - 1 freq freer (2) - 2 freq reir (3) - 1 freq briers (3) - 2 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 - BRR beirer - 1 freq brur - 23 freq breer - 11 freq brier - 5 freq bearer - 7 freq barrier - 13 freq brer - 2 freq bruar - 5 freq braar - 1 freq briar - 1 freq €œbriar - 1 freq brurr - 1 freq braer - 1 freq brora - 15 freq |
BREER |
| Time to execute Levenshtein function - 0.256239 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.374897 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.032136 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.037679 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.000870 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. |