| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brurs (0) - 1 freq brur's (1) - 4 freq bruks (1) - 1 freq brur (1) - 23 freq baurs (1) - 21 freq brurr (1) - 1 freq blurs (1) - 1 freq brus (1) - 5 freq brung (2) - 21 freq burls (2) - 5 freq ours (2) - 16 freq caurs (2) - 10 freq furs (2) - 6 freq boure (2) - 1 freq blurt (2) - 1 freq gruws (2) - 2 freq bras (2) - 2 freq bruge (2) - 1 freq hours (2) - 114 freq brous (2) - 5 freq bugs (2) - 21 freq bouns (2) - 1 freq bruin (2) - 1 freq beers (2) - 13 freq braes (2) - 113 freq |
brurs (0) - 1 freq brus (2) - 5 freq briars (2) - 1 freq briers (2) - 2 freq blurs (2) - 1 freq burrs (2) - 2 freq breers (2) - 6 freq baurs (2) - 21 freq brur (2) - 23 freq bruks (2) - 1 freq brurr (2) - 1 freq brur's (2) - 4 freq brogs (3) - 1 freq boru's (3) - 1 freq burds (3) - 98 freq brods (3) - 6 freq errs (3) - 1 freq borras (3) - 1 freq bruces (3) - 13 freq brows (3) - 4 freq bruar (3) - 5 freq brora (3) - 15 freq brigs (3) - 19 freq brutes (3) - 6 freq bears (3) - 32 freq |
SoundEx code - B662 bearers - 4 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 - BRRS bearers - 4 freq brur's - 4 freq brurs - 1 freq briers - 2 freq breers - 6 freq brer's - 1 freq barriers - 6 freq burghers - 2 freq briars - 1 freq |
BRURS |
| Time to execute Levenshtein function - 0.180765 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.352986 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.029972 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.045732 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.000781 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. |