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 sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to brussels in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
brussels (0) - 24 freq
'brussels (1) - 1 freq
brussell (1) - 1 freq
brussels' (1) - 3 freq
brissels (1) - 1 freq
bruisers (2) - 1 freq
busses (2) - 18 freq
russell (2) - 37 freq
brushes (2) - 15 freq
brusshes (2) - 1 freq
bushels (2) - 1 freq
russelt (2) - 1 freq
bruises (2) - 13 freq
russel (2) - 3 freq
mussels (2) - 5 freq
bussell (2) - 1 freq
tassels (3) - 1 freq
yoursels (3) - 14 freq
bruces (3) - 13 freq
irsels (3) - 1 freq
trustees (3) - 1 freq
grasses (3) - 8 freq
crushes (3) - 1 freq
bruised (3) - 16 freq
possels (3) - 8 freq
brussels (0) - 24 freq
brissels (1) - 1 freq
'brussels (2) - 1 freq
brussell (2) - 1 freq
brussels' (2) - 3 freq
brusshes (3) - 1 freq
bussell (4) - 1 freq
russel (4) - 3 freq
bruises (4) - 13 freq
brissills (4) - 1 freq
birsels (4) - 1 freq
mussels (4) - 5 freq
russelt (4) - 1 freq
busses (4) - 18 freq
bruisers (4) - 1 freq
russell (4) - 37 freq
bushels (4) - 1 freq
brushes (4) - 15 freq
dresses (5) - 18 freq
bosses (5) - 9 freq
bresslaw (5) - 1 freq
bristles (5) - 6 freq
brose's (5) - 1 freq
ransels (5) - 1 freq
brusts (5) - 2 freq
SoundEx code - B624
birsled - 3 freq
birslin - 6 freq
birslet - 1 freq
braikley - 1 freq
bracelet - 8 freq
birselt - 4 freq
breeshle - 3 freq
brussels - 24 freq
brickle - 1 freq
brazils - 1 freq
birsulen - 1 freq
brazil - 11 freq
bruckle - 15 freq
barclays - 1 freq
burglars - 2 freq
breeshlin - 3 freq
broccoli - 2 freq
brazilian - 1 freq
'brazilian' - 1 freq
barcelona - 10 freq
burgled - 2 freq
burglaries - 2 freq
brussell - 1 freq
beer-swiller - 1 freq
bricklayers - 1 freq
barclay - 3 freq
'barcelona - 1 freq
brussels' - 3 freq
'brussels - 1 freq
breeshled - 10 freq
brukkilnes - 1 freq
brukkil - 1 freq
bruckalaetion - 1 freq
brusquely - 2 freq
bresslaw - 1 freq
birsels - 1 freq
brucella - 1 freq
brooklyn - 2 freq
brooklyn's - 1 freq
braesslet - 1 freq
brouselt - 1 freq
bricklayin - 1 freq
birssled - 4 freq
bracelets - 3 freq
berkeley - 3 freq
burglar's - 1 freq
breishilt - 1 freq
breasley - 1 freq
breasley's - 2 freq
barce-lona - 1 freq
barcelona-airtit - 1 freq
bryceland - 1 freq
bracklach's - 1 freq
burglar - 3 freq
bruckleness - 1 freq
breek-legs - 1 freq
birsslin - 4 freq
birsslit - 1 freq
briskly - 3 freq
birsle - 1 freq
brookliners - 1 freq
burglers - 1 freq
burgle - 1 freq
burglary - 1 freq
breslin - 1 freq
birssle - 2 freq
birsilt - 2 freq
breeshlit - 1 freq
brickelly - 1 freq
brocklebankfash - 1 freq
barcelone - 1 freq
brasilia - 1 freq
barclaypeter - 1 freq
bruceleunson - 13 freq
barklandcroft - 2 freq
birseland - 7 freq
brissels - 1 freq
brissills - 1 freq
brocklebank - 1 freq
brazillian - 1 freq
brockelbank - 1 freq
MetaPhone code - BRSLS
brussels - 24 freq
brazils - 1 freq
brussels' - 3 freq
'brussels - 1 freq
birsels - 1 freq
breasley's - 2 freq
brissels - 1 freq
brissills - 1 freq
BRUSSELS
Time to execute Levenshtein function - 0.207698 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.375359 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.027477 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.047672 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.001118 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.