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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bigots (0) - 4 freq
bigot (1) - 4 freq
biggs (2) - 4 freq
fights (2) - 3 freq
digits (2) - 3 freq
biests (2) - 1 freq
bigoted (2) - 2 freq
bigs (2) - 2 freq
bigotet (2) - 2 freq
pilots (2) - 5 freq
bi'ts (2) - 1 freq
nights (2) - 62 freq
gigot (2) - 1 freq
boots (2) - 89 freq
sgots (2) - 1 freq
tights (2) - 15 freq
riots (2) - 3 freq
bisoms (2) - 1 freq
big's (2) - 2 freq
bingos (2) - 1 freq
bitts (2) - 10 freq
lights (2) - 99 freq
begets (2) - 4 freq
divots (2) - 5 freq
bits (2) - 312 freq
bigots (0) - 4 freq
begets (2) - 4 freq
bigot (2) - 4 freq
sgots (3) - 1 freq
bits (3) - 312 freq
big's (3) - 2 freq
birts (3) - 1 freq
begot (3) - 1 freq
bigotry (3) - 7 freq
bots (3) - 4 freq
boots (3) - 89 freq
bitts (3) - 10 freq
bigs (3) - 2 freq
bigoted (3) - 2 freq
biests (3) - 1 freq
biggs (3) - 4 freq
bigotet (3) - 2 freq
digits (3) - 3 freq
bi'ts (3) - 1 freq
bogils (4) - 2 freq
bloats (4) - 1 freq
bants (4) - 5 freq
bagels (4) - 1 freq
gits (4) - 102 freq
bogles (4) - 23 freq
SoundEx code - B232
beasts - 144 freq
baskets - 8 freq
bissett's - 1 freq
buckets - 25 freq
besides - 35 freq
biscuits - 41 freq
'backstage - 1 freq
buchts - 6 freq
busts - 2 freq
beastie's - 3 freq
beasties - 51 freq
baist's - 4 freq
bisides - 1 freq
'beasts - 5 freq
bests - 2 freq
baests - 13 freq
begets - 4 freq
beastis - 1 freq
baisties - 3 freq
beest's - 1 freq
basket's - 1 freq
bestows - 1 freq
beast's - 7 freq
baists - 22 freq
best-sellin - 1 freq
bestkennt - 1 freq
best-kennt - 1 freq
backstage - 5 freq
bestest - 5 freq
boasts - 3 freq
beckwith's - 2 freq
bastes - 4 freq
bust's - 1 freq
bucket's - 1 freq
best-kent - 6 freq
bukkits - 1 freq
biests - 1 freq
beists - 1 freq
baesties - 1 freq
best-seller - 2 freq
bestseller - 1 freq
bouchts - 1 freq
boosts - 1 freq
'biscuits' - 1 freq
besyds - 2 freq
buists - 1 freq
bukkets - 1 freq
best-keepit - 1 freq
bouquets - 1 freq
backsides - 2 freq
€œbesides - 1 freq
€˜besides - 1 freq
basket-swords - 1 freq
bigots - 4 freq
bbcdouglasf - 1 freq
baists' - 1 freq
bbcthesocial - 10 freq
bbcscotcomms - 1 freq
besties - 1 freq
bizquits - 1 freq
bustage - 1 freq
bgstxyfwtn - 1 freq
bigotsureejits - 1 freq
biscuits' - 1 freq
bfkthsjgf - 1 freq
bycatch - 1 freq
bpqtg - 1 freq
bbcsouthscot - 8 freq
bzggedyk - 1 freq
bkotg - 1 freq
bbceducation - 1 freq
bestcanton - 1 freq
bbckitchencafe - 2 freq
bctgb - 1 freq
biscuitsgod - 1 freq
MetaPhone code - BKTS
buckets - 25 freq
bucket's - 1 freq
bukkits - 1 freq
bukkets - 1 freq
bouquets - 1 freq
bigots - 4 freq
BIGOTS
Time to execute Levenshtein function - 0.181317 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.319171 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.030302 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.036492 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.000829 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.