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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ropin (0) - 1 freq
ripin (1) - 3 freq
rooin (1) - 2 freq
rowin (1) - 30 freq
lopin (1) - 1 freq
rypin (1) - 5 freq
rovin (1) - 6 freq
gopin (1) - 1 freq
hopin (1) - 85 freq
robin (1) - 196 freq
rompin (1) - 2 freq
mopin (1) - 1 freq
rapin (1) - 2 freq
copin (1) - 4 freq
roupin (1) - 4 freq
gropin (1) - 2 freq
opin (1) - 9 freq
respin (2) - 1 freq
honin (2) - 2 freq
moppin (2) - 2 freq
toyin (2) - 2 freq
toppin (2) - 5 freq
hoping (2) - 31 freq
mooin (2) - 4 freq
bobin (2) - 1 freq
ropin (0) - 1 freq
rypin (1) - 5 freq
roupin (1) - 4 freq
ripin (1) - 3 freq
rapin (1) - 2 freq
gropin (2) - 2 freq
opin (2) - 9 freq
repon (2) - 8 freq
reapin (2) - 4 freq
reopen (2) - 1 freq
ripen (2) - 8 freq
raepin (2) - 3 freq
rypan (2) - 1 freq
copin (2) - 4 freq
mopin (2) - 1 freq
gopin (2) - 1 freq
rovin (2) - 6 freq
lopin (2) - 1 freq
hopin (2) - 85 freq
rowin (2) - 30 freq
rompin (2) - 2 freq
robin (2) - 196 freq
rooin (2) - 2 freq
resin (3) - 6 freq
rtin (3) - 1 freq
SoundEx code - R150
rubbin - 50 freq
rivin - 28 freq
rappin - 6 freq
rippin - 21 freq
rypin - 5 freq
repone - 68 freq
ruffin - 2 freq
reivin - 13 freq
reapin - 4 freq
reevin - 3 freq
riven - 15 freq
roofin - 1 freq
ribbon - 21 freq
robin - 196 freq
ripin - 3 freq
roupin - 4 freq
raven - 12 freq
raiven - 1 freq
ripen - 8 freq
rippen - 5 freq
robbin - 6 freq
roabin - 1 freq
rovin - 6 freq
rivan - 2 freq
rapin - 2 freq
ravin - 10 freq
rehoboam - 2 freq
rïppin - 1 freq
reheboam - 2 freq
rubban - 3 freq
refine - 4 freq
rovan - 1 freq
rypan - 1 freq
rivven - 1 freq
raepin - 3 freq
revenue - 3 freq
reevin' - 1 freq
reiban - 2 freq
reboun - 1 freq
ravan - 2 freq
revvin - 1 freq
ribban - 1 freq
ryvin - 1 freq
reviewin - 1 freq
'robin - 1 freq
ropin - 1 freq
repon - 8 freq
re-appen - 1 freq
rippan - 1 freq
rippin' - 1 freq
ruifin - 2 freq
ribbin - 2 freq
robina - 1 freq
rbm - 4 freq
ribben - 1 freq
re-open - 1 freq
rfn - 1 freq
ribena - 2 freq
robbiem - 3 freq
reopen - 1 freq
rpm - 1 freq
MetaPhone code - RPN
wrappin - 16 freq
rappin - 6 freq
rippin - 21 freq
rypin - 5 freq
repone - 68 freq
reapin - 4 freq
ripin - 3 freq
roupin - 4 freq
ripen - 8 freq
rippen - 5 freq
rapin - 2 freq
rïppin - 1 freq
rypan - 1 freq
raepin - 3 freq
wrappan - 1 freq
ropin - 1 freq
repon - 8 freq
re-appen - 1 freq
rippan - 1 freq
rippin' - 1 freq
wrappin' - 1 freq
wrappin’ - 2 freq
re-open - 1 freq
reopen - 1 freq
ROPIN
Time to execute Levenshtein function - 0.208787 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.421608 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.027938 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.044166 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.001252 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.