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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bairded (0) - 4 freq
bairged (1) - 6 freq
bairbed (1) - 1 freq
bairned (1) - 3 freq
gairded (1) - 3 freq
bearded (2) - 7 freq
birled (2) - 69 freq
lairned (2) - 14 freq
bairdies (2) - 1 freq
braided (2) - 2 freq
barbed (2) - 4 freq
barged (2) - 2 freq
mairked (2) - 3 freq
bairges (2) - 1 freq
barked (2) - 9 freq
baised (2) - 3 freq
flirded (2) - 1 freq
birden (2) - 1 freq
pairked (2) - 1 freq
hirded (2) - 1 freq
cairted (2) - 5 freq
faired (2) - 2 freq
airted (2) - 31 freq
paired (2) - 1 freq
birsed (2) - 5 freq
bairded (0) - 4 freq
boorded (2) - 1 freq
boarded (2) - 5 freq
braided (2) - 2 freq
bearded (2) - 7 freq
bairbed (2) - 1 freq
bairged (2) - 6 freq
bairned (2) - 3 freq
gairded (2) - 3 freq
buiried (3) - 2 freq
birzed (3) - 5 freq
birsed (3) - 5 freq
bided (3) - 30 freq
dirded (3) - 1 freq
bairdie (3) - 5 freq
barred (3) - 15 freq
girded (3) - 1 freq
biried (3) - 3 freq
birned (3) - 1 freq
raided (3) - 4 freq
bairds (3) - 2 freq
bardet (3) - 1 freq
hirded (3) - 1 freq
barbed (3) - 4 freq
barged (3) - 2 freq
SoundEx code - B633
breathed - 20 freq
birthday - 199 freq
birthday-praisants - 1 freq
berthed - 1 freq
burthday - 9 freq
brodded - 1 freq
boarded - 5 freq
bearded - 7 freq
birthed - 3 freq
braidit - 3 freq
birthit - 3 freq
bruitit - 1 freq
burdwatcher - 1 freq
bairded - 4 freq
bordit - 1 freq
berthet - 1 freq
birthdae's - 1 freq
boorded - 1 freq
birthday-presents - 2 freq
birthday's - 1 freq
braithtakkin - 2 freq
boordit - 2 freq
breidit - 1 freq
burtit - 1 freq
birthdays - 5 freq
braeth-thick - 1 freq
birthday' - 2 freq
braided - 2 freq
berated - 1 freq
breadtht - 3 freq
bardheid - 1 freq
buirdit - 1 freq
brawtith - 1 freq
broddit - 2 freq
braid-oot - 1 freq
bird-watchin - 2 freq
breathtakin - 1 freq
beardit - 2 freq
bird-watchers - 1 freq
briadwood's - 1 freq
broth-time - 1 freq
braith-takin - 1 freq
beirdit - 1 freq
breithit - 1 freq
bardet - 1 freq
brodiedru - 11 freq
breathtaking - 2 freq
MetaPhone code - BRTT
brodded - 1 freq
boarded - 5 freq
bearded - 7 freq
braidit - 3 freq
bruitit - 1 freq
bairded - 4 freq
bordit - 1 freq
boorded - 1 freq
boordit - 2 freq
breidit - 1 freq
burtit - 1 freq
braided - 2 freq
berated - 1 freq
boortd - 1 freq
buirdit - 1 freq
broddit - 2 freq
braid-oot - 1 freq
beardit - 2 freq
beirdit - 1 freq
bardet - 1 freq
BAIRDED
Time to execute Levenshtein function - 0.194476 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.354034 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.027560 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.039453 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.001026 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.