This paper presents the first efficient implementation of a weighted deductive CYK parser for
Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of …

Statistical parsers are e ective but are typically limited to producing projective dependencies
or constituents. On the other hand, linguisti-cally rich parsers recognize non-local relations …

Abstract Linear Context-Free Rewriting System (LCFRS) is an extension of Context-Free
Grammar (CFG) in which a non-terminal can dominate more than a single continuous span …

We present a discontinuous variant of treesubstitution grammar (tsg) based on Linear
Context-Free Rewriting Systems. We use this formalism to instantiate a Data-Oriented …

Previous work on treebank parsing with discontinuous constituents using Linear Context-
Free Rewriting systems (LCFRS) has been limited to sentences of up to 30 words, for …

In this paper, we address the problem of how to use semantics to improve syntactic parsing,
by using a hybrid reranking method: a k-best list generated by a symbolic parser is reranked …

We provide a theoretical argument that a common form of projective transition-based
dependency parsing is less powerful than constituent parsing using latent variables. The …

Two characterisation results of multiple context-free grammars and their application to parsing
Page 1 Two characterisation results of multiple context-free grammars and their application to …

A distinguishing feature of humankind is the capacity to use symbolic language for
communication and representation of information. Computers, which are meant to process …

Natural language processing (NLP) systems, until recently, relied heavily on sophisticated
representations and carefully designed feature sets. Now with the rise of deep learning, for …