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 sonsie

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

Similar words to onand in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
onand (0) - 1 freq
rand (2) - 2 freq
aand (2) - 1 freq
wand (2) - 14 freq
€¦and (2) - 2 freq
pand (2) - 3 freq
onward (2) - 5 freq
haand (2) - 104 freq
taand (2) - 1 freq
inland (2) - 5 freq
ond (2) - 1 freq
lyand (2) - 1 freq
nald (2) - 1 freq
band (2) - 181 freq
tand (2) - 1 freq
shand (2) - 11 freq
ondang (2) - 3 freq
o-an (2) - 1 freq
onkynd (2) - 1 freq
€”and (2) - 8 freq
o'an (2) - 1 freq
annand (2) - 10 freq
tland (2) - 3 freq
iand (2) - 1 freq
jonan (2) - 2 freq
onand (0) - 1 freq
nad (3) - 1 freq
nard (3) - 3 freq
'and (3) - 181 freq
nani (3) - 1 freq
onyane (3) - 13 freq
nane (3) - 547 freq
onno (3) - 20 freq
ongaed (3) - 2 freq
inane (3) - 2 freq
vand (3) - 2 freq
nana (3) - 11 freq
sand (3) - 87 freq
eland (3) - 1 freq
nanr (3) - 1 freq
rnnd (3) - 1 freq
beand (3) - 1 freq
snaad (3) - 1 freq
fand (3) - 176 freq
and (3) - 25387 freq
nan (3) - 14 freq
saand (3) - 13 freq
baand (3) - 13 freq
hand (3) - 319 freq
land (3) - 352 freq
SoundEx code - O553
ooninterestin - 2 freq
one-and-two-and-clap - 1 freq
oan-and-aff - 1 freq
onwindin - 1 freq
onnen't - 1 freq
onendin - 1 freq
onomatopoeic - 1 freq
onhandhandyman - 1 freq
onand - 1 freq
MetaPhone code - ONNT
onnen't - 1 freq
onand - 1 freq
ONAND
Time to execute Levenshtein function - 0.498104 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.790228 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.085605 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.097429 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.000843 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.