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 ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to blem in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
blem (0) - 2 freq
blek (1) - 10 freq
clem (1) - 4 freq
blm (1) - 1 freq
flem (1) - 1 freq
bleu (1) - 16 freq
blee (1) - 2 freq
blew (1) - 115 freq
blen (1) - 1 freq
bleem (1) - 3 freq
lem (1) - 5 freq
bled (1) - 14 freq
blemt (1) - 2 freq
bem (1) - 1 freq
beem (1) - 5 freq
beet (2) - 18 freq
led (2) - 245 freq
bue (2) - 1 freq
bier (2) - 4 freq
flei (2) - 1 freq
bleet (2) - 2 freq
boom (2) - 30 freq
bqom (2) - 1 freq
plum (2) - 15 freq
bae (2) - 855 freq
blem (0) - 2 freq
bleem (1) - 3 freq
blm (1) - 1 freq
bem (2) - 1 freq
blume (2) - 3 freq
beem (2) - 5 freq
bloum (2) - 1 freq
blaim (2) - 1 freq
blame (2) - 155 freq
bloom (2) - 27 freq
bluim (2) - 6 freq
blemt (2) - 2 freq
balm (2) - 6 freq
flem (2) - 1 freq
blen (2) - 1 freq
bleu (2) - 16 freq
blew (2) - 115 freq
blek (2) - 10 freq
clem (2) - 4 freq
lem (2) - 5 freq
bled (2) - 14 freq
blee (2) - 2 freq
bld (3) - 1 freq
brim (3) - 17 freq
blyd (3) - 1 freq
SoundEx code - B450
blawin - 90 freq
blin - 116 freq
bealin - 32 freq
blaain - 22 freq
blown - 14 freq
beelin - 22 freq
bellum - 3 freq
blawn - 77 freq
blem - 2 freq
bailin - 3 freq
boolin - 16 freq
beeline - 3 freq
bilin - 41 freq
byline - 2 freq
bee-line - 3 freq
bowllin - 2 freq
bluim - 6 freq
blame - 155 freq
billion - 34 freq
bawlin - 19 freq
bullyin - 14 freq
balloon - 37 freq
blinn - 20 freq
baalin - 3 freq
blaan - 10 freq
bylin - 13 freq
bealan - 1 freq
beilin - 3 freq
bowlin - 14 freq
balm - 6 freq
billowin - 3 freq
blaw-in - 1 freq
bloom - 27 freq
blen - 1 freq
bawlin' - 3 freq
blawen - 1 freq
beylin - 1 freq
blaaen - 1 freq
beylen - 1 freq
blaim - 1 freq
blawin' - 2 freq
baelan - 2 freq
baulm - 1 freq
blowin - 13 freq
blume - 3 freq
blow-in - 1 freq
blone - 2 freq
blain - 2 freq
bile-in - 1 freq
balaena - 1 freq
bulin - 1 freq
blin' - 1 freq
'blin - 1 freq
bilin' - 5 freq
bleem - 3 freq
boilan - 1 freq
blowan - 5 freq
blue-in - 1 freq
blouwn - 1 freq
boileen - 1 freq
boilin - 5 freq
blun - 1 freq
blawan - 1 freq
bloum - 1 freq
blaa'in - 2 freq
bellin - 3 freq
blauen - 1 freq
blewn - 2 freq
bloun - 1 freq
ballin - 3 freq
balmy - 2 freq
blin- - 1 freq
bellany - 1 freq
by-line - 3 freq
blaein - 1 freq
bullion - 1 freq
beilan - 1 freq
boolin' - 1 freq
€œblown - 2 freq
bulwan - 2 freq
beelin' - 1 freq
blinn” - 1 freq
blm - 1 freq
baleen - 1 freq
MetaPhone code - BLM
bellum - 3 freq
blem - 2 freq
bluim - 6 freq
blame - 155 freq
balm - 6 freq
bloom - 27 freq
blaim - 1 freq
baulm - 1 freq
blume - 3 freq
bleem - 3 freq
bloum - 1 freq
balmy - 2 freq
blm - 1 freq
BLEM
Time to execute Levenshtein function - 0.329598 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.362511 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.028240 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.036421 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.000735 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.