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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ocht (0) - 317 freq
nocht (1) - 211 freq
socht (1) - 143 freq
mocht (1) - 3 freq
focht (1) - 101 freq
ochts (1) - 3 freq
oct (1) - 4 freq
docht (1) - 4 freq
bocht (1) - 219 freq
ucht (1) - 1 freq
acht (1) - 14 freq
och (1) - 706 freq
oeht (1) - 1 freq
oche (1) - 1 freq
oucht (1) - 21 freq
mcht (1) - 1 freq
cocht (1) - 11 freq
ncht (1) - 5 freq
echt (1) - 115 freq
tocht (1) - 166 freq
'ocht (1) - 2 freq
lecht (2) - 3 freq
ichy (2) - 1 freq
ochon (2) - 1 freq
brht (2) - 1 freq
ocht (0) - 317 freq
acht (1) - 14 freq
ucht (1) - 1 freq
oucht (1) - 21 freq
echt (1) - 115 freq
tocht (2) - 166 freq
echty (2) - 22 freq
'ocht (2) - 2 freq
aacht (2) - 5 freq
aicht (2) - 33 freq
ouecht (2) - 1 freq
aucht (2) - 33 freq
chit (2) - 4 freq
yacht (2) - 11 freq
eicht (2) - 61 freq
achty (2) - 1 freq
ncht (2) - 5 freq
chat (2) - 71 freq
docht (2) - 4 freq
cocht (2) - 11 freq
oeht (2) - 1 freq
focht (2) - 101 freq
bocht (2) - 219 freq
och (2) - 706 freq
socht (2) - 143 freq
SoundEx code - O230
ocht - 317 freq
ought - 12 freq
oaght - 1 freq
'ocht - 2 freq
oozit - 2 freq
oucht - 21 freq
oozed - 1 freq
oagit - 5 freq
owsed - 9 freq
ouecht - 1 freq
oxide - 1 freq
oecd - 1 freq
oakwood - 1 freq
oesed - 3 freq
oct - 4 freq
oosed - 1 freq
ought - 1 freq
oaged - 1 freq
ocd - 1 freq
okda - 1 freq
ocd - 4 freq
ojdhii - 1 freq
oushed - 1 freq
oqsd - 1 freq
okayed - 1 freq
MetaPhone code - OXT
ocht - 317 freq
'ocht - 2 freq
oucht - 21 freq
ouecht - 1 freq
oushed - 1 freq
OCHT
Time to execute Levenshtein function - 0.209284 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.336089 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.027455 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.040517 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.001188 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.