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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
agen (0) - 12 freq
age (1) - 425 freq
agent (1) - 14 freq
agein (1) - 13 freq
aden (1) - 2 freq
a'en (1) - 1 freq
aten (1) - 2 freq
aget (1) - 1 freq
amen (1) - 24 freq
age' (1) - 1 freq
alen (1) - 1 freq
agin (1) - 703 freq
ageen (1) - 111 freq
agun (1) - 1 freq
agaen (1) - 24 freq
anen (1) - 49 freq
apen (1) - 70 freq
afen (1) - 4 freq
gen (1) - 11 freq
aren (1) - 3 freq
ages (1) - 153 freq
aged (1) - 34 freq
agee (1) - 1 freq
aen (1) - 10 freq
aken (1) - 1 freq
agen (0) - 12 freq
agin (1) - 703 freq
ageen (1) - 111 freq
gen (1) - 11 freq
agyen (1) - 2 freq
agun (1) - 1 freq
agaen (1) - 24 freq
agein (1) - 13 freq
gean (2) - 10 freq
geen (2) - 77 freq
egon (2) - 1 freq
gin (2) - 1987 freq
agno (2) - 1 freq
agony (2) - 19 freq
gn (2) - 10 freq
aigan (2) - 1 freq
aegin (2) - 1 freq
gene (2) - 2 freq
gon (2) - 7 freq
agayn (2) - 4 freq
aegean (2) - 4 freq
gien (2) - 1024 freq
again (2) - 2708 freq
gein (2) - 37 freq
agane (2) - 334 freq
SoundEx code - A250
again - 2708 freq
askin - 183 freq
agin - 703 freq
agane - 334 freq
aesum - 2 freq
aesome - 7 freq
axiom - 1 freq
akin - 12 freq
agony - 19 freq
awauken - 5 freq
awkin - 2 freq
aknow - 1 freq
assume - 25 freq
again- - 1 freq
ashen - 2 freq
ackin - 5 freq
aixin - 1 freq
again' - 6 freq
acan - 1 freq
achan - 2 freq
aksin - 13 freq
achin - 14 freq
agonie - 4 freq
ayginee - 1 freq
asken - 4 freq
agayn - 4 freq
askin' - 5 freq
acne - 3 freq
asian - 13 freq
ae-same - 1 freq
aisan - 1 freq
axin - 25 freq
agnne - 1 freq
akim - 2 freq
agane' - 1 freq
aye-gaun - 1 freq
azwiéhin - 1 freq
agaen - 24 freq
ax'in - 1 freq
agnew - 1 freq
'awesome - 1 freq
achim - 2 freq
a'sum - 1 freq
aekin - 1 freq
¬‚aggan - 1 freq
ageen - 111 freq
a-goin - 1 freq
awesome - 35 freq
agein - 13 freq
acheen - 1 freq
askan - 10 freq
aisin - 1 freq
awaw-gaun - 1 freq
aesin - 2 freq
agen - 12 freq
assam - 1 freq
awsome - 2 freq
aiken - 11 freq
aakin - 3 freq
aegean - 4 freq
aye-gauin - 1 freq
agyen - 2 freq
agaiun - 1 freq
ayegaun - 1 freq
a-sayin - 1 freq
agin- - 1 freq
awoken - 2 freq
asma - 1 freq
aw-seein - 2 freq
awaken - 1 freq
agun - 1 freq
€˜ajami - 1 freq
aegin - 1 freq
aigan - 1 freq
€™again - 2 freq
ahsan - 1 freq
aken - 1 freq
again” - 1 freq
agm - 2 freq
agam - 1 freq
awsom - 1 freq
aoxnu - 1 freq
acum - 1 freq
asn - 1 freq
agno - 1 freq
acnh - 2 freq
ajm - 1 freq
aquiania - 1 freq
axemn - 1 freq
awqhn - 1 freq
MetaPhone code - AJN
agin - 703 freq
ayginee - 1 freq
aidgin - 1 freq
ageen - 111 freq
agein - 13 freq
agen - 12 freq
agin- - 1 freq
AGEN
Time to execute Levenshtein function - 0.213393 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.495643 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.027640 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.077142 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.001369 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.