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 bigder in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bigder (0) - 7 freq
bidder (1) - 1 freq
bigger (1) - 237 freq
binder (1) - 23 freq
rider (2) - 10 freq
digger (2) - 12 freq
bolder (2) - 2 freq
bigger' (2) - 1 freq
rinder (2) - 1 freq
bidet (2) - 1 freq
bides (2) - 230 freq
bunder (2) - 1 freq
finder (2) - 5 freq
binner (2) - 2 freq
kidder (2) - 4 freq
blinder (2) - 3 freq
birden (2) - 1 freq
bridder (2) - 26 freq
bither (2) - 12 freq
builder (2) - 14 freq
birker (2) - 1 freq
biler (2) - 8 freq
girder (2) - 2 freq
tinder (2) - 8 freq
biter (2) - 1 freq
bigder (0) - 7 freq
bigger (2) - 237 freq
binder (2) - 23 freq
bidder (2) - 1 freq
builder (3) - 14 freq
bender (3) - 5 freq
beigger (3) - 1 freq
biggar (3) - 7 freq
balder (3) - 1 freq
border (3) - 145 freq
bulder (3) - 4 freq
badder (3) - 5 freq
bowder (3) - 1 freq
bugger (3) - 150 freq
bolder (3) - 2 freq
bunder (3) - 1 freq
budder (3) - 47 freq
eilder (4) - 1 freq
rigger (4) - 2 freq
higher (4) - 79 freq
ridder (4) - 2 freq
bidden (4) - 36 freq
widder (4) - 4 freq
eider (4) - 3 freq
kinder (4) - 5 freq
SoundEx code - B236
besturt - 1 freq
bastarn - 16 freq
bastart - 67 freq
bastard - 102 freq
basturt - 17 freq
backdrop - 3 freq
bastardin - 3 freq
basturts - 4 freq
bastert - 9 freq
bastards - 33 freq
'bastard - 1 freq
bastard' - 1 freq
bastart's - 3 freq
'bastart - 1 freq
bowster - 12 freq
baxter - 16 freq
booster - 3 freq
back-treckit - 1 freq
bastarts - 24 freq
boisterous - 3 freq
backstroke - 2 freq
bigotry - 9 freq
backstreets - 1 freq
bastard's - 1 freq
bestirs - 2 freq
bus-drivers - 2 freq
basturds - 1 freq
basturd - 2 freq
bacteria - 4 freq
backdoor - 2 freq
boys-a-dear - 1 freq
bestrides - 1 freq
'bastart' - 1 freq
'backstairs - 1 freq
buster - 2 freq
back-door - 2 freq
beukstores - 2 freq
bestrewed - 1 freq
baxters - 4 freq
baxter's - 6 freq
back-stair - 1 freq
backthrawn - 1 freq
box-trap - 2 freq
bistro - 1 freq
bowsters - 2 freq
bowsterous - 2 freq
bastirt - 1 freq
bastirts - 1 freq
backwater - 1 freq
bousterous - 1 freq
bouster - 1 freq
backdoors - 1 freq
busters - 1 freq
bestiary - 1 freq
bacterium - 1 freq
backstreet - 1 freq
€˜bastardised - 1 freq
biscuit-ersed - 1 freq
€˜bastart - 1 freq
backdrap - 1 freq
back-sitter - 1 freq
backdraps - 2 freq
€œbastart - 1 freq
bastardisation - 1 freq
bastern - 2 freq
back-draw - 1 freq
backtracked - 1 freq
bowsterously - 1 freq
bixter - 1 freq
backwatter - 1 freq
bbcthearchers - 1 freq
boysadear - 1 freq
bocktherobber - 1 freq
bastardization - 1 freq
bbcweather - 3 freq
bbcwthrwatchers - 1 freq
backdoorboris - 1 freq
bastard” - 1 freq
bacteriologist - 1 freq
bbctravelscot - 1 freq
bigder - 7 freq
MetaPhone code - BKTR
bigotry - 9 freq
bacteria - 4 freq
backdoor - 2 freq
back-door - 2 freq
back-draw - 1 freq
bigder - 7 freq
BIGDER
Time to execute Levenshtein function - 0.237184 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.435263 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.028040 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.036971 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.000880 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.