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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bacardi (0) - 8 freq
barcardi (1) - 1 freq
cardi (2) - 2 freq
macari (2) - 1 freq
backwards (3) - 35 freq
hazard (3) - 2 freq
backyard (3) - 1 freq
baird (3) - 30 freq
bakwards (3) - 2 freq
backward (3) - 11 freq
board (3) - 150 freq
bards (3) - 15 freq
baand (3) - 13 freq
bastard' (3) - 1 freq
beardit (3) - 2 freq
byward (3) - 2 freq
naard (3) - 1 freq
beard (3) - 54 freq
cardin (3) - 2 freq
baaed (3) - 1 freq
haard (3) - 17 freq
waard (3) - 2 freq
mardi (3) - 2 freq
racord (3) - 2 freq
baarn (3) - 1 freq
bacardi (0) - 8 freq
barcardi (2) - 1 freq
cardi (3) - 2 freq
cardie (4) - 2 freq
bairdie (4) - 5 freq
bardo (4) - 1 freq
backed (4) - 27 freq
ricardo (4) - 6 freq
baurrd (4) - 1 freq
boarde (4) - 1 freq
cardio (4) - 1 freq
cardy (4) - 1 freq
card (4) - 61 freq
bard (4) - 57 freq
baerd (4) - 4 freq
beardie (4) - 1 freq
racord (4) - 2 freq
beardy (4) - 2 freq
backid (4) - 1 freq
bardie (4) - 1 freq
beard (4) - 54 freq
macari (4) - 1 freq
byward (4) - 2 freq
baird (4) - 30 freq
backyard (4) - 1 freq
SoundEx code - B263
backartywise - 1 freq
bigger-that - 1 freq
backwarts - 3 freq
backward - 11 freq
backarties - 3 freq
backroad - 1 freq
backwards - 35 freq
begrudge - 2 freq
backarts - 10 freq
'backarts' - 1 freq
baukward-luikin - 1 freq
buggered - 13 freq
backyard - 1 freq
bakward - 2 freq
bakwards - 2 freq
backwart - 7 freq
box-cairt - 1 freq
'backwards - 1 freq
begrutten - 6 freq
bacardi - 8 freq
baakwardly - 1 freq
buzzard - 3 freq
buggert - 3 freq
backgairden - 1 freq
beckairts - 1 freq
buzzards - 5 freq
backarty-wise' - 1 freq
backarty-wise - 1 freq
bogart - 1 freq
backerties - 1 freq
bickered - 1 freq
'backwards' - 1 freq
backwirds - 2 freq
bjartalid - 1 freq
'backwarts' - 1 freq
bizzard - 1 freq
bickert - 3 freq
bakwarts - 1 freq
bussard - 1 freq
€˜begrutten - 1 freq
backairts - 1 freq
buggeration - 1 freq
buchart - 1 freq
backward-turnt - 1 freq
begrudged - 1 freq
begrudgin - 1 freq
baegered - 1 freq
backgarden - 1 freq
bbcradioscot - 27 freq
bbcradioulster - 13 freq
bbcradiofoyle - 1 freq
boxertoye - 1 freq
backroadbiking - 1 freq
bbcradio - 5 freq
bbcradiowales - 1 freq
bbcradiodrama - 1 freq
backward- - 1 freq
biggardenbirdwatch - 1 freq
bigredfcassidy - 1 freq
bsgcreativesig - 2 freq
bbcearth - 1 freq
MetaPhone code - BKRT
backroad - 1 freq
buggered - 13 freq
bacardi - 8 freq
buggert - 3 freq
bogart - 1 freq
bickered - 1 freq
bickert - 3 freq
bbcradio - 5 freq
BACARDI
Time to execute Levenshtein function - 0.178019 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.359734 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.028428 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.037225 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.000849 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.