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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
emmaus (0) - 6 freq
emma's (1) - 1 freq
emma (2) - 42 freq
emms (2) - 1 freq
emmma's (2) - 1 freq
emmers (2) - 4 freq
gemma's (2) - 2 freq
maus (2) - 1 freq
emus (2) - 1 freq
ermans (2) - 1 freq
tempus (3) - 1 freq
immers (3) - 2 freq
evans (3) - 27 freq
esau's (3) - 1 freq
€˜maun (3) - 1 freq
ammys (3) - 1 freq
famous (3) - 105 freq
maun (3) - 1163 freq
caus (3) - 8 freq
moa's (3) - 1 freq
mass (3) - 70 freq
ecus (3) - 1 freq
demaun (3) - 1 freq
ella's (3) - 10 freq
seumas (3) - 17 freq
emmaus (0) - 6 freq
emms (2) - 1 freq
emma's (2) - 1 freq
iammas (3) - 2 freq
mimas (3) - 1 freq
yammas (3) - 1 freq
ammys (3) - 1 freq
emus (3) - 1 freq
maus (3) - 1 freq
emmers (3) - 4 freq
emma (3) - 42 freq
mams (3) - 5 freq
macs (4) - 1 freq
nemms (4) - 2 freq
eemis (4) - 12 freq
imma (4) - 1 freq
eimages (4) - 8 freq
gemmes (4) - 74 freq
emails (4) - 14 freq
tammas (4) - 188 freq
nemmes (4) - 10 freq
maum (4) - 2 freq
emmm (4) - 2 freq
mans (4) - 21 freq
mars (4) - 59 freq
SoundEx code - E520
enough - 911 freq
ens - 16 freq
enns - 11 freq
eneuch - 751 freq
eence - 319 freq
eens - 131 freq
enjoay - 1 freq
enjoy - 336 freq
eneugh - 49 freq
ense - 15 freq
eemage - 18 freq
emmma's - 1 freq
enuch - 89 freq
eemis - 12 freq
een's - 13 freq
eyn's - 1 freq
eyns - 7 freq
enjey - 11 freq
eense - 16 freq
eneaise - 1 freq
enn's - 1 freq
enough-he - 1 freq
enouch - 4 freq
ewing - 7 freq
eimage - 18 freq
enugh - 2 freq
enc - 1 freq
enic's - 1 freq
'enjoy - 2 freq
eunice - 1 freq
enoch - 17 freq
enosh - 3 freq
emmaus - 6 freq
eemock - 8 freq
einas - 1 freq
eins - 2 freq
enyoch - 36 freq
eens-shö - 1 freq
eans - 10 freq
emus - 1 freq
enogh - 20 freq
enjye - 1 freq
enough-a - 1 freq
'enough - 1 freq
eng - 10 freq
eneuch- - 1 freq
eyeing - 1 freq
eines - 3 freq
enack - 1 freq
eince - 1 freq
eneoch - 2 freq
€˜eence - 1 freq
eenies - 15 freq
€“eneuch - 1 freq
ems - 4 freq
enschew - 1 freq
enjy - 2 freq
emma's - 1 freq
€œenough - 1 freq
enes - 2 freq
€œenoch - 1 freq
enyoch' - 1 freq
eneÂ’s - 1 freq
emms - 1 freq
emosh - 1 freq
engy - 2 freq
emaaq - 1 freq
emz - 4 freq
emoji - 3 freq
euang - 1 freq
e'en's - 1 freq
eyemask - 1 freq
eimsj - 1 freq
enoug - 1 freq
enj - 1 freq
euankay - 1 freq
MetaPhone code - EMS
emmma's - 1 freq
eemis - 12 freq
emmaus - 6 freq
emus - 1 freq
embassie - 1 freq
embassy - 1 freq
ems - 4 freq
emma's - 1 freq
emms - 1 freq
emz - 4 freq
EMMAUS
Time to execute Levenshtein function - 0.235393 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.352680 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.029569 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.038135 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.000933 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.