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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
edith (0) - 18 freq
edih (1) - 1 freq
eith (1) - 26 freq
edit (1) - 17 freq
dith (1) - 1 freq
faith (2) - 161 freq
editor (2) - 70 freq
trith (2) - 1 freq
eithe (2) - 1 freq
editar (2) - 2 freq
doth (2) - 9 freq
evite (2) - 12 freq
edina (2) - 2 freq
saith (2) - 2 freq
brith (2) - 4 freq
lith (2) - 1 freq
meith (2) - 3 freq
edyta (2) - 7 freq
pith (2) - 9 freq
teith (2) - 5 freq
endite (2) - 1 freq
ediot (2) - 1 freq
ekit (2) - 1 freq
dish (2) - 73 freq
ith (2) - 2 freq
edith (0) - 18 freq
dith (1) - 1 freq
daith (2) - 286 freq
dath (2) - 1 freq
doth (2) - 9 freq
deith (2) - 102 freq
edit (2) - 17 freq
edih (2) - 1 freq
eith (2) - 26 freq
tuith (3) - 11 freq
beith (3) - 5 freq
leith (3) - 200 freq
dieh (3) - 1 freq
eeth (3) - 1 freq
earth (3) - 251 freq
death (3) - 168 freq
buith (3) - 3 freq
mith (3) - 63 freq
kith (3) - 13 freq
editer (3) - 1 freq
eirth (3) - 1 freq
suith (3) - 7 freq
raith (3) - 9 freq
fith (3) - 1 freq
sith (3) - 6 freq
SoundEx code - E330
edith - 18 freq
eidiot - 1 freq
eidiot' - 1 freq
edit - 17 freq
eediot - 5 freq
etude - 1 freq
'edit' - 1 freq
eatit - 1 freq
edyta - 7 freq
€œedith - 3 freq
eyeteeth - 1 freq
ediot - 1 freq
MetaPhone code - ET0
edith - 18 freq
€œedith - 3 freq
EDITH
Time to execute Levenshtein function - 0.634011 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 - 1.165336 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.027506 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.098786 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.000782 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.