Modular Graph Rewriting to Compute Semantics - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Modular Graph Rewriting to Compute Semantics

(1) , (2) , (2) , (2)
1
2
Bruno Guillaume
Mathieu Morey
Guy Perrier
  • Function : Author
  • PersonId : 8101
  • IdHAL : guy-perrier

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.
Fichier principal
Vignette du fichier
iwcs.pdf (201.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00579244 , version 1 (24-03-2011)

Identifiers

  • HAL Id : inria-00579244 , version 1

Cite

Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier. Modular Graph Rewriting to Compute Semantics. 9th International Conference on Computational Semantics - IWCS 2011, Jan 2011, Oxford, United Kingdom. pp.65--74. ⟨inria-00579244⟩
219 View
138 Download

Share

Gmail Facebook Twitter LinkedIn More