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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
elusive (0) - 5 freq
evasive (2) - 1 freq
reclusive (2) - 1 freq
exclusive (2) - 10 freq
luive (2) - 9 freq
elsie (2) - 62 freq
abusive (2) - 8 freq
erosive (2) - 1 freq
plosives (3) - 1 freq
tousie (3) - 11 freq
lassve (3) - 1 freq
housie (3) - 1 freq
elie (3) - 1 freq
clive (3) - 9 freq
elkie (3) - 1 freq
equine (3) - 3 freq
cruive (3) - 1 freq
easie (3) - 4 freq
explosive (3) - 3 freq
elide (3) - 1 freq
erudite (3) - 2 freq
lustie (3) - 1 freq
'elsie (3) - 9 freq
bausie (3) - 2 freq
lustre (3) - 3 freq
elusive (0) - 5 freq
erosive (3) - 1 freq
lusv (3) - 1 freq
abusive (3) - 8 freq
elsie (3) - 62 freq
luive (3) - 9 freq
evasive (3) - 1 freq
laive (4) - 3 freq
else (4) - 723 freq
eelive (4) - 1 freq
live (4) - 418 freq
luviee (4) - 2 freq
alive (4) - 160 freq
ilive (4) - 1 freq
aleive (4) - 1 freq
lustie (4) - 1 freq
suive (4) - 1 freq
lurve (4) - 6 freq
luiv (4) - 7 freq
elise (4) - 1 freq
lassve (4) - 1 freq
elouise (4) - 9 freq
exclusive (4) - 10 freq
reclusive (4) - 1 freq
elision (4) - 2 freq
SoundEx code - E421
elspeth - 50 freq
else'-bit - 1 freq
eligible - 4 freq
else'--but - 1 freq
elizabeth - 16 freq
elusive - 5 freq
elizabethan - 2 freq
else'-but - 2 freq
elspeth's - 7 freq
elisabeth - 1 freq
elizabeth's - 1 freq
elxsbhppjd - 1 freq
elliesbeaton - 1 freq
elspethkerrsnp - 1 freq
elizabe - 5 freq
elhscp - 6 freq
elskifatboyslim - 2 freq
MetaPhone code - ELSF
elusive - 5 freq
ELUSIVE
Time to execute Levenshtein function - 0.169065 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.344941 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.027106 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.037996 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.000826 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.