Formal and functional theories of language seem disparate, because formal theories answer
the question of what a language is, while functional theories answer the question of what …

This book is about one of the most intriguing features of human communication systems: the
fact that words that go together in meaning can occur arbitrarily far away from each other. In …

Memory limitations are known to constrain language comprehension and production, and
have been argued to account for crosslinguistic word order regularities. However, a …

We investigate the ability of transformer models to approximate the CKY algorithm, using
them to directly predict a sentence's parse and thus avoid the CKY algorithm's cubic …

We introduce a constraint-based procedure for inferring a Minimalist Grammar (MG) that falls
within the “Logic Grammar” framework. The procedure, implemented as a working computer …

We introduce a method for unsupervised parsing that relies on bootstrapping classifiers to
identify if a node dominates a specific span in a sentence. There are two types of classifiers …

The problem of identifying a probabilistic context free grammar has two aspects: the first is
determining the grammar's topology (the rules of the grammar) and the second is estimating …

We investigate how to use pretrained static word embeddings to deliver improved estimates
of bilexical co-occurrence probabilities: conditional probabilities of one word given a single …

We extend a recent consistent strong learning algorithm for a subclass of probabilistic
context-free grammars in Chomsky normal form,(Clark and Fijalkow, 2020) to a much larger …

This paper presents an algorithm for strong learning of probabilistic multiple context free
grammars from a positive sample of strings generated by the grammars. The algorithm is …