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 sonsie

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

Similar words to busters in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
busters (0) - 1 freq
buster (1) - 2 freq
buskers (1) - 2 freq
dusters (1) - 3 freq
misters (2) - 1 freq
bust's (2) - 1 freq
fuskers (2) - 21 freq
busker (2) - 2 freq
mutters (2) - 12 freq
sisters (2) - 130 freq
bastert (2) - 9 freq
busens (2) - 1 freq
jesters (2) - 2 freq
quaters (2) - 1 freq
buttert (2) - 7 freq
butes (2) - 2 freq
pousters (2) - 1 freq
mustert (2) - 1 freq
blisters (2) - 9 freq
batters (2) - 8 freq
boskers (2) - 2 freq
bastern (2) - 2 freq
oysters (2) - 2 freq
dunters (2) - 6 freq
fushers (2) - 1 freq
busters (0) - 1 freq
bestirs (2) - 2 freq
dusters (2) - 3 freq
buster (2) - 2 freq
buskers (2) - 2 freq
baiters (3) - 2 freq
posters (3) - 30 freq
wasters (3) - 6 freq
ulsters (3) - 1 freq
eysters (3) - 8 freq
bowsters (3) - 2 freq
baxters (3) - 4 freq
festers (3) - 1 freq
beaters (3) - 2 freq
systers (3) - 1 freq
tasters (3) - 1 freq
gousters (3) - 3 freq
blousters (3) - 1 freq
abusers (3) - 1 freq
disters (3) - 1 freq
busts (3) - 2 freq
bouster (3) - 1 freq
mesters (3) - 1 freq
betters (3) - 6 freq
masters (3) - 10 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 - BSTRS
boisterous - 3 freq
bestirs - 2 freq
bowsters - 2 freq
bowsterous - 2 freq
bousterous - 1 freq
busters - 1 freq
BUSTERS
Time to execute Levenshtein function - 0.244680 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.418897 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.028152 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.042602 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.001249 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.