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 …

We present a tree rewriting system that aims at formalizing the composition of syntactic
templates in Role and Reference Grammar, a linguistic grammar developed mainly for …

Several authors have pointed out that the correspondence between LTAG derivation trees
and dependency structures is not as direct as it may seem at first glance, and various …

Diese Arbeit untersucht das Verhältnis zwischen Syntaxmodell und lexikalischen
Valenzeigenschaften anhand der Familie der Baumadjunktionsgrammatiken (TAG) und …

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 …

In this paper, we explore different ways to account for the peculiarities of depictive
secondary predication in English, which we think can be characterized as longdistance …

Abstract This paper introduces Linear Context‐Free Rewriting Systems, a mildly context‐
sensitive grammar formalism that displays a range of interesting formal properties and that …

Automatic syntactic analysis of natural language is one of the fundamental problems in
natural language processing. Dependency parses (directed trees in which edges represent …

3. The relation dominates is asymmetric: thus, e< v1, v2>≠ e< v2, v1>(since now there is an
order between v1 and v2), and the edge is sometimes called an arc (in other words, edges …

The development of frameworks that allow to state grammars for natural languages in a
mathematically precise way is a core task of the field of computational linguistics. The same …