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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
wainly (0) - 1 freq
mainly (1) - 40 freq
'ainly (1) - 3 freq
vainly (1) - 3 freq
fainly (1) - 2 freq
waikly (1) - 3 freq
ainly (1) - 231 freq
bairnly (2) - 1 freq
faimly (2) - 185 freq
spinly (2) - 1 freq
plainly (2) - 9 freq
waly (2) - 27 freq
airly (2) - 20 freq
aenly (2) - 1 freq
wail (2) - 9 freq
wanty (2) - 4 freq
wily (2) - 7 freq
wails (2) - 6 freq
hailly (2) - 8 freq
windy (2) - 36 freq
wally (2) - 48 freq
ainly' (2) - 1 freq
saifly (2) - 1 freq
blinly (2) - 2 freq
waridly (2) - 1 freq
wainly (0) - 1 freq
ainly (2) - 231 freq
mainly (2) - 40 freq
fainly (2) - 2 freq
waikly (2) - 3 freq
'ainly (2) - 3 freq
vainly (2) - 3 freq
wain (3) - 15 freq
ainle (3) - 2 freq
wanny (3) - 8 freq
oanly (3) - 7 freq
aznly (3) - 1 freq
manly (3) - 7 freq
winsy (3) - 1 freq
winny (3) - 7 freq
wains (3) - 13 freq
winky (3) - 7 freq
wawly (3) - 1 freq
anly (3) - 1 freq
wrily (3) - 1 freq
wincy (3) - 2 freq
wenl (3) - 1 freq
beinly (3) - 1 freq
wigly (3) - 1 freq
warily (3) - 3 freq
SoundEx code - W540
whummlle - 1 freq
wean'll - 3 freq
whummle - 7 freq
wainly - 1 freq
whammle - 2 freq
winmill - 1 freq
wine'll - 1 freq
wheen'll - 1 freq
win'll - 1 freq
whummil - 1 freq
wummile - 1 freq
wammle - 2 freq
wummle - 1 freq
wummily - 2 freq
wan-nil - 1 freq
wenl - 1 freq
weenell - 8 freq
wnl - 1 freq
MetaPhone code - WNL
wean'll - 3 freq
wainly - 1 freq
wine'll - 1 freq
wheen'll - 1 freq
win'll - 1 freq
wenl - 1 freq
weenell - 8 freq
WAINLY
Time to execute Levenshtein function - 0.488011 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.892122 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.032012 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.172972 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.000880 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.