A logic of semantic representations for shallow parsing

Authors:
Alexander Koller;Alex Lascarides
Affiliations:
Saarland University, Saarbrücken, Germany;University of Edinburgh, Edinburgh, UK
Venue:
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Year:
2009

Citing 6
Cited 1

The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Wide-coverage semantic representations from a CCG parser

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Constraint-based RMRS construction from shallow grammars

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
The second release of the RASP system

COLING-ACL '06 Proceedings of the COLING/ACL on Interactive presentation sessions
Semantic composition with (robust) minimal recursion semantics

DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing

Slacker semantics: why superficiality, dependency and avoidance of commitment can be the right way to go

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here, we provide a model theory for a semantic formalism that is designed for this, namely Robust Minimal Recursion Semantics (rmrs). We show that rmrs supports a notion of entailment that allows it to form the basis for comparing the semantic output of different parses of varying depth.