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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
abeundi (0) - 1 freq
abound (2) - 2 freq
abeun (2) - 5 freq
aboundit (2) - 1 freq
agenda (3) - 23 freq
bund (3) - 12 freq
amendit (3) - 2 freq
abeen (3) - 154 freq
bendin (3) - 15 freq
mundi (3) - 2 freq
abean (3) - 1 freq
aboun (3) - 1 freq
agrund (3) - 3 freq
around (3) - 158 freq
bends (3) - 13 freq
audi (3) - 1 freq
boundin (3) - 7 freq
abun (3) - 3 freq
berni (3) - 1 freq
bounds (3) - 11 freq
amends (3) - 3 freq
bendit (3) - 2 freq
aund (3) - 2 freq
abiud (3) - 4 freq
baunds (3) - 5 freq
abeundi (0) - 1 freq
abound (2) - 2 freq
baundy (3) - 2 freq
beand (3) - 1 freq
bound (3) - 58 freq
beande (3) - 1 freq
bendie (3) - 2 freq
bendy (3) - 3 freq
baund (3) - 21 freq
bundie (3) - 1 freq
bend (3) - 102 freq
aboundit (3) - 1 freq
bund (3) - 12 freq
abeun (3) - 5 freq
amend (4) - 3 freq
boond (4) - 9 freq
bouned (4) - 3 freq
boundit (4) - 1 freq
bondie (4) - 3 freq
bindie (4) - 1 freq
blund (4) - 1 freq
bandy (4) - 13 freq
boyndie (4) - 6 freq
band (4) - 181 freq
abudy (4) - 11 freq
SoundEx code - A153
appointments - 5 freq
abandoned - 26 freq
appointed - 8 freq
apent - 29 freq
aff-haund - 2 freq
apened - 6 freq
abandon - 12 freq
appent - 7 freq
append - 2 freq
aipened - 4 freq
appintit - 1 freq
abundance - 9 freq
appointment - 35 freq
avantage - 1 freq
appendages - 1 freq
appyntment - 5 freq
appyntit - 15 freq
appointit - 4 freq
appintment - 1 freq
abeen't - 1 freq
aventur - 3 freq
appinted - 2 freq
appened - 5 freq
appointin - 1 freq
apen't - 3 freq
appintmints - 2 freq
appintmint - 8 freq
appendage - 1 freq
appynt - 4 freq
appyntin - 1 freq
appointees - 1 freq
affinitie - 1 freq
afentimes - 1 freq
abound - 2 freq
appointing - 2 freq
appendix - 13 freq
affinity - 4 freq
affhaunditly - 3 freq
avantages - 1 freq
aventurs - 2 freq
ayebaundsergeant - 1 freq
apen-mou'd - 1 freq
affendurs - 1 freq
appointmint - 1 freq
abeundi - 1 freq
abandone - 1 freq
aipen't - 1 freq
aipent - 1 freq
avaunt - 1 freq
abyne-tarlan - 1 freq
abundant - 4 freq
abandonment - 2 freq
aventurers - 2 freq
apenit - 1 freq
appyntments - 2 freq
aboundit - 1 freq
€˜append - 1 freq
affeenity - 1 freq
avant - 1 freq
appendices - 1 freq
appynts - 1 freq
aboon't - 1 freq
abandont - 5 freq
abandonin - 2 freq
affinities - 3 freq
aboundantlie - 1 freq
avontuur - 1 freq
appoint - 2 freq
MetaPhone code - ABNT
abeen't - 1 freq
abound - 2 freq
abeundi - 1 freq
aboon't - 1 freq
ABEUNDI
Time to execute Levenshtein function - 0.190980 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.409330 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.032117 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.040590 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.000908 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.