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 wu-yun in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
wu-yun (0) - 14 freq
wulyn (2) - 1 freq
woun (3) - 5 freq
wunsum (3) - 1 freq
wum-man (3) - 1 freq
di-yan (3) - 1 freq
wumman (3) - 588 freq
wuirn (3) - 2 freq
whyn (3) - 3 freq
aiyun (3) - 1 freq
twa-pun (3) - 1 freq
u-y (3) - 1 freq
wushin (3) - 4 freq
wayin (3) - 1 freq
re-run (3) - 1 freq
wuiven (3) - 3 freq
busrun (3) - 1 freq
wunnur (3) - 1 freq
wurkur (3) - 3 freq
ubun (3) - 1 freq
wanun (3) - 1 freq
wummen (3) - 36 freq
wuty (3) - 14 freq
wuin (3) - 3 freq
upun (3) - 5 freq
wu-yun (0) - 14 freq
wulyn (3) - 1 freq
wuman (4) - 40 freq
wyn (4) - 1 freq
whaun (4) - 5 freq
wurn (4) - 1 freq
weeyin (4) - 22 freq
wagaun (4) - 3 freq
wumen (4) - 7 freq
whun (4) - 92 freq
wuhan (4) - 2 freq
wuidin (4) - 24 freq
wyin (4) - 2 freq
wunn (4) - 9 freq
wuidn (4) - 1 freq
wa-gaun (4) - 1 freq
weimun (4) - 1 freq
wun (4) - 200 freq
weyin (4) - 3 freq
wumin (4) - 5 freq
wuiden (4) - 24 freq
wuin (4) - 3 freq
bai-yun (4) - 8 freq
wuirn (4) - 2 freq
wayin (4) - 1 freq
SoundEx code - W500
when - 4506 freq
win - 980 freq
wan - 2472 freq
whinny - 6 freq
wean - 424 freq
wun - 200 freq
wheen - 829 freq
winna - 384 freq
whan - 2757 freq
whein - 50 freq
won - 282 freq
wine - 272 freq
ween - 25 freq
weein - 1 freq
wame - 75 freq
'when - 19 freq
wain - 15 freq
'whan - 7 freq
wunna - 10 freq
wanae - 1 freq
whiney - 1 freq
win' - 7 freq
wane - 12 freq
waa'in - 1 freq
whin - 755 freq
'whin - 1 freq
whim - 9 freq
wham - 21 freq
wheem - 1 freq
winnie - 80 freq
wi'm - 3 freq
wayne - 6 freq
wi'in - 37 freq
whiny - 2 freq
whom - 17 freq
winnae - 46 freq
won' - 1 freq
wyne - 16 freq
weem - 11 freq
wooin - 1 freq
wim - 2 freq
'wan - 6 freq
wanna - 17 freq
whun - 92 freq
wuhan - 2 freq
wanny - 8 freq
wuin - 3 freq
winn - 1 freq
wunnae - 13 freq
wn - 7 freq
weeyin - 22 freq
wunny - 1 freq
wunne - 1 freq
whunny - 1 freq
wi'ïn - 2 freq
wwhan - 1 freq
wen - 18 freq
wona - 1 freq
whin' - 1 freq
waam - 1 freq
weeny - 2 freq
wye'in - 1 freq
wino - 2 freq
wine' - 1 freq
waim'i - 1 freq
wyme - 5 freq
wymie - 1 freq
whunnie - 1 freq
wan-wye - 1 freq
whine - 5 freq
whaen - 3 freq
winny - 7 freq
wunn - 9 freq
whaun - 5 freq
wan- - 2 freq
wan' - 2 freq
wieen - 1 freq
waen - 2 freq
waein - 1 freq
woun - 5 freq
€˜when - 4 freq
wone - 4 freq
wyin - 2 freq
'winna' - 2 freq
whinney - 1 freq
€œwhan - 8 freq
waw-en - 1 freq
wien - 1 freq
weyin - 3 freq
€œwhen - 4 freq
€œwhin - 1 freq
whain - 1 freq
€˜win - 1 freq
whane - 3 freq
wyn - 1 freq
wannae - 6 freq
wine-o - 1 freq
wum - 1 freq
weenie - 1 freq
€œwinna - 2 freq
€˜wan - 5 freq
wu-yun - 14 freq
whyn - 3 freq
whaim - 1 freq
€˜wean - 1 freq
wein - 2 freq
whammy - 2 freq
wm- - 1 freq
wuni - 1 freq
wini - 2 freq
wan” - 1 freq
winae - 2 freq
wina - 1 freq
wenna - 1 freq
'winnae' - 2 freq
win- - 2 freq
-wan - 1 freq
weemo - 1 freq
wm - 12 freq
'win' - 1 freq
wooin” - 1 freq
wami - 1 freq
'wean' - 1 freq
wmu - 1 freq
wwn - 1 freq
'wheen' - 1 freq
wme - 1 freq
weanÂ’ - 1 freq
wean' - 3 freq
wayin - 1 freq
weeeannie - 1 freq
wayno - 1 freq
'wheen - 1 freq
wam - 1 freq
MetaPhone code - WYN
weeyin - 22 freq
weyin - 3 freq
wu-yun - 14 freq
wayin - 1 freq
WU-YUN
Time to execute Levenshtein function - 0.267018 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.428854 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.028213 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.068062 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.001104 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.