We introduce a novel chart-based algorithm for span-based parsing of discontinuous
constituency trees of block degree two, including ill-nested structures. In particular, we show …

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 …

The structure of a sentence can be represented as a network where vertices are words and
edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have …

Syntactic representations based on word-to-word dependencies have a long-standing
tradition in descriptive linguistics, and receive considerable interest in many applications …

The earliest models for discontinuous constituency parsers used mildly context-sensitive
grammars, but the fashion has changed in recent years to grammar-less transition-based …

In syntactic dependency trees, when arcs are drawn from syntactic heads to dependents,
they rarely cross. Constraints on these crossing dependencies are critical for determining …

I explore the hypothesis that the universal properties of human languages can be explained
in terms of efficient communication given fixed human information processing constraints. I …

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 …

We introduce gap inheritance, a new structural property on trees, which provides a way to
quantify the degree to which intervals of descendants can be nested. Based on this property …

Head splitting techniques have been successfully exploited to improve the asymptotic
runtime of parsing algorithms for projective dependency trees, under the arc-factored model …