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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
balm (0) - 6 freq
blm (1) - 1 freq
basm (1) - 1 freq
bam (1) - 39 freq
baim (1) - 1 freq
bal' (1) - 1 freq
balf (1) - 1 freq
baulm (1) - 1 freq
balr (1) - 1 freq
ball (1) - 62 freq
balmy (1) - 2 freq
palm (1) - 33 freq
balms (1) - 1 freq
bald (1) - 18 freq
bale (1) - 8 freq
bal (1) - 6 freq
bali (1) - 1 freq
calm (1) - 133 freq
baum (1) - 2 freq
bang (2) - 100 freq
als (2) - 27 freq
btls (2) - 1 freq
cald (2) - 8 freq
alo (2) - 1 freq
hale (2) - 965 freq
balm (0) - 6 freq
baulm (1) - 1 freq
balmy (1) - 2 freq
blm (1) - 1 freq
bali (2) - 1 freq
bal (2) - 6 freq
bald (2) - 18 freq
baum (2) - 2 freq
blaim (2) - 1 freq
blem (2) - 2 freq
balms (2) - 1 freq
calm (2) - 133 freq
bale (2) - 8 freq
palm (2) - 33 freq
baim (2) - 1 freq
bam (2) - 39 freq
basm (2) - 1 freq
bal' (2) - 1 freq
balr (2) - 1 freq
balf (2) - 1 freq
ball (2) - 62 freq
paulm (3) - 2 freq
bim (3) - 2 freq
bel' (3) - 1 freq
bally (3) - 5 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 - 79 freq
blem - 2 freq
bailin - 3 freq
boolin - 16 freq
beeline - 3 freq
bilin - 42 freq
byline - 2 freq
bee-line - 3 freq
bowllin - 2 freq
bluim - 6 freq
blame - 155 freq
billion - 34 freq
bawlin - 19 freq
bullyin - 17 freq
balloon - 37 freq
blinn - 21 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
belém - 1 freq
boilin - 6 freq
blowin - 14 freq
baelan - 2 freq
baulm - 1 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
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
belém - 1 freq
baulm - 1 freq
blume - 3 freq
bleem - 3 freq
bloum - 1 freq
balmy - 2 freq
blm - 1 freq
BALM
Time to execute Levenshtein function - 0.342384 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.520592 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.031909 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.043257 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.000856 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.