Modular Graph Rewriting to Compute Semantics

Guillaume Bonfante 1 Bruno Guillaume 2 Mathieu Morey 2 Guy Perrier 2
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 SEMAGRAMME - Semantic Analysis of Natural Language
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : Taking an asynchronous perspective on the syntax-semantics interface, we propose to use modular graph rewriting systems as the model of computation. We formally define them and demonstrate their use with a set of modules which produce underspecified semantic representations from a syntactic dependency graph. We experimentally validate this approach on a set of sentences. The results open the way for the production of underspecified semantic dependency structures from corpora annotated with syntactic dependencies and, more generally, for a broader use of modular rewriting systems for computational linguistics.
Type de document :
Communication dans un congrès
Johan Bos and Stephen Pulman. 9th International Conference on Computational Semantics - IWCS 2011, Jan 2011, Oxford, United Kingdom. pp.65--74, 2011
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-00579244
Contributeur : Bruno Guillaume <>
Soumis le : jeudi 24 mars 2011 - 08:48:06
Dernière modification le : jeudi 11 janvier 2018 - 06:23:32
Document(s) archivé(s) le : jeudi 8 novembre 2012 - 12:25:32

Fichier

iwcs.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00579244, version 1

Citation

Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier. Modular Graph Rewriting to Compute Semantics. Johan Bos and Stephen Pulman. 9th International Conference on Computational Semantics - IWCS 2011, Jan 2011, Oxford, United Kingdom. pp.65--74, 2011. 〈inria-00579244〉

Partager

Métriques

Consultations de la notice

386

Téléchargements de fichiers

188