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 ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to kneels in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
kneels (0) - 1 freq
keels (1) - 4 freq
knees (1) - 174 freq
knee's (1) - 1 freq
kneel (1) - 15 freq
kneelt (1) - 3 freq
kneeld (1) - 1 freq
kells (2) - 7 freq
knelt (2) - 21 freq
keel (2) - 12 freq
skeels (2) - 48 freq
snells (2) - 1 freq
'needs (2) - 1 freq
keele (2) - 1 freq
neebs (2) - 13 freq
keess (2) - 10 freq
kness (2) - 1 freq
kneis (2) - 1 freq
wheels (2) - 83 freq
eels (2) - 11 freq
keeks (2) - 15 freq
neems (2) - 7 freq
knee' (2) - 1 freq
feels (2) - 153 freq
kneeled (2) - 3 freq
kneels (0) - 1 freq
kneelt (2) - 3 freq
kneel (2) - 15 freq
kneeld (2) - 1 freq
keels (2) - 4 freq
knees (2) - 174 freq
knee's (2) - 1 freq
kneelin (3) - 19 freq
knolls (3) - 1 freq
kneeled (3) - 3 freq
knell (3) - 5 freq
kness (3) - 1 freq
kennels (3) - 5 freq
kevels (3) - 1 freq
kneis (3) - 1 freq
kells (3) - 7 freq
knelt (3) - 21 freq
kinless (4) - 1 freq
keengs (4) - 5 freq
kyles (4) - 3 freq
kellas (4) - 2 freq
knoll (4) - 2 freq
kinely (4) - 4 freq
onles (4) - 2 freq
kynes (4) - 11 freq
SoundEx code - K542
knolls - 1 freq
kennels' - 1 freq
kennels - 5 freq
kinloch - 3 freq
kemel's - 1 freq
knawlege - 5 freq
kinless - 1 freq
kinloch's - 1 freq
kneels - 1 freq
kin-like - 1 freq
kinlochleven - 1 freq
kinnelcuttie - 1 freq
€˜kinloch - 1 freq
kenloachsixteen - 2 freq
MetaPhone code - NLS
nails - 78 freq
nell's - 2 freq
nail's - 1 freq
neil's - 4 freq
knolls - 1 freq
nellie's - 3 freq
nals - 1 freq
nls - 6 freq
niall's - 1 freq
kneels - 1 freq
KNEELS
Time to execute Levenshtein function - 0.188927 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.335564 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.027156 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.036639 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.000966 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.