Efficient solving and exploration of scope ambiguities

Authors:
Alexander Koller;Stefan Thater
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Year:
2005

Citing 7
Cited 3

The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
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
On underspecified processing of dynamic semantics

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
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
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
The Parallel Grammar project

COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15

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 processing of underspecified discourse representations

HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the currently most efficient solver for scope underspecification; it also converts between different underspecification formalisms and counts readings. Our tool makes the practical use of large-scale grammars with (underspecified) semantic output more feasible, and can be used in grammar debugging.