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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
lisps (0) - 1 freq
liss (1) - 2 freq
limps (1) - 1 freq
lists (1) - 19 freq
lips (1) - 193 freq
lisp (1) - 2 freq
wisps (1) - 3 freq
lik's (2) - 1 freq
clips (2) - 9 freq
isis (2) - 1 freq
links (2) - 67 freq
eiss (2) - 31 freq
lis (2) - 1 freq
gliss (2) - 1 freq
glimps (2) - 1 freq
lires (2) - 1 freq
lit's (2) - 13 freq
lidls (2) - 2 freq
leaps (2) - 7 freq
rasps (2) - 11 freq
lies (2) - 140 freq
lip (2) - 84 freq
ligs (2) - 19 freq
lasts (2) - 14 freq
gimps (2) - 4 freq
lisps (0) - 1 freq
wisps (2) - 3 freq
lips (2) - 193 freq
lisp (2) - 2 freq
lists (2) - 19 freq
limps (2) - 1 freq
liss (2) - 2 freq
lumps (3) - 21 freq
less (3) - 539 freq
esps (3) - 2 freq
loups (3) - 6 freq
lss (3) - 1 freq
loses (3) - 6 freq
laps (3) - 7 freq
csps (3) - 1 freq
sips (3) - 4 freq
lups (3) - 1 freq
lests (3) - 3 freq
lepps (3) - 1 freq
leps (3) - 1 freq
lowps (3) - 29 freq
gasps (3) - 7 freq
lisa's (3) - 1 freq
laists (3) - 1 freq
lass (3) - 495 freq
SoundEx code - L212
lassie-bashin - 1 freq
lace-ups - 1 freq
lochboisdale - 1 freq
lisps - 1 freq
lockfast - 1 freq
lock-back - 1 freq
lockups - 1 freq
lascivious - 1 freq
lesbos - 2 freq
lsfsvas - 1 freq
lazybastard - 1 freq
ljovjlrtc - 1 freq
lochabskyepol - 1 freq
lggjxfgcj - 1 freq
lkhuoffxye - 1 freq
lug-buik - 1 freq
lkhbpz - 1 freq
lqwvghpwm - 1 freq
lascapigliata - 1 freq
lgfz - 1 freq
lqkjfxxqaq - 1 freq
lgvqz - 1 freq
lssfzyb - 2 freq
MetaPhone code - LSPS
lace-ups - 1 freq
lisps - 1 freq
LISPS
Time to execute Levenshtein function - 0.356972 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.494003 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.028118 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.038237 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.000792 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.