| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brairgin (0) - 1 freq bairgin (1) - 1 freq breirdin (2) - 3 freq tairgin (2) - 1 freq breingin (2) - 11 freq braithin (2) - 5 freq briggin (2) - 4 freq rairin (2) - 22 freq chairgin (2) - 21 freq brairdit (2) - 3 freq braggin (2) - 5 freq bairnin (2) - 2 freq bairgie (2) - 1 freq brainin (2) - 1 freq bargin (2) - 2 freq bringin (2) - 114 freq draigin (2) - 3 freq braidin (2) - 2 freq 'rairin (2) - 1 freq raign (3) - 3 freq baggin (3) - 2 freq shairin (3) - 2 freq brastlin (3) - 1 freq bruisin (3) - 6 freq blarin (3) - 13 freq |
brairgin (0) - 1 freq bairgin (2) - 1 freq braggin (3) - 5 freq bargin (3) - 2 freq briggin (3) - 4 freq bringin (3) - 114 freq breirdin (3) - 3 freq breingin (3) - 11 freq breengin (4) - 35 freq birrin (4) - 4 freq braithin (4) - 5 freq barrin (4) - 7 freq bargyin (4) - 1 freq bargain (4) - 33 freq braidin (4) - 2 freq bringan (4) - 3 freq 'rairin (4) - 1 freq bairnin (4) - 2 freq bairgie (4) - 1 freq brairdit (4) - 3 freq chairgin (4) - 21 freq rairin (4) - 22 freq draigin (4) - 3 freq brainin (4) - 1 freq tairgin (4) - 1 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 - BRRJN brairgin - 1 freq |
BRAIRGIN |
| Time to execute Levenshtein function - 0.187472 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.373782 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.028265 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.042165 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.000834 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. |