Skip to Main content Skip to Navigation
Conference papers

Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees

Sylvain Pogodalla 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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 (lambda-terms) of Abstract Categorial Grammars (ACGs). The latter offers a flexible tool for expliciting compositionality and semantic combination. The chosen semantic representation language here is an underspecified one. The ACG framework allows to deal both with the semantic language and the derived tree language in an equivalent way: as concrete realizations of the abstract terms. Then, in the semantic part, we can model linguistic phenomena usually considered as difficult for the derivation tree approach.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Wednesday, December 13, 2006 - 1:25:48 PM
Last modification on : Friday, February 4, 2022 - 3:31:23 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 8:10:38 PM


  • HAL Id : inria-00107768, version 1



Sylvain Pogodalla. Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees. Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+7), 2004, Vancouver, BC, Canada. pp.64-71. ⟨inria-00107768⟩



Record views


Files downloads