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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
lassikie (0) - 2 freq
lassie (2) - 790 freq
laikie (2) - 1 freq
lambikie (2) - 1 freq
massive (3) - 83 freq
lassve (3) - 1 freq
lassie'd (3) - 2 freq
lasswade (3) - 2 freq
lassie's (3) - 44 freq
lasgie (3) - 4 freq
lossie (3) - 7 freq
passive (3) - 9 freq
caskie (3) - 4 freq
assize (3) - 1 freq
laike (3) - 33 freq
lassi (3) - 3 freq
lassie' (3) - 1 freq
arbikie (3) - 1 freq
baikie (3) - 1 freq
sassilia (3) - 1 freq
classified (3) - 6 freq
jassie (3) - 3 freq
associe (3) - 32 freq
assisi (3) - 2 freq
sassidge (3) - 6 freq
lassikie (0) - 2 freq
lassie (3) - 790 freq
lassi (4) - 3 freq
lassie' (4) - 1 freq
lassies (4) - 308 freq
lossie (4) - 7 freq
russkie (4) - 1 freq
lesslie (4) - 1 freq
lassve (4) - 1 freq
laikie (4) - 1 freq
lambikie (4) - 1 freq
lassie's (5) - 44 freq
horsikie (5) - 1 freq
massilia (5) - 1 freq
lassy (5) - 3 freq
haskie (5) - 2 freq
cassini (5) - 2 freq
lassies' (5) - 11 freq
cassie (5) - 10 freq
massie (5) - 3 freq
loonikie (5) - 1 freq
lossin (5) - 32 freq
fusskee (5) - 1 freq
laesk (5) - 4 freq
lasso (5) - 1 freq
SoundEx code - L220
likes - 524 freq
likewise - 44 freq
lochs - 32 freq
legacie - 2 freq
lassies - 308 freq
likesay - 25 freq
lassock's - 1 freq
lassies' - 11 freq
laughs - 60 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 - 22 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 - 4 freq
legacy - 44 freq
'lassies - 3 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
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 - LSK
lue-seek - 1 freq
lisk - 1 freq
lassikie - 2 freq
laesk - 4 freq
lizzik - 1 freq
lassock - 2 freq
leisk - 1 freq
lwsc - 1 freq
lzg - 1 freq
lzk - 1 freq
LASSIKIE
Time to execute Levenshtein function - 0.228416 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.408919 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.036490 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.053234 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.001343 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.