Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Bruno Guillaume Connect in order to contact the contributor
Submitted on : Thursday, March 24, 2011 - 8:48:06 AM
Last modification on : Wednesday, November 3, 2021 - 10:46:23 AM
Long-term archiving on: : Thursday, November 8, 2012 - 12:25:32 PM


Files produced by the author(s)


  • HAL Id : inria-00579244, version 1


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⟩



Les métriques sont temporairement indisponibles