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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
beyont (0) - 7 freq
beyon (1) - 1 freq
beyond (1) - 99 freq
meynt (2) - 4 freq
belmont (2) - 6 freq
beyonce (2) - 1 freq
peynt (2) - 1 freq
ayont (2) - 272 freq
bayonet (2) - 6 freq
beckont (2) - 1 freq
begot (2) - 1 freq
benon (2) - 1 freq
bejant (2) - 4 freq
bent (2) - 104 freq
secont (2) - 16 freq
beyl't (2) - 1 freq
behint (2) - 5 freq
begoot (2) - 2 freq
'beyond (2) - 1 freq
belong (2) - 14 freq
beylt (2) - 2 freq
anyont (2) - 1 freq
yont (2) - 14 freq
demon (3) - 22 freq
blunt (3) - 8 freq
beyont (0) - 7 freq
beyon (2) - 1 freq
bayonet (2) - 6 freq
bent (2) - 104 freq
beyond (2) - 99 freq
anyont (3) - 1 freq
begoot (3) - 2 freq
boonty (3) - 1 freq
beylt (3) - 2 freq
bount (3) - 1 freq
bunt (3) - 6 freq
buoyant (3) - 2 freq
bint (3) - 10 freq
behint (3) - 5 freq
yont (3) - 14 freq
begot (3) - 1 freq
beyonce (3) - 1 freq
peynt (3) - 1 freq
ayont (3) - 272 freq
benon (3) - 1 freq
bejant (3) - 4 freq
baint (3) - 1 freq
meynt (3) - 4 freq
beest (4) - 11 freq
kent (4) - 1809 freq
SoundEx code - B530
boomed - 8 freq
bendie - 2 freq
bendy - 3 freq
bent - 104 freq
bunnet - 111 freq
bandy - 13 freq
bend - 102 freq
bound - 57 freq
beneath - 33 freq
band - 159 freq
bind - 20 freq
bonnie-die - 1 freq
bounty - 10 freq
behind - 246 freq
beamed - 6 freq
bund - 12 freq
beyond - 99 freq
bunnet' - 2 freq
bammed - 1 freq
baund - 21 freq
boond - 9 freq
bummed - 11 freq
bonnet - 34 freq
boannet - 1 freq
bunt - 6 freq
binweed - 1 freq
beyont - 7 freq
boned - 2 freq
banned - 34 freq
bond - 16 freq
behint - 5 freq
bannit - 2 freq
baint - 1 freq
bint - 10 freq
banty - 5 freq
bunty - 12 freq
baundy - 2 freq
bondie - 3 freq
baand - 13 freq
bantie - 3 freq
bundie - 1 freq
bumed - 1 freq
bumt - 1 freq
bouned - 3 freq
boonty - 1 freq
'behind' - 1 freq
bunnit - 1 freq
behiynd - 1 freq
bayonet - 6 freq
bonnieheid - 1 freq
beand - 1 freq
binwuid - 1 freq
'beyond - 1 freq
beande - 1 freq
bennett - 6 freq
behynde - 1 freq
bonnie-ee'd - 1 freq
bount - 1 freq
buoyant - 2 freq
bannid - 1 freq
bend-o - 1 freq
boyndie - 6 freq
bennite - 1 freq
€˜band - 2 freq
bmd - 1 freq
bnto - 1 freq
byamat - 1 freq
bannet - 1 freq
bond” - 1 freq
bantu - 1 freq
bindie - 1 freq
binned - 1 freq
bunnet” - 1 freq
MetaPhone code - BYNT
beyond - 99 freq
beyont - 7 freq
bayonet - 6 freq
'beyond - 1 freq
buoyant - 2 freq
BEYONT
Time to execute Levenshtein function - 0.242159 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.370301 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.038865 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.054270 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.000800 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.