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 lang-neb in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
lang-neb (0) - 1 freq
lang-ee (2) - 2 freq
langue (3) - 2 freq
lang-term (3) - 13 freq
langsyne (3) - 60 freq
langin (3) - 7 freq
languge (3) - 1 freq
lang-kent (3) - 3 freq
lang- (3) - 1 freq
langsine (3) - 3 freq
lang-syne (3) - 1 freq
langage (3) - 244 freq
lang-deid (3) - 3 freq
spang-new (3) - 3 freq
lang-legs (3) - 1 freq
pang-yen (3) - 2 freq
lang-nebbit (3) - 3 freq
lanfine (3) - 1 freq
lanmines (3) - 1 freq
lang-telt (3) - 1 freq
langues (3) - 1 freq
lang-nebbed (3) - 1 freq
langages (3) - 23 freq
lag-en (3) - 2 freq
lang-won (3) - 1 freq
lang-neb (0) - 1 freq
lang-ee (4) - 2 freq
lang-nebbed (5) - 1 freq
lang-nebbit (5) - 3 freq
lag-en (5) - 2 freq
lang-ago (5) - 1 freq
lang-deef (5) - 1 freq
lang-gane (5) - 2 freq
lang-deid (5) - 3 freq
lang-won (5) - 1 freq
pang-yen (5) - 2 freq
lang- (5) - 1 freq
langin (5) - 7 freq
langsyne (5) - 60 freq
langsine (5) - 3 freq
lang-kent (5) - 3 freq
lang-syne (5) - 1 freq
longing (6) - 1 freq
langton (6) - 1 freq
lang-tail (6) - 1 freq
lang-tint (6) - 1 freq
long-deid (6) - 1 freq
langsybe (6) - 1 freq
alangib (6) - 3 freq
longannet (6) - 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 - LNKNB
lang-neb - 1 freq
LANG-NEB
Time to execute Levenshtein function - 0.218862 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.362485 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.032660 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.041993 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.000890 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.