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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bakwards (0) - 2 freq
bakwarts (1) - 1 freq
bakward (1) - 2 freq
backwards (1) - 35 freq
backward (2) - 11 freq
awards (2) - 35 freq
backwarts (2) - 3 freq
tawards (2) - 7 freq
taewards (2) - 183 freq
atwards (2) - 3 freq
bastards (2) - 33 freq
akward (2) - 3 freq
'backwards (2) - 1 freq
backward- (2) - 1 freq
aakward (2) - 6 freq
backwirds (2) - 2 freq
tacwards (2) - 1 freq
bollards (3) - 2 freq
awairds (3) - 3 freq
cowards (3) - 5 freq
halyards (3) - 1 freq
mallards (3) - 2 freq
baker's (3) - 14 freq
wards (3) - 30 freq
ackward (3) - 3 freq
bakwards (0) - 2 freq
backwards (2) - 35 freq
bakwarts (2) - 1 freq
bakward (2) - 2 freq
backwirds (3) - 2 freq
tacwards (4) - 1 freq
backward- (4) - 1 freq
backward (4) - 11 freq
awards (4) - 35 freq
skywards (4) - 2 freq
baakwardly (4) - 1 freq
'backwards (4) - 1 freq
aakward (4) - 6 freq
akward (4) - 3 freq
tawards (4) - 7 freq
backwarts (4) - 3 freq
atwards (4) - 3 freq
taewards (4) - 183 freq
bastards (4) - 33 freq
eastwards (5) - 3 freq
forwards (5) - 5 freq
bakers (5) - 23 freq
blakbirds (5) - 1 freq
bernards (5) - 1 freq
blewarts (5) - 2 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 - BKWRTS
backwarts - 3 freq
backwards - 35 freq
bakwards - 2 freq
'backwards - 1 freq
'backwards' - 1 freq
backwirds - 2 freq
'backwarts' - 1 freq
bakwarts - 1 freq
BAKWARDS
Time to execute Levenshtein function - 0.224868 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.417290 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.030610 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.038396 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.000809 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.