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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
burma (0) - 5 freq
burra (1) - 62 freq
burka (1) - 1 freq
karma (2) - 5 freq
burial (2) - 12 freq
buena (2) - 1 freq
barra (2) - 27 freq
burds (2) - 98 freq
burkha (2) - 1 freq
barmy (2) - 2 freq
burie (2) - 4 freq
burd (2) - 91 freq
burns (2) - 359 freq
burst (2) - 178 freq
furra (2) - 42 freq
birra (2) - 9 freq
borra (2) - 2 freq
furm (2) - 20 freq
bra (2) - 31 freq
bums (2) - 8 freq
cura (2) - 1 freq
puma (2) - 2 freq
barman (2) - 25 freq
burras (2) - 3 freq
borman (2) - 1 freq
burma (0) - 5 freq
burka (2) - 1 freq
barmy (2) - 2 freq
burra (2) - 62 freq
burel (3) - 1 freq
burly (3) - 5 freq
burny (3) - 1 freq
barca (3) - 1 freq
burde (3) - 1 freq
burg (3) - 1 freq
burrae (3) - 1 freq
bury (3) - 24 freq
burt (3) - 2 freq
burro (3) - 1 freq
burn (3) - 452 freq
wurm (3) - 1 freq
bum (3) - 43 freq
breme (3) - 1 freq
borna (3) - 1 freq
burl (3) - 6 freq
burke (3) - 13 freq
bruim (3) - 4 freq
brim (3) - 17 freq
brom (3) - 1 freq
bream (3) - 2 freq
SoundEx code - B650
burn - 452 freq
broon - 479 freq
bairn - 785 freq
barren - 15 freq
born - 324 freq
bairnie - 70 freq
bearin - 28 freq
boarn - 66 freq
brain - 151 freq
broun - 154 freq
burnie - 16 freq
brown - 81 freq
birn - 17 freq
buirn - 2 freq
barn - 68 freq
broonie - 44 freq
broonie' - 2 freq
brainy - 16 freq
brim - 17 freq
bruin - 1 freq
bairn' - 4 freq
broom - 18 freq
barmie - 1 freq
bawruim - 2 freq
burma - 5 freq
bawroom - 1 freq
broone - 1 freq
browne - 9 freq
boren - 1 freq
borin - 46 freq
brin - 3 freq
'burn' - 3 freq
barney - 25 freq
burron - 1 freq
brine - 8 freq
burran - 1 freq
brian - 581 freq
borneo - 3 freq
breem - 8 freq
buryin - 6 freq
'broun - 1 freq
byre-en - 2 freq
barrin - 7 freq
borne - 13 freq
bern - 10 freq
burraein - 1 freq
bruim - 4 freq
beirin - 4 freq
'brian - 1 freq
brenn - 2 freq
boaren - 1 freq
bayren - 1 freq
borrin - 1 freq
bairen - 1 freq
buryin' - 1 freq
baron - 4 freq
brewin - 7 freq
biryani' - 1 freq
bran - 11 freq
barny - 3 freq
bren - 2 freq
bar-room - 2 freq
bryan - 17 freq
burrowin - 2 freq
brownie - 10 freq
bron - 1 freq
barony - 4 freq
biryani - 1 freq
barnie - 1 freq
broona - 1 freq
brahan - 3 freq
broon' - 2 freq
bahrain - 1 freq
brenna - 14 freq
braen - 1 freq
burny - 1 freq
bairnw' - 1 freq
berween - 1 freq
borrowin - 5 freq
briney - 1 freq
birian - 1 freq
bream - 2 freq
bearin' - 1 freq
breenie - 1 freq
birrin - 4 freq
bærn - 2 freq
beeryin - 1 freq
brounie - 4 freq
barmy - 2 freq
berne - 1 freq
brünnie - 3 freq
bryni - 1 freq
breme - 1 freq
branie - 1 freq
barin - 4 freq
barroun - 1 freq
baroune - 1 freq
breemy - 1 freq
barron - 7 freq
€™byrne - 1 freq
borraein - 5 freq
bruno - 2 freq
brummie - 1 freq
bairín - 1 freq
byrne - 6 freq
byron - 9 freq
burrian - 1 freq
boran - 2 freq
bairney - 1 freq
bram - 1 freq
€˜bran - 1 freq
baarn - 1 freq
€˜born - 1 freq
broun- - 1 freq
bourne - 1 freq
€˜bairn - 1 freq
bernie - 2 freq
brönnie - 1 freq
€˜broun - 1 freq
bayern - 9 freq
brawny - 1 freq
beerana - 1 freq
broony - 3 freq
bbrown - 2 freq
brom - 1 freq
‘brian - 1 freq
berni - 1 freq
brooooon - 1 freq
brianma - 1 freq
'bairn - 1 freq
'bairn' - 1 freq
'burn - 1 freq
broom' - 3 freq
burren - 1 freq
borna - 1 freq
'born - 1 freq
born' - 1 freq
brianhu - 1 freq
briny - 1 freq
MetaPhone code - BRM
brim - 17 freq
broom - 18 freq
barmie - 1 freq
bawruim - 2 freq
burma - 5 freq
bawroom - 1 freq
breem - 8 freq
bruim - 4 freq
bream - 2 freq
barmy - 2 freq
breme - 1 freq
breemy - 1 freq
brummie - 1 freq
bram - 1 freq
brom - 1 freq
broom' - 3 freq
brigham - 1 freq
BURMA
Time to execute Levenshtein function - 0.188995 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.370626 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.028620 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.037205 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.000834 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.