Subregular linguistics is a fairly new approach that seeks a deeper understanding of
language by combining the rigor of formal grammar with the empirical sophistication of …

Minimalist grammars have been used recently in a series of papers to explain well-known
contrasts in human sentence processing in terms of subtle structural differences. These …

We introduce s-graph grammars, a new grammar formalism for computing graph-based
semantic representations. Semantically annotated corpora which use graphs as semantic …

A key problem in semantic parsing with graph-based semantic representations is graph
parsing, ie computing all possible analyses of a given graph according to a grammar. This …

When learning grammars that map from sentences to abstract meaning representations
(AMRs), one faces the challenge that an AMR can be described in a huge number of …

We review a number of different 'algebraic'perspectives on TAG and STAG in the framework
of interpreted regular tree grammars (IRTGs). We then use this framework to derive a new …

We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs).
It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars …

Abstract The Surface Realization Shared Task involves mapping Universal Dependency
graphs to raw text, ie restoring word order and inflection from a graph of typed, directed …

We formulate a generalization of Petrov et al.(2006)'s split/merge algorithm for interpreted
regular tree grammars (Koller and Kuhlmann, 2011), which capture a large class of grammar …

We present a novel approach for generating effective referring expressions (REs). We define
a synchronous grammar formalism that relates surface strings with the sets of objects they …