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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
burnan (0) - 7 freq
burnawn (1) - 1 freq
burnin (1) - 127 freq
burran (1) - 1 freq
turnan (1) - 20 freq
murnan (1) - 2 freq
burnen (1) - 1 freq
baurman (2) - 5 freq
burstan (2) - 1 freq
bryan (2) - 17 freq
turban (2) - 4 freq
burner (2) - 3 freq
wurna (2) - 2 freq
burnt (2) - 88 freq
hurtan (2) - 1 freq
buena (2) - 1 freq
duran (2) - 3 freq
bustan (2) - 1 freq
hurlan (2) - 4 freq
birnam (2) - 1 freq
burlin (2) - 8 freq
burren (2) - 1 freq
burnins (2) - 1 freq
burnsian (2) - 2 freq
jurnay (2) - 6 freq
burnan (0) - 7 freq
burnen (1) - 1 freq
burnin (1) - 127 freq
murnan (2) - 2 freq
birnin (2) - 2 freq
burneen (2) - 2 freq
turnan (2) - 20 freq
burnawn (2) - 1 freq
burran (2) - 1 freq
bernam (3) - 1 freq
burnit (3) - 1 freq
burden (3) - 24 freq
borna (3) - 1 freq
bannan (3) - 1 freq
burnes (3) - 2 freq
burpin (3) - 1 freq
mornan (3) - 1 freq
burned (3) - 31 freq
dornan (3) - 2 freq
boran (3) - 2 freq
turnin (3) - 316 freq
burnton (3) - 2 freq
bursen (3) - 6 freq
bairnin (3) - 2 freq
brenn (3) - 2 freq
SoundEx code - B655
burnin - 127 freq
breemin - 1 freq
birnin - 2 freq
brounin - 1 freq
baurman - 5 freq
burning - 12 freq
baurmin - 1 freq
bairnin - 2 freq
browning - 7 freq
brimmin - 12 freq
brennin - 2 freq
brimming - 2 freq
burrnen - 1 freq
burnen - 1 freq
'barman - 1 freq
burnin' - 4 freq
baurman's - 1 freq
barman - 25 freq
brining - 1 freq
birmingham - 10 freq
barmen - 1 freq
barneyin - 1 freq
burnins - 1 freq
broonin - 2 freq
burnan - 7 freq
barman's - 1 freq
'brennan - 1 freq
brennan - 15 freq
brennan-family - 1 freq
barrowman - 1 freq
burneen - 2 freq
brainin - 1 freq
byreman - 3 freq
brennynge - 1 freq
brimman - 1 freq
brunnens - 1 freq
brunnen - 1 freq
birnam - 1 freq
bernam - 1 freq
birminghame - 1 freq
bryning - 1 freq
brahmin - 2 freq
brunnin - 1 freq
byrnyngis - 1 freq
byrnand - 1 freq
birnand - 2 freq
burnawn - 1 freq
brawment - 1 freq
€œburnin - 1 freq
borman - 1 freq
bournemouth - 3 freq
bremen - 1 freq
bromance - 1 freq
bearmanshannon - 1 freq
burnham - 4 freq
brammin - 1 freq
brunoam - 1 freq
MetaPhone code - BRNN
burnin - 127 freq
birnin - 2 freq
brounin - 1 freq
bairnin - 2 freq
brennin - 2 freq
burrnen - 1 freq
burnen - 1 freq
burnin' - 4 freq
broonin - 2 freq
burnan - 7 freq
'brennan - 1 freq
brennan - 15 freq
burneen - 2 freq
brainin - 1 freq
brunnen - 1 freq
brunnin - 1 freq
burnawn - 1 freq
€œburnin - 1 freq
BURNAN
Time to execute Levenshtein function - 0.224869 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.429299 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.029939 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.051678 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.001032 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.