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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
eamonn (0) - 9 freq
eamonns (1) - 1 freq
emond (2) - 1 freq
damorn (2) - 6 freq
amon (2) - 23 freq
lamond (2) - 1 freq
lamont (2) - 8 freq
amon' (2) - 4 freq
eamonnss (2) - 1 freq
eaton (2) - 1 freq
kemonn (2) - 1 freq
among (2) - 128 freq
'among (2) - 1 freq
eatons (2) - 2 freq
alonn (2) - 1 freq
eamin (2) - 1 freq
samoan (2) - 1 freq
damn (3) - 73 freq
saxons (3) - 8 freq
enn (3) - 38 freq
lomond (3) - 17 freq
examen (3) - 1 freq
amen (3) - 24 freq
mown (3) - 2 freq
gaming (3) - 3 freq
eamonn (0) - 9 freq
eamonns (2) - 1 freq
kemonn (3) - 1 freq
mann (3) - 15 freq
among (3) - 128 freq
alonn (3) - 1 freq
amon' (3) - 4 freq
eamin (3) - 1 freq
emond (3) - 1 freq
monen (3) - 1 freq
amon (3) - 23 freq
amun (4) - 5 freq
mond (4) - 4 freq
mahoun (4) - 1 freq
amang (4) - 699 freq
monk (4) - 13 freq
ceann (4) - 1 freq
amana (4) - 1 freq
manny (4) - 6 freq
hann (4) - 23 freq
maony (4) - 1 freq
comunn (4) - 1 freq
pann (4) - 1 freq
fonn (4) - 1 freq
monnie (4) - 5 freq
SoundEx code - E550
e'enin - 3 freq
enemy - 38 freq
ennin - 2 freq
een-an - 1 freq
enin - 4 freq
eenin - 5 freq
enemie - 7 freq
eomin - 1 freq
eenan - 1 freq
en'in - 5 freq
enihin - 1 freq
eenou-an - 2 freq
einen - 1 freq
eamin - 1 freq
ehman - 1 freq
enem - 2 freq
enyhin - 1 freq
eamonn - 9 freq
enenoo - 8 freq
MetaPhone code - EMN
eomin - 1 freq
aemin - 1 freq
eamin - 1 freq
ehman - 1 freq
emboiain - 2 freq
eamonn - 9 freq
EAMONN
Time to execute Levenshtein function - 0.182293 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.334352 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.027450 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.036716 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.004526 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.