An improved redundancy elimination algorithm for underspecified descriptions

Alexander Koller and Stefan Thater

In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING/ACL), Sydney, 2006.

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.

Download: Download

BibTeX Entry
@InProceedings{improved-redundancy,
	author = {Alexander Koller and Stefan Thater},
	title = {An improved redundancy elimination algorithm for underspecified descriptions},
	booktitle = {Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING/ACL)},
	year = 2006,
	address = {Sydney}
}

Back: Publications