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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
barrowman (0) - 1 freq
harrowtn (3) - 1 freq
barroun (3) - 1 freq
barrowful (3) - 2 freq
barrowlands (3) - 2 freq
barrows (3) - 1 freq
burrowin (3) - 2 freq
bowman (3) - 4 freq
harrowin (3) - 2 freq
baurman (3) - 5 freq
barrowfu (3) - 2 freq
barrowload (3) - 1 freq
borrowin (3) - 5 freq
narrowin (3) - 5 freq
barman (3) - 25 freq
barrowafc (3) - 1 freq
barron (3) - 7 freq
norrowa (4) - 26 freq
ferryman (4) - 3 freq
cardomon (4) - 1 freq
narrowing (4) - 1 freq
brosnan (4) - 1 freq
bhrochan (4) - 1 freq
borrowed (4) - 6 freq
byreman (4) - 3 freq
barrowman (0) - 1 freq
burrowin (4) - 2 freq
borrowin (4) - 5 freq
narrowin (5) - 5 freq
barrowload (5) - 1 freq
barrowful (5) - 2 freq
barrowafc (5) - 1 freq
harrowtn (5) - 1 freq
barron (5) - 7 freq
barrowfu (5) - 2 freq
barman (5) - 25 freq
barrows (5) - 1 freq
baurman (5) - 5 freq
bowman (5) - 4 freq
barroun (5) - 1 freq
harrowin (5) - 2 freq
burrows (6) - 5 freq
barmen (6) - 1 freq
barrin (6) - 7 freq
burron (6) - 1 freq
burran (6) - 1 freq
bbrown (6) - 2 freq
barren (6) - 16 freq
browden (6) - 4 freq
brown (6) - 81 freq
SoundEx code - B655
burnin - 131 freq
breemin - 1 freq
birnin - 2 freq
brounin - 1 freq
baurman - 5 freq
burning - 13 freq
baurmin - 1 freq
bairnin - 2 freq
browning - 7 freq
brimmin - 13 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 - BRMN
breemin - 1 freq
baurman - 5 freq
baurmin - 1 freq
brimmin - 13 freq
'barman - 1 freq
barman - 25 freq
barmen - 1 freq
barrowman - 1 freq
byreman - 3 freq
brimman - 1 freq
brahmin - 2 freq
borman - 1 freq
bremen - 1 freq
brammin - 1 freq
BARROWMAN
Time to execute Levenshtein function - 0.419071 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.816458 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.071943 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.037835 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.000933 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.