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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
eita (0) - 1 freq
vita (1) - 1 freq
eitan (1) - 1 freq
eits (1) - 1 freq
fita (1) - 1 freq
kita (1) - 1 freq
rita (1) - 1 freq
eith (1) - 26 freq
eit (1) - 644 freq
eit' (1) - 2 freq
pita (1) - 2 freq
bita (1) - 1 freq
ita (1) - 10 freq
ia (2) - 5 freq
fits (2) - 130 freq
vesta (2) - 2 freq
i-a (2) - 1 freq
elba (2) - 15 freq
eif (2) - 46 freq
wit (2) - 210 freq
tit (2) - 26 freq
egt (2) - 1 freq
feit (2) - 24 freq
bitta (2) - 5 freq
eire (2) - 3 freq
eita (0) - 1 freq
ita (1) - 10 freq
eit (1) - 644 freq
outa (2) - 6 freq
yit (2) - 500 freq
eet (2) - 581 freq
aite (2) - 4 freq
eat (2) - 467 freq
ta (2) - 2534 freq
oota (2) - 54 freq
oit (2) - 1 freq
iti (2) - 1 freq
it (2) - 33301 freq
iota (2) - 2 freq
tia (2) - 2 freq
iuta (2) - 1 freq
ite (2) - 3 freq
et (2) - 256 freq
yite (2) - 2 freq
ait (2) - 138 freq
kita (2) - 1 freq
fita (2) - 1 freq
ata (2) - 58 freq
eit' (2) - 2 freq
bita (2) - 1 freq
SoundEx code - E300
ett - 97 freq
eat - 467 freq
eat' - 6 freq
et - 256 freq
'ee'd - 2 freq
ee'd - 26 freq
euid - 4 freq
eddie - 31 freq
eith - 26 freq
eed - 11 freq
eit - 644 freq
eth - 8 freq
eita - 1 freq
ett' - 1 freq
eit' - 2 freq
eeyit - 1 freq
eh'd - 2 freq
eyed - 21 freq
eddy - 2 freq
'eat - 6 freq
eet - 581 freq
'eet' - 2 freq
ed - 53 freq
ead - 1 freq
eateh - 1 freq
eithe - 1 freq
eeth - 1 freq
'eddie' - 1 freq
edih - 1 freq
eday - 5 freq
eeday - 1 freq
-ed - 1 freq
edu - 3 freq
e'd - 2 freq
ed - 66 freq
'ett - 1 freq
ettie - 4 freq
Áed - 1 freq
ed - 2 freq
ead - 1 freq
-eat - 1 freq
eat - 2 freq
eadie - 1 freq
-ed - 1 freq
eid - 4 freq
e’day - 1 freq
e'day - 1 freq
eahd - 1 freq
ee’d - 1 freq
eddyhow - 1 freq
eddi - 1 freq
eihd - 2 freq
edi - 1 freq
MetaPhone code - ET
ett - 97 freq
eat - 467 freq
aed - 2 freq
aet - 102 freq
eat' - 6 freq
et - 256 freq
'ee'd - 2 freq
ee'd - 26 freq
euid - 4 freq
eddie - 31 freq
eed - 11 freq
eit - 644 freq
eita - 1 freq
ett' - 1 freq
eit' - 2 freq
eh'd - 2 freq
eddy - 2 freq
'eat - 6 freq
eet - 581 freq
'eet' - 2 freq
ed - 53 freq
ead - 1 freq
eateh - 1 freq
aedie - 1 freq
'aedie - 1 freq
aet' - 1 freq
'eddie' - 1 freq
edih - 1 freq
eday - 5 freq
eeday - 1 freq
-ed - 1 freq
edu - 3 freq
e'd - 2 freq
ed - 66 freq
'ett - 1 freq
ae-day - 1 freq
ettie - 4 freq
Áed - 1 freq
ed - 2 freq
ead - 1 freq
-eat - 1 freq
eat - 2 freq
eadie - 1 freq
-ed - 1 freq
eid - 4 freq
e’day - 1 freq
e'day - 1 freq
eahd - 1 freq
ee’d - 1 freq
eddi - 1 freq
aeiot - 1 freq
eihd - 2 freq
edi - 1 freq
EITA
Time to execute Levenshtein function - 0.215948 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.348386 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.027928 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.037630 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.000934 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.