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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
abuin--- (0) - 1 freq
abuin (3) - 346 freq
aquinas (4) - 1 freq
abain (4) - 23 freq
abuird (4) - 12 freq
abusin (4) - 4 freq
bade--- (4) - 1 freq
abune (4) - 178 freq
again- (4) - 1 freq
abuise (4) - 3 freq
then--- (4) - 1 freq
blin- (4) - 1 freq
bu---r (4) - 1 freq
abins (4) - 1 freq
dinn-- (4) - 1 freq
him--- (4) - 1 freq
berkin--- (4) - 1 freq
abiine (4) - 3 freq
agin- (4) - 1 freq
abin (4) - 43 freq
buin (4) - 12 freq
ain- (4) - 1 freq
abuised (4) - 1 freq
shin-o- (4) - 1 freq
abinn (4) - 5 freq
abuin--- (0) - 1 freq
bade--- (5) - 1 freq
dinn-- (6) - 1 freq
bu---r (6) - 1 freq
then--- (6) - 1 freq
him--- (6) - 1 freq
abuin (6) - 346 freq
berkin--- (6) - 1 freq
buin (7) - 12 freq
shin-o- (7) - 1 freq
abinn (7) - 5 freq
bank- (7) - 1 freq
bane- (7) - 1 freq
belt--i (7) - 1 freq
bin-lid (7) - 1 freq
bank-e (7) - 1 freq
abin (7) - 43 freq
abun (7) - 3 freq
ain- (7) - 1 freq
abain (7) - 23 freq
abune (7) - 178 freq
again- (7) - 1 freq
agin- (7) - 1 freq
blin- (7) - 1 freq
abins (7) - 1 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
ABUIN---
Time to execute Levenshtein function - 0.201294 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.398679 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.028887 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.053399 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.000920 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.