An improved redundancy elimination algorithm for underspecified representations

Authors:
Alexander Koller;Stefan Thater
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany;Universität des Saarlandes, Saarbrücken, Germany
Venue:
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Year:
2006

Citing 9
Cited 0

The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
An algorithm for generating non-redundant quantifier scopings

EACL '91 Proceedings of the fifth conference on European chapter of the 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: hole semantics as dominance constraints

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
The LinGO Redwoods treebank motivation and preliminary applications

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
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
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
The evolution of dominance constraint solvers

Software '05 Proceedings of the Workshop on Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime.