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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bastard (0) - 102 freq
bastards (1) - 33 freq
bastard' (1) - 1 freq
bastart (1) - 67 freq
basturd (1) - 2 freq
'bastard (1) - 1 freq
bastarn (1) - 16 freq
basturt (2) - 16 freq
bussard (2) - 1 freq
basturds (2) - 1 freq
bastarts (2) - 24 freq
bastard's (2) - 1 freq
'bastart (2) - 1 freq
bastern (2) - 2 freq
easterd (2) - 1 freq
bakward (2) - 2 freq
astarn (2) - 1 freq
eastward (2) - 2 freq
bastard” (2) - 1 freq
bastert (2) - 9 freq
custard (2) - 15 freq
mustard (2) - 18 freq
bastardin (2) - 3 freq
bastirt (2) - 1 freq
wastird (2) - 4 freq
bastard (0) - 102 freq
basturd (1) - 2 freq
'bastard (2) - 1 freq
bastarn (2) - 16 freq
bastards (2) - 33 freq
bastard' (2) - 1 freq
bastart (2) - 67 freq
mustard (3) - 18 freq
custard (3) - 15 freq
bastardin (3) - 3 freq
wastird (3) - 4 freq
bastert (3) - 9 freq
bastirt (3) - 1 freq
easterd (3) - 1 freq
basturds (3) - 1 freq
bastern (3) - 2 freq
bussard (3) - 1 freq
basturt (3) - 16 freq
bestiary (4) - 1 freq
battered (4) - 35 freq
boasted (4) - 1 freq
bestirs (4) - 2 freq
stared (4) - 69 freq
bistro (4) - 1 freq
bantered (4) - 1 freq
SoundEx code - B236
besturt - 1 freq
bastarn - 16 freq
bastart - 67 freq
bastard - 102 freq
basturt - 16 freq
backdrop - 1 freq
bastardin - 3 freq
basturts - 3 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
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
bigotry - 7 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 - BSTRT
besturt - 1 freq
bastart - 67 freq
bastard - 102 freq
basturt - 16 freq
bastert - 9 freq
'bastard - 1 freq
bastard' - 1 freq
'bastart - 1 freq
basturd - 2 freq
'bastart' - 1 freq
bastirt - 1 freq
€˜bastart - 1 freq
€œbastart - 1 freq
bastard” - 1 freq
BASTARD
Time to execute Levenshtein function - 0.344400 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.458374 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.027475 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.038490 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.000791 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.