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)
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)
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)
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)
Tree-Adjoining Grammars (TAG) have been used both for syntactic parsing, with sentential grammars, and for discourse parsing, with discourse grammars. But the modeling of discourse connectives (coordinate conjunctions, subordinate conjunctions , adverbs, etc.) in TAG-based formalisms for discourse differ from their modeling in sentential grammars. Because(More)