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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unselt (0) - 1 freq
unsealt (1) - 1 freq
unspelt (1) - 1 freq
untelt (1) - 2 freq
unmet (2) - 3 freq
selt (2) - 88 freq
upseyt (2) - 1 freq
ursel (2) - 2 freq
insect (2) - 3 freq
upset (2) - 66 freq
un-self (2) - 1 freq
hanselt (2) - 3 freq
unrest (2) - 6 freq
sunset (2) - 28 freq
insert (2) - 3 freq
runkelt (2) - 5 freq
onset (2) - 7 freq
inset (2) - 2 freq
ungert (2) - 1 freq
kneelt (2) - 3 freq
umsel (2) - 1 freq
untellt (2) - 2 freq
unseen (2) - 29 freq
aunsert (2) - 1 freq
bundelt (2) - 1 freq
unselt (0) - 1 freq
unsealt (1) - 1 freq
insult (2) - 27 freq
untelt (2) - 2 freq
unspelt (2) - 1 freq
onset (3) - 7 freq
insert (3) - 3 freq
aunsert (3) - 1 freq
hanselt (3) - 3 freq
inset (3) - 2 freq
unst (3) - 12 freq
insect (3) - 3 freq
selt (3) - 88 freq
neest (4) - 88 freq
nestlt (4) - 1 freq
inlet (4) - 1 freq
insole (4) - 1 freq
insist (4) - 10 freq
solt (4) - 7 freq
ainsels (4) - 1 freq
sealt (4) - 2 freq
eensel (4) - 6 freq
intilt (4) - 11 freq
nest (4) - 81 freq
nailt (4) - 2 freq
SoundEx code - U524
uncle - 275 freq
unusual - 25 freq
uneasily - 4 freq
un-cleek - 1 freq
uncleids - 1 freq
unco-like - 4 freq
unkil - 4 freq
unclean - 6 freq
unshillit - 1 freq
unself-isolatin - 2 freq
'uncle - 1 freq
umquhile - 18 freq
unyoosual - 1 freq
unclenches - 1 freq
un-guiltily - 1 freq
umquwhile - 1 freq
'uncle' - 1 freq
unyaisual - 1 freq
unusually - 3 freq
unsolved - 2 freq
unglued - 1 freq
'uncles - 1 freq
unwycelike - 1 freq
unassailable - 1 freq
uncle's - 8 freq
uncles - 19 freq
unselt - 1 freq
unusal - 1 freq
uncoil - 2 freq
unco-lookin - 1 freq
unclips - 1 freq
unclasps - 1 freq
unclippin - 1 freq
uncoilan - 1 freq
ungleg - 1 freq
unjieldin - 1 freq
unslochen't - 1 freq
un-self - 1 freq
uncolike - 1 freq
uncalled - 2 freq
unsealt - 1 freq
unchallenged - 2 freq
unco-leukin - 2 freq
unclean' - 1 freq
umquhyle - 5 freq
unequal - 1 freq
unchallanced - 1 freq
€œuncle - 2 freq
uniquely - 4 freq
un-sel-conscious - 1 freq
umsel - 1 freq
uncle-like - 1 freq
unselfishly - 1 freq
unselfish - 1 freq
unslung - 1 freq
uneasy-like - 1 freq
unsolvable - 1 freq
unusuall - 1 freq
umzeltdw - 1 freq
unclouded - 1 freq
uinxxsxlhh - 1 freq
MetaPhone code - UNSLT
unselt - 1 freq
unsealt - 1 freq
UNSELT
Time to execute Levenshtein function - 0.599103 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.815648 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.064762 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.038732 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.000892 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.