Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
borderrefs (0) - 1 freq borderers (2) - 4 freq borders (3) - 79 freq bordernet (3) - 1 freq border's (3) - 1 freq borderderby (4) - 1 freq forbearers (4) - 1 freq birders (4) - 2 freq berserkers (4) - 1 freq forderer (4) - 2 freq forderins (4) - 3 freq boarders (4) - 1 freq wordpress (4) - 3 freq borderin (4) - 2 freq fordered (4) - 22 freq ordered (4) - 64 freq borderlands (4) - 2 freq orders (4) - 48 freq borderline (4) - 4 freq bordome's (4) - 1 freq murderers (4) - 7 freq borderirish (4) - 3 freq bordhers (4) - 1 freq forders (4) - 8 freq parterres (4) - 1 freq |
borderrefs (0) - 1 freq borderers (3) - 4 freq borders (5) - 79 freq border's (5) - 1 freq murderers (6) - 7 freq bordhers (6) - 1 freq boarders (6) - 1 freq borderirish (6) - 3 freq bordernet (6) - 1 freq birders (6) - 2 freq borderderby (7) - 1 freq border (7) - 145 freq berserkers (7) - 1 freq birderlouis (7) - 1 freq forders (7) - 8 freq boardrooms (7) - 1 freq beardmore's (7) - 1 freq barriers (7) - 6 freq brooders (7) - 1 freq forbearers (7) - 1 freq parterres (7) - 1 freq wordpress (7) - 3 freq murderer's (7) - 3 freq forderins (7) - 3 freq forderer (7) - 2 freq |
SoundEx code - B636 brothers - 44 freq brither - 344 freq brithers - 180 freq boarder - 5 freq brither's - 32 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 - 79 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 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 - BRTRFS borderrefs - 1 freq |
BORDERREFS |
Time to execute Levenshtein function - 0.195049 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.379611 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.027600 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.037399 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.000845 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. |