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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
blinds (0) - 16 freq
blindt (1) - 1 freq
blinks (1) - 14 freq
blinns (1) - 1 freq
binds (1) - 7 freq
blind (1) - 41 freq
bairds (2) - 3 freq
blink' (2) - 1 freq
clints (2) - 3 freq
baends (2) - 1 freq
binns (2) - 2 freq
beilds (2) - 1 freq
bines (2) - 1 freq
brings (2) - 116 freq
beings (2) - 4 freq
linns (2) - 5 freq
bliind (2) - 2 freq
bends (2) - 13 freq
bleeds (2) - 6 freq
bins (2) - 34 freq
blond (2) - 20 freq
blink (2) - 91 freq
buirds (2) - 10 freq
lines (2) - 222 freq
blid (2) - 9 freq
blinds (0) - 16 freq
blind (2) - 41 freq
blindt (2) - 1 freq
binds (2) - 7 freq
blondes (2) - 2 freq
blinks (2) - 14 freq
blinns (2) - 1 freq
boonds (3) - 7 freq
bleds (3) - 1 freq
blenks (3) - 1 freq
bands (3) - 41 freq
blinded (3) - 4 freq
lends (3) - 9 freq
behinds (3) - 1 freq
blund (3) - 1 freq
blonde (3) - 42 freq
blinders (3) - 2 freq
blads (3) - 9 freq
bounds (3) - 11 freq
blinder (3) - 3 freq
bloods (3) - 5 freq
blens (3) - 1 freq
blanks (3) - 3 freq
brands (3) - 7 freq
lands (3) - 59 freq
SoundEx code - B453
blondie - 9 freq
bluimed - 3 freq
blindit - 8 freq
blendin - 3 freq
blinds - 16 freq
blonde - 42 freq
blunt - 9 freq
blindin - 11 freq
bluntie - 2 freq
blondie's - 1 freq
blindin-bricht - 2 freq
blumed - 4 freq
blint - 3 freq
blund - 1 freq
blinders - 2 freq
blandness - 2 freq
blondin - 1 freq
blin-drift - 1 freq
blinnt - 1 freq
bool-in-the-mooth - 2 freq
bluntly - 3 freq
blemt - 2 freq
blind - 41 freq
blindfold - 2 freq
blent - 6 freq
blamed - 12 freq
blindly - 1 freq
blindrift - 1 freq
blond - 20 freq
bellindesert - 1 freq
bellinderry - 1 freq
blinters - 1 freq
ballant - 11 freq
blend - 18 freq
bloomed - 3 freq
ballants - 15 freq
blinded - 4 freq
blended - 2 freq
bland - 7 freq
blue-eened - 1 freq
ballooned - 1 freq
blondes - 2 freq
blint' - 1 freq
blonde-heidit - 3 freq
blondie-heidit - 1 freq
blin't - 1 freq
blinnded - 1 freq
blinnd - 14 freq
blöndal - 1 freq
blindsided - 1 freq
blinnd-moorie - 1 freq
blendan - 1 freq
blaand - 1 freq
bliind - 2 freq
blinding - 1 freq
balmedie - 7 freq
blindness - 1 freq
blindrife - 1 freq
bellenden - 3 freq
blintered - 2 freq
blinterin - 8 freq
boolmoothed - 1 freq
blendit - 3 freq
ballintuig - 3 freq
blindlie - 1 freq
blinter - 2 freq
blunderin - 1 freq
blintrin - 1 freq
ballindalloch - 1 freq
blandish - 1 freq
blinder - 3 freq
blinndit - 3 freq
blindfolds - 1 freq
ballantyne - 8 freq
blinndin - 2 freq
blindspots - 1 freq
blunder - 3 freq
blinndfoldit - 1 freq
balintore - 1 freq
bool-in-the-mou - 1 freq
blind-sided - 1 freq
blamet - 1 freq
billionth - 1 freq
blinnit - 1 freq
blindt - 1 freq
bealin-daft - 1 freq
bellend - 7 freq
ballondor - 1 freq
blender - 3 freq
blondiesup - 1 freq
ballantine - 1 freq
bylinetimes - 2 freq
ballantrae - 1 freq
MetaPhone code - BLNTS
blinds - 16 freq
blondie's - 1 freq
ballants - 15 freq
blondes - 2 freq
BLINDS
Time to execute Levenshtein function - 0.184289 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.356253 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.027766 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.038544 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.001025 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.