Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees

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.
Fichier principal
Vignette du fichier
A04-R-058.pdf (118.59 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00107768 , version 1 (13-12-2006)

Identifiers

  • HAL Id : inria-00107768 , version 1

Cite

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⟩
264 View
135 Download

Share

Gmail Facebook X LinkedIn More