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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
cashielaas (0) - 2 freq
casmilus (4) - 1 freq
shiels (4) - 4 freq
castiel (4) - 1 freq
shields (4) - 15 freq
cushiedoos (4) - 2 freq
ashlars (4) - 2 freq
cassie's (4) - 2 freq
hielans (4) - 17 freq
kasilas (4) - 1 freq
shielan (4) - 1 freq
chiels (4) - 110 freq
chiel's (4) - 17 freq
cashier (4) - 1 freq
castels (4) - 2 freq
hushiebaa (4) - 1 freq
cassies (4) - 6 freq
shillans (4) - 2 freq
castellis (4) - 1 freq
shield (5) - 26 freq
cannels (5) - 4 freq
shallas (5) - 1 freq
caramels (5) - 4 freq
shills (5) - 3 freq
michaelmas (5) - 7 freq
cashielaas (0) - 2 freq
chiels (5) - 110 freq
cushiedoos (5) - 2 freq
castels (5) - 2 freq
shiels (5) - 4 freq
casmilus (5) - 1 freq
mashles (6) - 1 freq
cashline (6) - 1 freq
castellis (6) - 1 freq
coshes (6) - 1 freq
bushels (6) - 1 freq
castles (6) - 26 freq
cushats (6) - 1 freq
cushions (6) - 11 freq
veshels (6) - 2 freq
cashley (6) - 2 freq
cheels (6) - 2 freq
cassies (6) - 6 freq
shielan (6) - 1 freq
chiel's (6) - 17 freq
cassie's (6) - 2 freq
ashlars (6) - 2 freq
castiel (6) - 1 freq
shields (6) - 15 freq
cashier (6) - 1 freq
SoundEx code - C242
cycles - 5 freq
casual-like - 2 freq
cockaleekie - 1 freq
cockles - 6 freq
cheisels - 1 freq
cyclist - 5 freq
cashielaas - 2 freq
cosy-like - 2 freq
cockieleekie - 1 freq
coagles - 1 freq
cosh-lyke - 1 freq
coackles - 1 freq
cyclists - 12 freq
cackles - 1 freq
chuckles - 1 freq
cyclically - 1 freq
cugallach - 1 freq
cyclical - 1 freq
cyclescotland - 1 freq
MetaPhone code - KXLS
cashielaas - 2 freq
€™cksheils - 1 freq
CASHIELAAS
Time to execute Levenshtein function - 0.407705 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.888788 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.076701 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.037881 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.000811 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.