Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

Authors:
Ruth Fuchss;Alexander Koller;Joachim Niehren;Stefan Thater
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;INRIA Futurs, Lille, France;Saarland University, Saarbrücken, Germany
Venue:
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Year:
2004

Citing 8
Cited 6

LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Monotonic semantic interpretation

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A new algorithm for normal dominance constraints

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
The LinGO Redwoods treebank motivation and preliminary applications

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
An algebra for semantic construction in constraint-based grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Bridging the gap between underspecification formalisms: minimal recursion semantics as dominance constraints

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1

An improved redundancy elimination algorithm for underspecified representations

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Deep linguistic processing for spoken dialogue systems

DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Semantic composition with (robust) minimal recursion semantics

DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
An efficient enumeration algorithm for canonical form underspecified semantic representations

FG'09 Proceedings of the 14th international conference on Formal grammar
Parser evaluation using elementary dependency matching

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Expanding the range of tractable scope-underspecified semantic representations

SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions on the outputs of the English Resource Grammar (ERG) on the Redwoods corpus. The main assumption of the translation---that all relevant underspecified descriptions are nets---is validated for a large majority of cases; all non-nets computed by the ERG seem to be systematically incomplete.