| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Modular Graph Rewriting to Compute Semantics
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.
Keywords :
graph rewriting
semantics
Cited literature [16 references]
https://hal.inria.fr/inria-00579244
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
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
File
iwcs.pdf
Files produced by the author(s)