A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to brooders in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
brooders (0) - 1 freq
broader (2) - 1 freq
troopers (2) - 45 freq
crooners (2) - 2 freq
shooders (2) - 133 freq
trookers (2) - 2 freq
brookes (2) - 1 freq
browdert (2) - 1 freq
boolers (2) - 1 freq
broods (2) - 1 freq
borders (2) - 80 freq
roonders (2) - 2 freq
bloopers (2) - 1 freq
bloomers (2) - 5 freq
brousers (2) - 1 freq
pooders (2) - 3 freq
boozers (2) - 4 freq
brooke's (2) - 1 freq
bridders (2) - 19 freq
blooters (2) - 3 freq
bronzers (2) - 1 freq
boomers (2) - 1 freq
brothers (2) - 44 freq
roodery (2) - 1 freq
boolders (2) - 8 freq
brooders (0) - 1 freq
borders (2) - 80 freq
brousers (3) - 1 freq
boarders (3) - 1 freq
brokers (3) - 2 freq
birders (3) - 2 freq
broods (3) - 1 freq
boolders (3) - 8 freq
bridders (3) - 19 freq
broader (3) - 1 freq
breers (4) - 6 freq
broderit (4) - 1 freq
braidens (4) - 2 freq
ryders (4) - 1 freq
breezers (4) - 1 freq
benders (4) - 1 freq
brodir (4) - 10 freq
boulders (4) - 14 freq
binders (4) - 1 freq
bulders (4) - 1 freq
border's (4) - 1 freq
brydens (4) - 4 freq
builders (4) - 10 freq
briers (4) - 2 freq
bride's (4) - 5 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 - BRTRS
borders - 80 freq
border's - 1 freq
boortries - 1 freq
brooders - 1 freq
bridder's - 4 freq
bridders - 19 freq
boortrees - 7 freq
boarders - 1 freq
birders - 2 freq
BROODERS
Time to execute Levenshtein function - 0.199432 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.393667 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.027787 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.037621 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.000981 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.