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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
okay (0) - 67 freq
onay (1) - 1 freq
oka (1) - 1 freq
'okay (1) - 8 freq
okey (1) - 1 freq
okap (1) - 1 freq
kay (1) - 67 freq
thay (2) - 706 freq
iday (2) - 19 freq
yeay (2) - 1 freq
oney (2) - 15 freq
pay (2) - 122 freq
oaj (2) - 1 freq
yay (2) - 6 freq
slay (2) - 5 freq
onby (2) - 1 freq
kky (2) - 1 freq
oak (2) - 16 freq
gkam (2) - 1 freq
sway (2) - 10 freq
lay (2) - 386 freq
oan (2) - 6040 freq
oany (2) - 16 freq
clay (2) - 21 freq
obey (2) - 8 freq
okay (0) - 67 freq
okey (1) - 1 freq
kay (1) - 67 freq
oka (1) - 1 freq
ok (2) - 116 freq
aka (2) - 12 freq
kaa (2) - 2 freq
oak (2) - 16 freq
kaay (2) - 1 freq
kaye (2) - 4 freq
oki (2) - 5 freq
ka (2) - 12 freq
key (2) - 219 freq
kau (2) - 2 freq
okap (2) - 1 freq
'okay (2) - 8 freq
onay (2) - 1 freq
yokey (2) - 2 freq
ky (2) - 6 freq
ika (2) - 3 freq
say (3) - 3705 freq
tka (3) - 1 freq
ony (3) - 2222 freq
oaq (3) - 1 freq
way (3) - 900 freq
SoundEx code - O200
och - 706 freq
'och - 119 freq
oose - 13 freq
oags - 2 freq
o's - 48 freq
okay - 67 freq
ouch - 24 freq
'ouch - 2 freq
og - 10 freq
oohs - 1 freq
ok - 116 freq
ox - 25 freq
'okay - 8 freq
oqo-oh - 1 freq
ochie - 8 freq
oak - 16 freq
oosie - 3 freq
ock - 1 freq
oz - 15 freq
oq - 4 freq
ooohs - 1 freq
ooze - 3 freq
'ox - 1 freq
o'is - 31 freq
os - 11 freq
ouija - 7 freq
ooies - 1 freq
owes - 4 freq
'owch - 1 freq
'ok - 6 freq
oic - 1 freq
ouk - 16 freq
o'z - 6 freq
owse - 5 freq
osc - 3 freq
oag - 2 freq
ooooooch - 1 freq
o'skye - 1 freq
oki - 5 freq
oozie - 1 freq
ook - 2 freq
oossie - 1 freq
oos - 1 freq
okey - 1 freq
oasy - 1 freq
og' - 1 freq
owis - 1 freq
€˜och - 13 freq
€œoch - 19 freq
ox-eye - 1 freq
oiss - 1 freq
oys - 3 freq
oes - 2 freq
€œox - 1 freq
€œok - 11 freq
ouse - 1 freq
€˜okay - 1 freq
€˜o-o-o-o-k-k-k-k - 1 freq
€”och - 1 freq
€œokay - 9 freq
oese - 4 freq
'oose' - 1 freq
'oyez - 1 freq
oyez' - 1 freq
oaks - 1 freq
€™ok - 1 freq
€™okay - 2 freq
oxj - 1 freq
oxhi - 1 freq
oj - 2 freq
oooocha - 1 freq
oc - 2 freq
okjjx - 1 freq
“och - 1 freq
oega - 1 freq
oceiyi - 1 freq
ouks - 2 freq
oxo - 1 freq
ooocha - 2 freq
oocha - 3 freq
oougg - 1 freq
oooosh - 1 freq
oxi - 2 freq
okaaayÂ… - 1 freq
ojo - 3 freq
ohhsqj - 1 freq
ouzo - 1 freq
okqyuy - 1 freq
oka - 1 freq
ougo - 1 freq
o'whisky - 1 freq
oeq - 1 freq
osz - 1 freq
ojxg - 1 freq
oxsie - 1 freq
oiseau - 1 freq
oqy - 1 freq
ojjz - 1 freq
ozo - 1 freq
oajo - 1 freq
ohohj - 1 freq
oxsi - 1 freq
oÂ’s - 1 freq
oaq - 1 freq
ooekk - 1 freq
oasz - 1 freq
oaj - 1 freq
oigj - 1 freq
okj - 1 freq
oche - 1 freq
occa - 1 freq
ozg - 1 freq
oeg - 1 freq
oszy - 1 freq
oqc - 1 freq
MetaPhone code - OK
okay - 67 freq
og - 10 freq
ok - 116 freq
'okay - 8 freq
oqo-oh - 1 freq
oak - 16 freq
ock - 1 freq
oq - 4 freq
'ok - 6 freq
oic - 1 freq
ouk - 16 freq
oag - 2 freq
oki - 5 freq
ook - 2 freq
okey - 1 freq
og' - 1 freq
€œok - 11 freq
€˜okay - 1 freq
€œokay - 9 freq
€™ok - 1 freq
€™okay - 2 freq
oc - 2 freq
oega - 1 freq
oougg - 1 freq
okaaayÂ… - 1 freq
oka - 1 freq
ougo - 1 freq
oeq - 1 freq
oqy - 1 freq
oaq - 1 freq
ooekk - 1 freq
oeg - 1 freq
OKAY
Time to execute Levenshtein function - 0.177282 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.342027 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.027843 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.037709 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.000976 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.