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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
buzzards (0) - 5 freq
buzzard (1) - 3 freq
blizzards (2) - 1 freq
bizzard (2) - 1 freq
buzzes (3) - 6 freq
buirds (3) - 10 freq
bussard (3) - 1 freq
outwards (3) - 1 freq
boards (3) - 23 freq
guards (3) - 13 freq
buzzer (3) - 8 freq
bastards (3) - 33 freq
wizards (3) - 1 freq
beards (3) - 12 freq
'blizzards (3) - 1 freq
bombards (3) - 1 freq
burds (3) - 100 freq
buzzed (3) - 1 freq
blizzard (3) - 4 freq
bizzare (3) - 1 freq
upwards (3) - 12 freq
bollards (3) - 2 freq
buzlakd (3) - 1 freq
hazards (3) - 1 freq
lizards (3) - 4 freq
buzzards (0) - 5 freq
buzzard (2) - 3 freq
bizzard (3) - 1 freq
blizzards (3) - 1 freq
bollards (5) - 2 freq
hazards (5) - 1 freq
blizzard (5) - 4 freq
lizards (5) - 4 freq
bizzare (5) - 1 freq
bazaars (5) - 1 freq
bakwards (5) - 2 freq
bernards (5) - 1 freq
bards (5) - 16 freq
buzzed (5) - 1 freq
wizzard (5) - 1 freq
burds (5) - 100 freq
buzzes (5) - 6 freq
boards (5) - 23 freq
buirds (5) - 10 freq
buzzer (5) - 8 freq
bastards (5) - 33 freq
bombards (5) - 1 freq
'blizzards (5) - 1 freq
beards (5) - 12 freq
wizards (5) - 1 freq
SoundEx code - B263
backartywise - 1 freq
bigger-that - 1 freq
backwarts - 3 freq
backward - 12 freq
backarties - 3 freq
backroad - 1 freq
backwards - 36 freq
begrudge - 2 freq
backarts - 10 freq
'backarts' - 1 freq
baukward-luikin - 1 freq
buggered - 13 freq
backyard - 1 freq
bakward - 2 freq
bakwards - 2 freq
backwart - 7 freq
box-cairt - 1 freq
'backwards - 1 freq
begrutten - 6 freq
bacardi - 8 freq
baakwardly - 1 freq
buzzard - 3 freq
buggert - 3 freq
backgairden - 1 freq
beckairts - 1 freq
buzzards - 5 freq
backarty-wise' - 1 freq
backarty-wise - 1 freq
bogart - 1 freq
backerties - 1 freq
bickered - 1 freq
'backwards' - 1 freq
backwirds - 2 freq
bjartalid - 1 freq
'backwarts' - 1 freq
bizzard - 1 freq
bickert - 3 freq
bakwarts - 1 freq
bussard - 1 freq
€˜begrutten - 1 freq
backairts - 1 freq
buggeration - 1 freq
buchart - 1 freq
backward-turnt - 1 freq
begrudged - 1 freq
begrudgin - 1 freq
baegered - 1 freq
backgarden - 1 freq
bbcradioscot - 27 freq
bbcradioulster - 13 freq
bbcradiofoyle - 1 freq
boxertoye - 1 freq
backroadbiking - 1 freq
bbcradio - 5 freq
bbcradiowales - 1 freq
bbcradiodrama - 1 freq
backward- - 1 freq
biggardenbirdwatch - 1 freq
bigredfcassidy - 1 freq
bsgcreativesig - 2 freq
bbcearth - 1 freq
MetaPhone code - BSRTS
buzzards - 5 freq
BUZZARDS
Time to execute Levenshtein function - 0.200116 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.336338 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.028014 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.036981 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.000869 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.