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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bab (0) - 13 freq
bam (1) - 38 freq
ba (1) - 139 freq
bax (1) - 2 freq
bal (1) - 6 freq
bsb (1) - 1 freq
bac (1) - 11 freq
blab (1) - 3 freq
-ab (1) - 1 freq
baby (1) - 117 freq
bib (1) - 8 freq
bxb (1) - 1 freq
tab (1) - 6 freq
ban (1) - 48 freq
ba' (1) - 8 freq
sab (1) - 9 freq
baw (1) - 130 freq
baa (1) - 73 freq
rab (1) - 169 freq
bas (1) - 9 freq
bob (1) - 213 freq
dab (1) - 58 freq
bb (1) - 9 freq
bat (1) - 50 freq
bai (1) - 10 freq
bab (0) - 13 freq
bob (1) - 213 freq
bib (1) - 8 freq
bb (1) - 9 freq
baba (1) - 2 freq
beb (1) - 1 freq
baby (1) - 117 freq
boab (1) - 53 freq
babe (1) - 11 freq
jab (2) - 20 freq
cab (2) - 15 freq
bag (2) - 321 freq
babs (2) - 2 freq
-ab (2) - 1 freq
bap (2) - 16 freq
bar (2) - 492 freq
bak (2) - 376 freq
wab (2) - 126 freq
bah (2) - 4 freq
fab (2) - 18 freq
nab (2) - 10 freq
bae (2) - 855 freq
ebb (2) - 26 freq
bebe (2) - 3 freq
beeb (2) - 1 freq
SoundEx code - B100
bob - 213 freq
bowff - 1 freq
bobby - 45 freq
boab - 53 freq
baby - 117 freq
babe - 11 freq
babbie - 34 freq
bevie - 2 freq
boof - 3 freq
boeuf - 1 freq
beef - 79 freq
bobbie - 15 freq
bib - 8 freq
babby - 25 freq
bawbee - 23 freq
babie - 1 freq
bowf - 9 freq
boabby - 23 freq
befaw - 3 freq
beefie - 1 freq
bevvy - 18 freq
befa - 2 freq
baba - 2 freq
baffy - 3 freq
bye-bye - 1 freq
behave - 37 freq
befaa - 6 freq
bappie - 1 freq
bap - 16 freq
baff - 3 freq
bihaive - 1 freq
byfe - 1 freq
bab - 13 freq
baffie - 62 freq
beehive - 1 freq
buff - 15 freq
beef' - 1 freq
behauf - 17 freq
beeb' - 1 freq
bewvy - 2 freq
baabie - 21 freq
bubba - 1 freq
boaby - 5 freq
bafhe - 2 freq
baffe - 2 freq
bafhie - 2 freq
boob - 5 freq
bibby - 3 freq
bevy - 5 freq
bauf - 1 freq
baby' - 1 freq
booby - 9 freq
bobo - 9 freq
behaiv - 1 freq
baby-e - 1 freq
bebe - 3 freq
bevvie - 2 freq
bouff - 1 freq
behouf - 1 freq
'bib - 1 freq
beif - 2 freq
bappy - 27 freq
behufe - 1 freq
beep - 9 freq
'babe' - 1 freq
beve - 1 freq
beb - 1 freq
bawbee- - 2 freq
bapu - 14 freq
€œbapu - 1 freq
baw-bee - 1 freq
baef - 6 freq
boabie - 2 freq
boba - 2 freq
biffy - 1 freq
bev - 1 freq
baf - 1 freq
bebo - 1 freq
bhheypya - 1 freq
bhp - 1 freq
biffo - 2 freq
beeb - 1 freq
baif - 4 freq
bpub - 1 freq
bwv - 1 freq
befio - 1 freq
byf - 1 freq
bufw - 1 freq
bov - 1 freq
bovvy - 2 freq
MetaPhone code - BB
bob - 213 freq
bobby - 45 freq
boab - 53 freq
baby - 117 freq
babe - 11 freq
babbie - 34 freq
bobbie - 15 freq
bib - 8 freq
babby - 25 freq
bawbee - 23 freq
babie - 1 freq
boabby - 23 freq
baba - 2 freq
bab - 13 freq
beeb' - 1 freq
baabie - 21 freq
bubba - 1 freq
boaby - 5 freq
boob - 5 freq
bibby - 3 freq
baby' - 1 freq
booby - 9 freq
bobo - 9 freq
baby-e - 1 freq
bebe - 3 freq
'bib - 1 freq
'babe' - 1 freq
beb - 1 freq
bawbee- - 2 freq
baw-bee - 1 freq
boabie - 2 freq
boba - 2 freq
bebo - 1 freq
beeb - 1 freq
BAB
Time to execute Levenshtein function - 0.412094 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.687438 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.082110 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.037435 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.000778 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.