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 ablow

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

Similar words to waesome in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
waesome (0) - 19 freq
aesome (1) - 6 freq
twasome (2) - 1 freq
iresome (2) - 1 freq
faersome (2) - 5 freq
baecome (2) - 6 freq
lanesome (2) - 28 freq
winsome (2) - 5 freq
luesome (2) - 2 freq
wulsome (2) - 2 freq
loesome (2) - 7 freq
halesome (2) - 9 freq
'awesome (2) - 1 freq
ransome (2) - 1 freq
wilsome (2) - 1 freq
waesomely (2) - 4 freq
leesome (2) - 9 freq
walcome (2) - 71 freq
eesome (2) - 2 freq
awesome (2) - 35 freq
hansome (2) - 3 freq
awsome (2) - 2 freq
dulesome (3) - 18 freq
aese (3) - 8 freq
haunsome (3) - 2 freq
waesome (0) - 19 freq
awesome (2) - 35 freq
aesome (2) - 6 freq
awsome (2) - 2 freq
waesomely (3) - 4 freq
wilsome (3) - 1 freq
leesome (3) - 9 freq
eesome (3) - 2 freq
awsom (3) - 1 freq
loesome (3) - 7 freq
'awesome (3) - 1 freq
winsome (3) - 5 freq
twasome (3) - 1 freq
luesome (3) - 2 freq
wulsome (3) - 2 freq
iresome (3) - 1 freq
bowsome (4) - 1 freq
wesnae (4) - 3 freq
dowiesome (4) - 2 freq
ugsome (4) - 65 freq
weestie (4) - 1 freq
westie (4) - 2 freq
leasome (4) - 1 freq
bosome (4) - 1 freq
waste (4) - 120 freq
SoundEx code - W250
wisna - 1037 freq
waukin - 24 freq
wickeyn - 1 freq
wasna - 80 freq
wisnae - 999 freq
wesna - 131 freq
washin - 81 freq
wakin - 19 freq
wizzen - 4 freq
wysin - 1 freq
wagon - 21 freq
wheezin - 8 freq
wasnae - 127 freq
wauken - 25 freq
wakken - 2 freq
wissin - 5 freq
wakkin - 3 freq
waesome - 19 freq
weighin - 8 freq
woken - 7 freq
wushin - 4 freq
wheechin - 40 freq
wiznae - 12 freq
waaken - 16 freq
waggin - 24 freq
wishin - 37 freq
waashin - 29 freq
waakin - 35 freq
wisno - 19 freq
waken - 9 freq
wisn - 3 freq
wheechin' - 1 freq
wusnae - 64 freq
weisna - 3 freq
washen - 2 freq
weisnae - 2 freq
waashin' - 11 freq
wuznae - 2 freq
wheekin - 3 freq
wisny - 4 freq
waxin - 4 freq
whuskin - 3 freq
wik-en - 6 freq
waaxin - 1 freq
wizzna - 6 freq
wizna - 4 freq
wage-in - 1 freq
waashin- - 1 freq
whackin - 2 freq
weaken - 1 freq
wis-in - 1 freq
weshin - 1 freq
wusnay - 1 freq
washin' - 3 freq
wiken - 1 freq
'waashin - 1 freq
waashen - 1 freq
wishen - 2 freq
whizzin - 4 freq
washeen - 11 freq
whessan - 3 freq
wheezeen - 1 freq
whizzan - 1 freq
whackan - 1 freq
wishan - 2 freq
wisin - 11 freq
waachin - 1 freq
weyghan - 1 freq
waakan - 9 freq
wakkan - 1 freq
waak-in' - 1 freq
waash-han - 1 freq
wakan - 1 freq
waashan - 1 freq
wesnae - 3 freq
wa-gaan - 1 freq
washan - 3 freq
wöshen - 1 freq
wheeshin - 2 freq
weeackin - 2 freq
wuishen - 1 freq
weygaun - 1 freq
wagaun - 3 freq
wikeyn - 3 freq
wizni - 3 freq
wikkeyn - 2 freq
wogan - 1 freq
wiusna - 1 freq
wissna - 1 freq
week-en - 2 freq
wasn - 3 freq
wasney - 1 freq
wizny - 1 freq
wisne - 2 freq
'wasnae' - 1 freq
wikein - 2 freq
wisni - 7 freq
wikeyne - 1 freq
wusna - 1 freq
wagaen - 1 freq
wa-gaun - 1 freq
wikken - 1 freq
wuzna - 1 freq
wussin - 1 freq
wahkin - 1 freq
€œwaaken - 1 freq
weeshin - 1 freq
€¦washin - 1 freq
wisnay - 2 freq
waaÂ’shinÂ’ - 1 freq
wusni - 2 freq
wasni - 4 freq
waznae - 3 freq
wsmn - 1 freq
wigan - 1 freq
wackin - 1 freq
wicayam - 1 freq
weekeyn - 1 freq
‘wisna - 1 freq
wxen - 1 freq
waakken - 1 freq
whzxm - 1 freq
whiskin - 1 freq
wqn - 1 freq
wazn - 2 freq
wasnea - 1 freq
MetaPhone code - WSM
waesome - 19 freq
WAESOME
Time to execute Levenshtein function - 0.172341 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.325208 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.027291 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.036534 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.000827 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.