Deep semantics for dependency structures

Authors:
Paul Bédaride;Claire Gardent
Affiliations:
Universität Suttgart;CNRS/LORIA
Venue:
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Year:
2011

Citing 7
Cited 0

Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

Handbook of graph grammars and computing by graph transformation
Semantic construction in feature-based TAG

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Accurate unlexicalized parsing

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Wide-coverage semantic representations from a CCG parser

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Flexible semantic composition with DUDES

IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
Benchmarking for syntax-based sentential inference

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although dependency parsers have become increasingly popular, little work has been done on how to associate dependency structures with deep semantic representations. In this paper, we propose a semantic calculus for dependency structures which can be used to construct deep semantic representations from joint syntactic and semantic dependency structures similar to those used in the ConLL 2008 Shared Task.