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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
annex (0) - 4 freq
annexe (1) - 1 freq
anne (1) - 74 freq
annew (1) - 1 freq
annec (1) - 3 freq
panned (2) - 6 freq
ainer (2) - 2 freq
annay (2) - 4 freq
anew (2) - 14 freq
cannen (2) - 3 freq
annie (2) - 107 freq
awned (2) - 27 freq
acne (2) - 1 freq
ann's (2) - 4 freq
inner (2) - 44 freq
ane (2) - 2115 freq
innes (2) - 14 freq
canner (2) - 1 freq
canned (2) - 2 freq
hannet (2) - 2 freq
bannet (2) - 1 freq
manne (2) - 1 freq
ance (2) - 69 freq
ganner (2) - 1 freq
aner (2) - 2 freq
annex (0) - 4 freq
annexe (1) - 1 freq
annew (2) - 1 freq
annec (2) - 3 freq
anne (2) - 74 freq
onnen (3) - 2 freq
anno (3) - 5 freq
unnerx (3) - 1 freq
annum (3) - 2 freq
rnyex (3) - 1 freq
anneal (3) - 2 freq
index (3) - 16 freq
anns (3) - 1 freq
unner (3) - 454 freq
anen (3) - 49 freq
annaa (3) - 1 freq
onner (3) - 3 freq
anny (3) - 1 freq
annoy (3) - 12 freq
annies (3) - 1 freq
annan (3) - 4 freq
nne (3) - 1 freq
ann (3) - 105 freq
annexin (3) - 1 freq
aonner (3) - 1 freq
SoundEx code - A520
aince - 454 freq
ang - 8 freq
aneugh - 15 freq
aneuch - 30 freq
anes - 218 freq
ain-och - 1 freq
an---och - 1 freq
anyweys - 1 freq
ance - 69 freq
awns - 17 freq
angie - 36 freq
'angie - 5 freq
anxi - 4 freq
anas - 9 freq
anyways - 12 freq
amuse - 8 freq
awmous - 4 freq
ane's - 11 freq
annoys - 4 freq
amok - 1 freq
aims - 13 freq
a-miss - 1 freq
annie's - 8 freq
aeons - 1 freq
amyoose - 1 freq
ains - 14 freq
amaze - 4 freq
anna's - 3 freq
anq - 2 freq
aums - 1 freq
aeneas - 3 freq
anes' - 2 freq
'aince - 1 freq
an-och - 1 freq
amiss - 16 freq
anagh - 1 freq
an-ugh - 1 freq
ann's - 4 freq
anne's - 2 freq
annas - 2 freq
amos - 3 freq
am's - 2 freq
an's - 4 freq
amnesia - 1 freq
ank - 1 freq
anyoch - 25 freq
aamos - 5 freq
annies - 1 freq
ameise - 1 freq
aence - 8 freq
ameuse - 1 freq
annexe - 1 freq
anso - 1 freq
amuck - 1 freq
ans - 2 freq
aa'hing - 5 freq
anse - 4 freq
aneoch - 2 freq
an'-qh - 1 freq
ain's - 3 freq
aans - 1 freq
annays - 1 freq
'anus' - 1 freq
€œaneugh - 1 freq
annex - 4 freq
€œaince - 4 freq
amico - 1 freq
a-muigh - 1 freq
ange - 1 freq
anzio - 1 freq
aeyhing - 1 freq
€™ang - 2 freq
aines - 2 freq
ahing - 1 freq
anns - 1 freq
awmox - 1 freq
angieh - 1 freq
aÂ’hinÂ’s - 1 freq
aneÂ’s - 1 freq
aimee's - 1 freq
anyhoos - 13 freq
aeonmag - 1 freq
a'hing - 4 freq
annjj - 1 freq
aewing - 1 freq
ayoung - 1 freq
amigo - 3 freq
amys - 1 freq
amc - 1 freq
annec - 3 freq
ammys - 1 freq
MetaPhone code - ANKS
anxi - 4 freq
angus - 117 freq
ancus - 2 freq
annexe - 1 freq
annex - 4 freq
ANNEX
Time to execute Levenshtein function - 0.185174 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.325786 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.027230 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.037631 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.000861 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.