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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
rainin (0) - 41 freq
gainin (1) - 11 freq
raidin (1) - 9 freq
raisin (1) - 33 freq
drainin (1) - 14 freq
ruinin (1) - 1 freq
rainie (1) - 8 freq
mainin (1) - 3 freq
sainin (1) - 4 freq
raikin (1) - 14 freq
rainin' (1) - 2 freq
rinin (1) - 2 freq
rainan (1) - 1 freq
trainin (1) - 59 freq
ainin (1) - 1 freq
railin (1) - 12 freq
raining (1) - 5 freq
rairin (1) - 22 freq
hainin (1) - 20 freq
ranin (1) - 1 freq
brainin (1) - 1 freq
draigin (2) - 3 freq
kanin (2) - 1 freq
rapin (2) - 2 freq
launin (2) - 1 freq
rainin (0) - 41 freq
ruinin (1) - 1 freq
rinin (1) - 2 freq
rainan (1) - 1 freq
ranin (1) - 1 freq
brainin (2) - 1 freq
rairin (2) - 22 freq
hainin (2) - 20 freq
rnin (2) - 1 freq
airnin (2) - 1 freq
yarnin (2) - 18 freq
rannie (2) - 3 freq
roonin (2) - 1 freq
raining (2) - 5 freq
reinen (2) - 1 freq
rinn (2) - 1 freq
earnin (2) - 8 freq
sainin (2) - 4 freq
mainin (2) - 3 freq
drainin (2) - 14 freq
raisin (2) - 33 freq
raidin (2) - 9 freq
gainin (2) - 11 freq
raikin (2) - 14 freq
rainie (2) - 8 freq
SoundEx code - R550
rainin - 41 freq
rinnin - 331 freq
rome-naw - 3 freq
runnin - 219 freq
rennin - 6 freq
roman - 76 freq
remayne - 1 freq
reunion - 6 freq
roamin - 9 freq
rammin - 3 freq
remain - 40 freq
rhymin - 15 freq
runnan - 25 freq
remine - 2 freq
runnin' - 7 freq
rainin' - 2 freq
runnen - 3 freq
reinnen - 1 freq
rinnen - 4 freq
rennen - 2 freq
reinen - 1 freq
rinnin' - 3 freq
rhymin' - 2 freq
rinnan - 3 freq
remin - 1 freq
re-union - 1 freq
rnin - 1 freq
ruinin - 1 freq
run-in - 1 freq
reamin - 6 freq
rome-na - 1 freq
rainan - 1 freq
renown - 1 freq
runan - 1 freq
rome-no - 1 freq
rannan - 1 freq
rmnin - 1 freq
ranin - 1 freq
rouman - 2 freq
rinin - 2 freq
rename - 2 freq
reimin - 1 freq
ranown - 1 freq
raimon - 1 freq
romania - 1 freq
rein-in - 1 freq
roonin - 1 freq
MetaPhone code - RNN
rainin - 41 freq
rinnin - 331 freq
runnin - 219 freq
rennin - 6 freq
reunion - 6 freq
runnan - 25 freq
runnin' - 7 freq
rainin' - 2 freq
runnen - 3 freq
reinnen - 1 freq
rinnen - 4 freq
rennen - 2 freq
reinen - 1 freq
rinnin' - 3 freq
rinnan - 3 freq
re-union - 1 freq
rnin - 1 freq
ruinin - 1 freq
run-in - 1 freq
rainan - 1 freq
renown - 1 freq
runan - 1 freq
rannan - 1 freq
ranin - 1 freq
rinin - 2 freq
ranown - 1 freq
rein-in - 1 freq
roonin - 1 freq
RAININ
rain - 686 freq
rainfall - 304 freq
rainin - 41 freq
rains - 27 freq
rainy - 16 freq
Time to execute Levenshtein function - 0.184678 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.350981 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.031449 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.037666 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.000954 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.