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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
kechs (0) - 1 freq
keechs (1) - 1 freq
pechs (1) - 6 freq
kehs (1) - 1 freq
kecks (1) - 5 freq
fechs (1) - 1 freq
mochs (2) - 4 freq
skecht (2) - 1 freq
lehs (2) - 5 freq
pehs (2) - 2 freq
recht (2) - 10 freq
secks (2) - 8 freq
decht (2) - 1 freq
kens (2) - 531 freq
becks (2) - 8 freq
pech (2) - 35 freq
ech (2) - 5 freq
keks (2) - 4 freq
hochs (2) - 12 freq
kfcs (2) - 1 freq
keech (2) - 41 freq
keach (2) - 2 freq
kicks (2) - 27 freq
echr (2) - 1 freq
wehs (2) - 2 freq
kechs (0) - 1 freq
keechs (1) - 1 freq
fechs (2) - 1 freq
kecks (2) - 5 freq
kehs (2) - 1 freq
pechs (2) - 6 freq
kach (3) - 1 freq
echos (3) - 2 freq
sachs (3) - 4 freq
keich (3) - 8 freq
echas (3) - 4 freq
seechs (3) - 1 freq
rochs (3) - 1 freq
kyths (3) - 5 freq
sichs (3) - 5 freq
kich (3) - 1 freq
kaces (3) - 1 freq
beuchs (3) - 4 freq
lachs (3) - 3 freq
heichs (3) - 2 freq
heuchs (3) - 3 freq
luchs (3) - 1 freq
lochs (3) - 30 freq
keech (3) - 41 freq
hochs (3) - 12 freq
SoundEx code - K220
kisses - 29 freq
keechs - 1 freq
keysies - 1 freq
kakes - 1 freq
kishies - 4 freq
kyisses - 1 freq
kissies - 1 freq
kaces - 1 freq
kiujsyewxa - 1 freq
kechs - 1 freq
kuzyk - 1 freq
kessock - 1 freq
kukukg - 1 freq
kickass - 1 freq
kizziewiz - 2 freq
khqxhsi - 1 freq
kaikos - 1 freq
MetaPhone code - KXS
coaches - 9 freq
catches - 31 freq
keechs - 1 freq
quaichs - 4 freq
catche's - 1 freq
gushes - 5 freq
cautious - 8 freq
cowshus - 5 freq
kishies - 4 freq
cochise - 5 freq
cowtious - 1 freq
coach's - 1 freq
coshes - 1 freq
couches - 2 freq
kechs - 1 freq
KECHS
Time to execute Levenshtein function - 0.179894 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.360901 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.027681 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.036601 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.000795 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.