The logic of typed feature structures
The logic of typed feature structures
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
On using a parallel graph rewriting formalism in generation
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Semantic composition with (robust) minimal recursion semantics
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Semantic normalisation: a framework and an experiment
IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
| Hi-index | 0.00 |
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.