Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
boarder (0) - 5 freq boarded (1) - 5 freq border (1) - 145 freq boarde (1) - 1 freq oarder (1) - 5 freq boarden (1) - 1 freq boardir (1) - 1 freq hoarder (1) - 2 freq boarders (1) - 1 freq warder (2) - 3 freq noardert (2) - 1 freq badder (2) - 5 freq yarder (2) - 1 freq broader (2) - 1 freq boolder (2) - 1 freq bardet (2) - 1 freq hoarders (2) - 1 freq borders (2) - 80 freq bolder (2) - 2 freq oardert (2) - 3 freq boather (2) - 5 freq boards (2) - 23 freq forder (2) - 97 freq farder (2) - 31 freq oarders (2) - 2 freq |
boarder (0) - 5 freq boardir (1) - 1 freq border (1) - 145 freq braider (2) - 64 freq broader (2) - 1 freq boarders (2) - 1 freq boarded (2) - 5 freq hoarder (2) - 2 freq boarde (2) - 1 freq boarden (2) - 1 freq oarder (2) - 5 freq faarder (3) - 1 freq boardin (3) - 9 freq bearded (3) - 8 freq board (3) - 151 freq larder (3) - 9 freq barker (3) - 1 freq harder (3) - 67 freq boulder (3) - 9 freq barter (3) - 3 freq barber (3) - 7 freq nearder (3) - 1 freq bordour (3) - 1 freq bowder (3) - 1 freq order (3) - 277 freq |
SoundEx code - B636 brothers - 44 freq brither - 345 freq brithers - 182 freq boarder - 5 freq brither's - 33 freq bourtree - 3 freq birthricht - 4 freq borderline - 4 freq brither' - 2 freq brother's - 10 freq border - 145 freq braider - 64 freq 'britherton - 1 freq britherton - 1 freq britherhood - 4 freq breather - 5 freq borders - 80 freq barter - 3 freq brither-in-law - 6 freq brithers' - 4 freq brodir - 10 freq brother - 285 freq borderlands - 2 freq border's - 1 freq brither-meinisters - 1 freq boortries - 1 freq bordhers - 1 freq brotherhood - 1 freq britart - 1 freq brethern - 3 freq brithir - 2 freq brethren - 1 freq britherly - 1 freq brooders - 1 freq boardrooms - 1 freq 'border' - 1 freq boortree - 1 freq bridder's - 4 freq bridders - 19 freq bridder - 26 freq borderin - 2 freq boortrees - 7 freq browdert - 1 freq 'brither' - 1 freq bridderly - 1 freq boardir - 1 freq bordour - 1 freq broderit - 1 freq bordernet - 1 freq brither'll - 1 freq borderers - 4 freq byordar - 1 freq britherhuid - 1 freq broader - 1 freq barratrie - 1 freq bertrand - 2 freq birthrate - 1 freq byordhar - 1 freq birthers - 1 freq birther - 2 freq barterin - 1 freq braid-reengin - 1 freq brithers-in-airms - 1 freq bardrie - 1 freq boarders - 1 freq boardroom - 2 freq bruther - 1 freq €œborder - 1 freq byorduar - 1 freq britherheid - 1 freq brotherstone - 1 freq boarderline - 2 freq breether - 6 freq beyertorsten - 1 freq brithorrorrev - 1 freq borderderby - 1 freq borderrefs - 1 freq bordersheritage - 1 freq borderscouk - 1 freq britawards - 1 freq bradrossmagic - 1 freq borderpiper - 2 freq borderirish - 3 freq bertwright - 2 freq brother-from-another-mother - 1 freq 'brither - 1 freq bairdric - 3 freq bruthers - 1 freq broderick - 1 freq birders - 2 freq birderkettle - 1 freq birderlouis - 1 freq bordercolliefc - 1 freq |
MetaPhone code - BRTR boarder - 5 freq bourtree - 3 freq border - 145 freq braider - 64 freq barter - 3 freq brodir - 10 freq brighter - 6 freq 'border' - 1 freq boortree - 1 freq bridder - 26 freq boardir - 1 freq bordour - 1 freq broader - 1 freq barratrie - 1 freq bardrie - 1 freq €œborder - 1 freq |
BOARDER |
Time to execute Levenshtein function - 0.354988 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.739992 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.039624 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.087919 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.001296 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. |