Paper: Reversibility In A Constraint And Type Based Logic Grammar: Application To Secondary Predication

ACL ID W91-0102
Title Reversibility In A Constraint And Type Based Logic Grammar: Application To Secondary Predication
Venue Workshop On Reversible Grammar In Natural Language Processing
Session
Year 1991
Authors
  • Palmira Marrafa (University of Lisbon, Lisbon Portugal)
  • Patrick Saint-Dizier (Institute of Research in Informatics Toulouse, Toulouse France; University of Toulouse 3, Toulouse France)

In this document, we present a formalism for natural language processing which associates type construction principles to constraint logic programming. We show that it provides more uniform, expressive and efficient tools for parsing and generating language. Next, we present two abstract machines which enable us to design, in a symmetric way, a parser and a generator from that formalism. This abstract machinery is then exemplified by a detailed study of secondary predication within the framework of a principled- based description of language: Government and Binding theory.