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.
Type de document :
Communication dans un congrès
Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms - TAG+7, 2004, Vancouver, BC, Canada, pp.64-71, 2004
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00107768
Contributeur : Publications Loria <>
Soumis le : mercredi 13 décembre 2006 - 13:25:48
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : mardi 6 avril 2010 - 20:10:38

Identifiants

  • HAL Id : inria-00107768, version 1

Collections

Citation

Sylvain Pogodalla. Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees. Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms - TAG+7, 2004, Vancouver, BC, Canada, pp.64-71, 2004. 〈inria-00107768〉

Partager

Métriques

Consultations de la notice

301

Téléchargements de fichiers

63