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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
lochs (0) - 30 freq
luchs (1) - 1 freq
lachs (1) - 3 freq
locus (1) - 3 freq
mochs (1) - 4 freq
loch (1) - 272 freq
hochs (1) - 12 freq
rochs (1) - 1 freq
loghs (1) - 1 freq
locks (1) - 37 freq
loch's (1) - 1 freq
oocha (2) - 3 freq
focks (2) - 7 freq
nocht (2) - 209 freq
bocht (2) - 217 freq
liths (2) - 2 freq
docks (2) - 27 freq
losh (2) - 30 freq
locke (2) - 1 freq
lichts (2) - 178 freq
sichs (2) - 5 freq
loins (2) - 3 freq
lockt (2) - 5 freq
louis (2) - 30 freq
tocks (2) - 3 freq
lochs (0) - 30 freq
lachs (1) - 3 freq
luchs (1) - 1 freq
locks (2) - 37 freq
lauchs (2) - 21 freq
laichs (2) - 1 freq
loghs (2) - 1 freq
loch's (2) - 1 freq
loch (2) - 272 freq
rochs (2) - 1 freq
mochs (2) - 4 freq
hochs (2) - 12 freq
locus (2) - 3 freq
loco's (3) - 1 freq
souchs (3) - 24 freq
lochee (3) - 1 freq
lucas (3) - 2 freq
lacht (3) - 1 freq
liche (3) - 5 freq
loochy (3) - 2 freq
lch (3) - 1 freq
lucks (3) - 4 freq
flechs (3) - 8 freq
lech (3) - 1 freq
leeches (3) - 4 freq
SoundEx code - L220
likes - 523 freq
likewise - 43 freq
lochs - 30 freq
legacie - 2 freq
lassies - 296 freq
likesay - 25 freq
lassock's - 1 freq
lassies' - 11 freq
laughs - 56 freq
lassie's - 44 freq
lykewise - 1 freq
lauchs - 21 freq
lucas - 2 freq
lakis - 1 freq
lyggis - 1 freq
lucus - 1 freq
lasses - 69 freq
locus - 3 freq
luckies - 1 freq
lue-seek - 1 freq
lugosi - 1 freq
loses - 6 freq
lachs - 3 freq
lexis - 4 freq
logic - 21 freq
loch's - 1 freq
lizzie's - 9 freq
leggies - 10 freq
lackeys - 3 freq
lasheg - 1 freq
losses - 15 freq
lashes - 7 freq
loki's - 3 freq
lockis - 1 freq
lauch's - 3 freq
legacy - 44 freq
looses - 2 freq
lajos - 2 freq
likesae - 4 freq
leagues - 19 freq
lakewyes - 1 freq
leeches - 4 freq
lauches - 1 freq
lasses' - 1 freq
loasses - 5 freq
locke's - 1 freq
likweese - 1 freq
likeweese - 1 freq
lugache - 1 freq
lieges - 1 freq
'lassies - 2 freq
lassikie - 2 freq
lowses - 6 freq
laaghs - 3 freq
like's - 2 freq
laich-hoose - 11 freq
lisa's - 1 freq
lucky's - 1 freq
lizzik - 1 freq
laikewies - 1 freq
laikes - 1 freq
likesey - 1 freq
lykewake - 1 freq
lassock - 2 freq
lakes - 2 freq
loghs - 1 freq
likeweys - 4 freq
likewice - 2 freq
liegis - 2 freq
lykwyes - 1 freq
lasgies - 3 freq
lookeg - 1 freq
luscious - 1 freq
laces - 11 freq
lykes - 4 freq
laichs - 1 freq
lykwise - 1 freq
likewyse - 3 freq
leggis - 1 freq
luggage - 3 freq
lagos - 2 freq
luca's - 1 freq
luggies - 7 freq
like-wise - 1 freq
leaches - 3 freq
loco's - 1 freq
league's - 1 freq
like’s - 1 freq
lassies’s - 1 freq
luchs - 1 freq
lcawwxk - 1 freq
lszhx - 1 freq
lauzzygxo - 3 freq
MetaPhone code - LXS
lochs - 30 freq
lauchs - 21 freq
lachs - 3 freq
loch's - 1 freq
lashes - 7 freq
lauch's - 3 freq
leeches - 4 freq
latches - 2 freq
lauches - 1 freq
laichs - 1 freq
leaches - 3 freq
leitch’s - 1 freq
luchs - 1 freq
leitches - 1 freq
LOCHS
Time to execute Levenshtein function - 0.191256 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.336782 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.029738 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.037056 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.000833 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.