A constraint driven metagrammar

Joseph Le Roux 1 Benoît Crabbé 2 Yannick Parmentier 3
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 LANGUE ET DIALOGUE - Human-machine dialogue with a significant language component
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present an operational framework allowing to express a large scale Tree Adjoining Grammar (TAG) by using higher level operational constraints on tree descriptions. These constraints first meant to guarantee the well formedness of the grammatical units may also be viewed as a way to put model theoretic syntax at work through an efficient offline grammatical compilation process. Our strategy preserves TAG formal properties, hence ensures a reasonable processing efficiency.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00083550
Contributor : Yannick Parmentier <>
Submitted on : Monday, July 3, 2006 - 5:06:51 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Long-term archiving on : Monday, April 5, 2010 - 11:41:51 PM

Identifiers

  • HAL Id : inria-00083550, version 1

Collections

Citation

Joseph Le Roux, Benoît Crabbé, Yannick Parmentier. A constraint driven metagrammar. The Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+8), Jul 2006, Sydney, Australia. pp.9-16. ⟨inria-00083550⟩

Share

Metrics

Record views

298

Files downloads

248