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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bacteria (0) - 4 freq
banterin (2) - 1 freq
batterin (2) - 28 freq
batterit (2) - 1 freq
barterin (2) - 1 freq
bacterium (2) - 1 freq
astoria (3) - 1 freq
tatterie (3) - 1 freq
listeria (3) - 1 freq
baxter's (3) - 6 freq
barberin (3) - 1 freq
criteria (3) - 7 freq
racherie (3) - 1 freq
atterie (3) - 4 freq
yatterin (3) - 4 freq
baters (3) - 2 freq
watterfa (3) - 1 freq
caterin (3) - 4 freq
waterin (3) - 7 freq
santerin (3) - 1 freq
hysteria (3) - 9 freq
blatterin (3) - 5 freq
battery (3) - 25 freq
material (3) - 86 freq
asterix (3) - 1 freq
bacteria (0) - 4 freq
bacterium (3) - 1 freq
batter (4) - 74 freq
factorie (4) - 2 freq
battery (4) - 25 freq
factery (4) - 1 freq
baxter (4) - 16 freq
banter (4) - 43 freq
butterie (4) - 7 freq
victoria (4) - 27 freq
batterit (4) - 1 freq
batterin (4) - 28 freq
banterin (4) - 1 freq
barterin (4) - 1 freq
barter (4) - 3 freq
cetera (5) - 1 freq
picterin (5) - 1 freq
baitur (5) - 4 freq
battert (5) - 9 freq
factory (5) - 112 freq
docter (5) - 15 freq
betterin (5) - 3 freq
bixter (5) - 1 freq
bunter (5) - 8 freq
butterig (5) - 1 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
BACTERIA
Time to execute Levenshtein function - 0.237504 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.558320 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.028021 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.068956 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.000966 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.