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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
qhv (0) - 1 freq
qhi (1) - 1 freq
qht (1) - 38 freq
qlv (1) - 1 freq
qnv (1) - 1 freq
ahv (1) - 7 freq
qh (1) - 4 freq
quhv (1) - 1 freq
fhv (1) - 1 freq
hv (1) - 4 freq
qho (1) - 1 freq
qv (1) - 3 freq
qzv (1) - 1 freq
nhv (1) - 1 freq
qvi (2) - 1 freq
ppv (2) - 4 freq
hh (2) - 3 freq
qo' (2) - 2 freq
hk (2) - 9 freq
itv (2) - 4 freq
qy (2) - 1 freq
dqh (2) - 1 freq
qwa (2) - 1 freq
ahl (2) - 1 freq
shi (2) - 137 freq
qhv (0) - 1 freq
quhv (1) - 1 freq
fhv (2) - 1 freq
hv (2) - 4 freq
qzv (2) - 1 freq
nhv (2) - 1 freq
qho (2) - 1 freq
qv (2) - 3 freq
qhi (2) - 1 freq
qh (2) - 4 freq
qlv (2) - 1 freq
qht (2) - 38 freq
qnv (2) - 1 freq
ahv (2) - 7 freq
'huv (3) - 8 freq
thuv (3) - 5 freq
chav (3) - 3 freq
'hav (3) - 1 freq
thiv (3) - 19 freq
hev (3) - 139 freq
shuv (3) - 7 freq
quha (3) - 17 freq
shiv (3) - 3 freq
huv (3) - 1162 freq
quhy (3) - 2 freq
SoundEx code - Q100
quip - 2 freq
qub - 4 freq
qvha - 1 freq
qhv - 1 freq
qb - 2 freq
qzaf - 1 freq
qyvf - 1 freq
qf - 3 freq
qcf - 1 freq
qvi - 1 freq
qzv - 1 freq
quhv - 1 freq
qfw - 1 freq
qcby - 1 freq
qp - 7 freq
qby - 1 freq
qkf - 1 freq
qv - 3 freq
qzp - 1 freq
qjjuby - 1 freq
qpo - 1 freq
qevh - 1 freq
qkjph - 1 freq
qph - 1 freq
qjvv - 1 freq
qffbf - 1 freq
qkkf - 1 freq
MetaPhone code - KF
gave - 237 freq
goave - 6 freq
gough - 1 freq
coff - 19 freq
gf - 5 freq
cove - 19 freq
gove - 14 freq
keevee - 1 freq
coffee - 156 freq
guff - 56 freq
goaf - 1 freq
cuif - 5 freq
'govey - 1 freq
cafe - 31 freq
gowf - 26 freq
gaff - 34 freq
cough - 59 freq
cave - 79 freq
cuff - 4 freq
cauf - 10 freq
gowff - 3 freq
coaf - 1 freq
coffey - 3 freq
cavie - 2 freq
gav - 2 freq
couff - 2 freq
gaive - 1 freq
caff - 13 freq
caif - 1 freq
gov - 39 freq
caaf - 4 freq
café - 3 freq
café - 25 freq
coof - 7 freq
gaffe - 1 freq
govie - 3 freq
'goavie - 1 freq
cfe - 4 freq
gogh - 1 freq
koffie - 1 freq
caavie - 2 freq
cv - 4 freq
guffy - 2 freq
gva - 1 freq
kaif - 1 freq
cf - 12 freq
guffaw - 1 freq
€˜coff - 1 freq
caffy - 1 freq
€˜gave - 1 freq
gaif - 1 freq
€˜cave - 1 freq
kee-vee - 2 freq
€œcoffee - 1 freq
cava - 1 freq
coaffay - 1 freq
guffie - 3 freq
caffee - 2 freq
caffe - 1 freq
cauve - 1 freq
qhv - 1 freq
kv - 10 freq
cuv - 3 freq
kwf - 1 freq
kyf - 1 freq
caf - 2 freq
gv - 11 freq
hygf - 1 freq
qf - 3 freq
ckif - 1 freq
cuhf - 1 freq
coffee” - 1 freq
qvi - 1 freq
kf - 3 freq
cav - 1 freq
quhv - 1 freq
cúiv - 1 freq
qfw - 1 freq
‘cove - 1 freq
kev - 6 freq
kif - 1 freq
hqv - 1 freq
ckf - 1 freq
yyaquf - 1 freq
kkv - 1 freq
cvu - 1 freq
gvu - 1 freq
qv - 3 freq
coaffe - 1 freq
kufae - 1 freq
cov - 1 freq
ko-fi - 1 freq
cva - 1 freq
wgf - 1 freq
qevh - 1 freq
keogh - 1 freq
qph - 1 freq
ygv - 1 freq
'cfe - 1 freq
cfe' - 1 freq
cghee - 1 freq
kffi - 1 freq
cfai - 1 freq
cvh - 1 freq
hgv - 3 freq
coffee' - 1 freq
covvy - 16 freq
ckhf - 1 freq
QHV
Time to execute Levenshtein function - 0.355206 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.574289 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.057618 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.041605 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.000815 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.