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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
askan (0) - 10 freq
asian (1) - 13 freq
baskan (1) - 1 freq
asken (1) - 4 freq
askin (1) - 176 freq
baskin (2) - 9 freq
alian (2) - 1 freq
akin (2) - 11 freq
actan (2) - 3 freq
scan (2) - 23 freq
wakan (2) - 1 freq
aran (2) - 5 freq
askeg (2) - 1 freq
aston (2) - 4 freq
swan (2) - 23 freq
san (2) - 44 freq
asa (2) - 5 freq
lukan (2) - 5 freq
askeq (2) - 1 freq
asking (2) - 38 freq
ask-' (2) - 1 freq
baekan (2) - 1 freq
addan (2) - 3 freq
castan (2) - 1 freq
makan (2) - 21 freq
askan (0) - 10 freq
askin (1) - 176 freq
asken (1) - 4 freq
skin (2) - 264 freq
skyn (2) - 1 freq
eskin (2) - 2 freq
sukan (2) - 1 freq
sken (2) - 2 freq
sekan (2) - 2 freq
asian (2) - 13 freq
baskan (2) - 1 freq
span (3) - 17 freq
aakin (3) - 3 freq
skyne (3) - 1 freq
aken (3) - 1 freq
askew (3) - 2 freq
askin' (3) - 5 freq
seekan (3) - 3 freq
atakan (3) - 1 freq
sikin (3) - 2 freq
maskin (3) - 8 freq
asket (3) - 1 freq
skal (3) - 1 freq
usman (3) - 1 freq
asn (3) - 1 freq
SoundEx code - A250
again - 2645 freq
askin - 176 freq
agin - 700 freq
agane - 334 freq
aesum - 2 freq
aesome - 6 freq
axiom - 1 freq
akin - 11 freq
agony - 19 freq
awauken - 5 freq
awkin - 2 freq
aknow - 1 freq
assume - 24 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
asian - 13 freq
acne - 1 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 - ASKN
askin - 176 freq
aisy-gaun - 1 freq
asken - 4 freq
askin' - 5 freq
askan - 10 freq
a-seekin - 1 freq
ASKAN
Time to execute Levenshtein function - 0.207513 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.361370 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.028379 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.037259 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.000870 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.