Sylvain Pogodalla

Learn More
We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of(More)
This paper proposes a process to build semantic representation for Tree Adjoining Grammars (TAGs) analysis. Being in the derivation tree tradition, it proposes to reconsider derivation trees as abstract terms (λ-terms) of Abstract Categorial Grammars (ACGs). The latter offers a flexible tool for expliciting composition-ality and semantic combination. The(More)
Accessibility constraints When dealing with anaphora resolution, anaphoric expressions are often considered to have access to a restricted set of discourse referents. The choice of the relevant discourse referent inside this set may depends on various kinds of information (morphosyntactic features, semantic features, salience.. .). But theories that give a(More)
We describe an application of controlled text authoring to biological experiment reports. This work is the result of a collaboration between a computational linguistics team and biologists specializing in protein production studies. We start by presenting our semantically-controlled authoring system, MDA (Multilingual Document Authoring), an expressive(More)
Cooper's storage technique for scoping in situ operators has been employed in theoretical and computational grammars of natural language (NL) for over thirty years, but has been widely viewed as ad hoc and unprincipled. Recent work by Pollard within the framework of convergent grammar (CVG) took a step in the direction of clarifying the logical status of(More)