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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
langshanks (0) - 7 freq
langshank's (1) - 1 freq
longshanks (1) - 1 freq
baneshanks (2) - 1 freq
davyshanks (3) - 8 freq
longshanksms (3) - 1 freq
lang-shanked (3) - 1 freq
lang-shankit (3) - 2 freq
langships (3) - 1 freq
langstaunin (4) - 1 freq
langsam (4) - 3 freq
landscapes (4) - 5 freq
longships (4) - 1 freq
handshake (4) - 2 freq
laaghan (4) - 1 freq
langsine (4) - 3 freq
languages (4) - 317 freq
bashans (4) - 1 freq
handshakes (4) - 1 freq
flagstanes (4) - 2 freq
galoshans (4) - 1 freq
langsyne (4) - 60 freq
laandshark (4) - 1 freq
langship (4) - 4 freq
laggans (4) - 1 freq
langshanks (0) - 7 freq
longshanks (1) - 1 freq
langshank's (2) - 1 freq
baneshanks (4) - 1 freq
lang-shankit (5) - 2 freq
lang-shanked (5) - 1 freq
langships (5) - 1 freq
longshanksms (5) - 1 freq
davyshanks (6) - 8 freq
longships (6) - 1 freq
laandshark (7) - 1 freq
langsyne (7) - 60 freq
rookshanks (7) - 1 freq
langship (7) - 4 freq
lang-hained (7) - 1 freq
lashins (7) - 3 freq
handshakes (7) - 1 freq
redeshanks (7) - 1 freq
languishes (7) - 1 freq
longjohns (7) - 2 freq
langsine (7) - 3 freq
langstaunin (7) - 1 freq
shanks (7) - 74 freq
noshuns (8) - 1 freq
ingsbings (8) - 1 freq
SoundEx code - L525
lanesome - 29 freq
lang-gane - 2 freq
langsome - 8 freq
lanesum - 5 freq
lang-kent - 3 freq
langsyne - 60 freq
launchin - 4 freq
long-jump - 1 freq
langeneuch - 1 freq
lonesome - 9 freq
longin - 6 freq
lanesomeness - 4 freq
lang-hained - 1 freq
langshank's - 1 freq
linkin - 15 freq
longshanks - 1 freq
langin - 7 freq
lang-won - 1 freq
longneck - 1 freq
luncheons - 1 freq
lang-wundit - 1 freq
lang-hunnelled - 1 freq
langshanks - 7 freq
limacinae - 1 freq
lang-nebbit - 3 freq
linking - 2 freq
longannet - 1 freq
longingly - 1 freq
laangin - 2 freq
lankin - 1 freq
langsam - 3 freq
langsinsyne - 1 freq
laanchan - 1 freq
laancheen - 1 freq
loungin - 1 freq
linksness - 1 freq
langsine - 3 freq
linesman - 5 freq
longsome - 1 freq
langamachie - 3 freq
lang-neb - 1 freq
langenough - 1 freq
lynch-mob - 1 freq
langsum - 3 freq
lang-nebbed - 1 freq
limousine - 1 freq
longan - 1 freq
lang-syne - 1 freq
lamgamachie - 1 freq
lang-santet - 1 freq
lang-shanked - 1 freq
lang-shankit - 2 freq
lankan - 2 freq
lawmaking - 1 freq
low-hangin - 1 freq
langsom - 1 freq
lenchan - 1 freq
lanesame - 1 freq
long-gone - 1 freq
lanesumness - 2 freq
lang-sin-syne - 1 freq
lynnesnpr - 6 freq
lionking - 1 freq
liamneeson - 1 freq
launching - 2 freq
longjohns - 2 freq
linjm - 1 freq
longing - 1 freq
longshanksms - 1 freq
longniddryafc - 6 freq
longniddry - 3 freq
lynching - 1 freq
languenormande - 1 freq
MetaPhone code - LNKXNKS
langshank's - 1 freq
longshanks - 1 freq
langshanks - 7 freq
LANGSHANKS
Time to execute Levenshtein function - 0.227009 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.412006 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.029002 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.037456 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.000880 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.