Bridging the gap between underspecification formalisms: hole semantics as dominance constraints

Authors:
Alexander Koller;Joachim Niehren;Stefan Thater
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Year:
2003

Citing 3
Cited 6

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
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

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
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Generating quantifiers and negation to explain homework testing

IUNLPBEA '10 Proceedings of the NAACL HLT 2010 Fifth Workshop on Innovative Use of NLP for Building Educational Applications
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 define a back-and-forth translation between Hole Semantics and dominance constraints, two formalisms used in underspecified semantics. There are fundamental differences between the two, but we show that they disappear on practically useful descriptions. Our encoding bridges a gap between two underspecification formalisms, and speeds up the processing of Hole Semantics.