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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
keeking (0) - 1 freq
seeking (1) - 6 freq
keeping (1) - 44 freq
peeking (1) - 2 freq
reeking (1) - 1 freq
keekin (1) - 126 freq
keating (2) - 1 freq
seeping (2) - 1 freq
peekin (2) - 3 freq
keepin (2) - 213 freq
reekin' (2) - 2 freq
keyring (2) - 2 freq
keekiy (2) - 1 freq
keenin (2) - 10 freq
beezing (2) - 1 freq
decking (2) - 1 freq
peering (2) - 1 freq
weeping (2) - 3 freq
keeng (2) - 77 freq
heeding (2) - 4 freq
seekin (2) - 100 freq
beeping (2) - 1 freq
eekin (2) - 1 freq
keelin (2) - 1 freq
seeming (2) - 1 freq
keeking (0) - 1 freq
reeking (2) - 1 freq
peeking (2) - 2 freq
keekin (2) - 126 freq
keeping (2) - 44 freq
seeking (2) - 6 freq
keikin (3) - 10 freq
leaking (3) - 4 freq
keeng (3) - 77 freq
keyring (3) - 2 freq
keekan (3) - 2 freq
kicking (3) - 6 freq
keing (3) - 140 freq
keating (3) - 1 freq
joking (4) - 1 freq
waking (4) - 2 freq
fking (4) - 7 freq
boaking (4) - 1 freq
okeating (4) - 3 freq
making (4) - 57 freq
kelng (4) - 1 freq
seeing (4) - 59 freq
keenins (4) - 1 freq
fecking (4) - 4 freq
keekit (4) - 46 freq
SoundEx code - K252
kizzens - 6 freq
keekin-gless - 27 freq
kicking - 6 freq
k-i-s-s-i-n-g-ee - 1 freq
keekin-glesses - 2 freq
kiekin-gless - 1 freq
keekingless - 1 freq
keckin-gless - 1 freq
kechynis - 1 freq
keiching - 1 freq
kissing - 2 freq
keeking - 1 freq
kashanacauley - 1 freq
kazmackscot - 4 freq
MetaPhone code - KKNK
kicking - 6 freq
cooking - 15 freq
cowgang - 1 freq
keeking - 1 freq
hqgnhg - 1 freq
KEEKING
Time to execute Levenshtein function - 0.344256 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.514398 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.033578 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.064016 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.000769 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.