| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barriers (0) - 6 freq harriers (1) - 2 freq carriers (1) - 2 freq barries (1) - 1 freq barrier (1) - 13 freq ferriers (2) - 1 freq carrie's (2) - 1 freq farrier (2) - 2 freq warriors (2) - 20 freq berries (2) - 25 freq barrels (2) - 18 freq barbies (2) - 3 freq earrier (2) - 1 freq carries (2) - 10 freq barrens (2) - 1 freq barrie (2) - 15 freq barraes (2) - 6 freq larries (2) - 8 freq carrier (2) - 15 freq barbers (2) - 3 freq terriers (2) - 1 freq yarries (2) - 1 freq cairriers (2) - 1 freq harrier (2) - 2 freq briers (2) - 2 freq |
barriers (0) - 6 freq barries (2) - 1 freq barrier (2) - 13 freq harriers (2) - 2 freq carriers (2) - 2 freq barraes (3) - 6 freq briers (3) - 2 freq barbers (3) - 3 freq barrens (3) - 1 freq terriers (3) - 1 freq barrels (3) - 18 freq warriors (3) - 20 freq ferriers (3) - 1 freq cairriers (3) - 1 freq berries (3) - 25 freq barr's (4) - 2 freq boarders (4) - 1 freq burners (4) - 7 freq birders (4) - 2 freq burgers (4) - 11 freq bruisers (4) - 1 freq barronis (4) - 1 freq brokers (4) - 2 freq warriours (4) - 2 freq bearers (4) - 4 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 |
BARRIERS |
| Time to execute Levenshtein function - 0.217957 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.379369 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.027623 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.039208 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.000863 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. |