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 ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to abun in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
abun (0) - 3 freq
bun (1) - 59 freq
abdn (1) - 6 freq
abin (1) - 43 freq
abune (1) - 178 freq
agun (1) - 1 freq
abeun (1) - 5 freq
abu (1) - 2 freq
abon (1) - 1 freq
ubun (1) - 1 freq
amun (1) - 5 freq
apun (1) - 2 freq
abut (1) - 1 freq
abuin (1) - 346 freq
arun (1) - 2 freq
aboun (1) - 1 freq
un (2) - 31 freq
alon (2) - 2 freq
ab- (2) - 1 freq
'bug (2) - 1 freq
oban (2) - 3 freq
duun (2) - 1 freq
naun (2) - 1 freq
guun (2) - 1 freq
ahn (2) - 1 freq
abun (0) - 3 freq
bun (1) - 59 freq
ubun (1) - 1 freq
abuin (1) - 346 freq
aboun (1) - 1 freq
abeun (1) - 5 freq
abon (1) - 1 freq
abin (1) - 43 freq
abune (1) - 178 freq
bn (2) - 7 freq
abane (2) - 28 freq
buon (2) - 1 freq
abaen (2) - 1 freq
abyne (2) - 2 freq
abean (2) - 1 freq
abain (2) - 23 freq
ban (2) - 48 freq
aboon (2) - 16 freq
bon (2) - 14 freq
boun (2) - 10 freq
baun (2) - 18 freq
buin (2) - 12 freq
byn (2) - 2 freq
abeen (2) - 154 freq
ben (2) - 609 freq
SoundEx code - A150
abuin - 346 freq
abune - 178 freq
affen - 118 freq
abeen - 154 freq
abin - 43 freq
appen - 25 freq
aiven - 66 freq
apen - 70 freq
abinn - 5 freq
aboon - 16 freq
aipen - 16 freq
apon - 90 freq
avenue - 19 freq
'appen - 1 freq
abene - 1 freq
ab'm - 1 freq
ab'yne - 1 freq
abean - 1 freq
abain - 23 freq
abiine - 3 freq
abane - 28 freq
'apen - 2 freq
aff-han - 1 freq
apein - 3 freq
apin - 13 freq
aapen - 1 freq
afen - 4 freq
abaen - 1 freq
'ahb'm - 1 freq
abön - 34 freq
abun - 3 freq
aff'n - 1 freq
aboön - 1 freq
abon - 1 freq
'affen' - 1 freq
affhan - 1 freq
a-poohin - 1 freq
abeun - 5 freq
apön - 15 freq
abøn - 2 freq
aboun - 1 freq
affin - 2 freq
avon - 3 freq
abün - 11 freq
apün - 4 freq
avaa-na - 1 freq
affeome - 1 freq
avon' - 1 freq
abyne - 2 freq
apone - 3 freq
apoun - 1 freq
apun - 2 freq
apÖn - 1 freq
apen-moo - 1 freq
abeeen - 1 freq
affhaun - 1 freq
appin - 2 freq
abuin--- - 1 freq
avin - 2 freq
€˜aye-been - 1 freq
aivmh - 1 freq
auobnow - 1 freq
aveeno - 1 freq
apmi - 1 freq
apm - 1 freq
MetaPhone code - ABN
abuin - 346 freq
abune - 178 freq
abeen - 154 freq
abin - 43 freq
abinn - 5 freq
aboon - 16 freq
abene - 1 freq
ab'yne - 1 freq
abean - 1 freq
abain - 23 freq
abiine - 3 freq
abane - 28 freq
abaen - 1 freq
abön - 34 freq
abun - 3 freq
aboön - 1 freq
abon - 1 freq
abeun - 5 freq
abøn - 2 freq
aboun - 1 freq
abün - 11 freq
abyne - 2 freq
abeeen - 1 freq
abuin--- - 1 freq
auobnow - 1 freq
ABUN
Time to execute Levenshtein function - 0.379324 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.539002 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.071413 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.065358 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.000922 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.