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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
berrickshire (0) - 1 freq
berkshire (3) - 4 freq
lanrikshire (4) - 2 freq
selkirkshire (4) - 1 freq
pernickitie (5) - 1 freq
boorichie (5) - 1 freq
aberdeebshire (5) - 1 freq
perthshire (5) - 14 freq
falkirkshire (5) - 1 freq
yorkshire (5) - 24 freq
aberdeenshire (5) - 40 freq
dreerieshire (5) - 4 freq
brochire (5) - 1 freq
pernicketie (5) - 2 freq
redrichie (5) - 1 freq
brokenshire (5) - 1 freq
enrichin' (6) - 1 freq
backside (6) - 26 freq
blaickie (6) - 2 freq
nervishlie (6) - 1 freq
verdicchio (6) - 1 freq
behoochie (6) - 1 freq
forfarshire (6) - 1 freq
eraichle (6) - 1 freq
ayrshire (6) - 96 freq
berrickshire (0) - 1 freq
berkshire (5) - 4 freq
lanrikshire (7) - 2 freq
aberdeenshire (8) - 40 freq
brochire (8) - 1 freq
yorkshire (8) - 24 freq
brokenshire (8) - 1 freq
dreerieshire (8) - 4 freq
selkirkshire (8) - 1 freq
aberdeebshire (8) - 1 freq
barracks (8) - 9 freq
trickster (9) - 2 freq
brochure (9) - 8 freq
barrister (9) - 1 freq
buckshee (9) - 3 freq
warricker (9) - 1 freq
bourrachie (9) - 1 freq
lanarkshire (9) - 18 freq
bricks (9) - 25 freq
werrocks (9) - 1 freq
aiberdeenshire (9) - 47 freq
brackish (9) - 1 freq
brickies (9) - 2 freq
rickshaw (9) - 1 freq
tirricks (9) - 5 freq
SoundEx code - B626
bruiser - 4 freq
braggarts - 1 freq
braggart's - 1 freq
brickwark - 1 freq
berserk - 3 freq
brochure - 8 freq
bergère - 1 freq
bergerac - 6 freq
berkshire - 4 freq
breakers - 2 freq
brekker - 2 freq
burgauer - 3 freq
bureaucrat - 1 freq
braggart - 2 freq
berserker - 1 freq
berserker's - 1 freq
berserkers - 1 freq
berserks - 1 freq
breaker - 4 freq
broker - 1 freq
barcardi - 1 freq
breezer - 5 freq
brochires - 3 freq
brochire - 1 freq
burger - 13 freq
burkart - 1 freq
'burkers' - 1 freq
burkers - 2 freq
burker - 2 freq
burgers - 11 freq
brekkers - 1 freq
boaregarde - 1 freq
'breezers' - 1 freq
breezers - 1 freq
bursaries - 1 freq
braziers - 2 freq
burghers - 2 freq
birsier - 1 freq
beaurocrats - 1 freq
bureaucracy - 6 freq
bureaucratic - 1 freq
brucker - 1 freq
berrickshire - 1 freq
brouser - 4 freq
brousers - 1 freq
barker - 1 freq
brucre - 1 freq
braegarr - 2 freq
bruisers - 1 freq
bursary - 1 freq
brokerage - 1 freq
braisert - 1 freq
brakkar - 2 freq
birker - 1 freq
brokers - 2 freq
brocher - 2 freq
brazier - 5 freq
bureaucrats - 1 freq
browser - 4 freq
burger-meat - 1 freq
brougher - 3 freq
brsquirrel - 2 freq
barrykerr - 1 freq
brookranger - 1 freq
burgerking - 1 freq
MetaPhone code - BRKXR
berkshire - 4 freq
berrickshire - 1 freq
BERRICKSHIRE
Time to execute Levenshtein function - 0.695041 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 - 1.012802 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.078568 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.044204 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.049230 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.