Towards an efficient redundancy elimination algorithm for underspecified representations

Alexander Koller and Stefan Thater

In Proceedings of the Fifth International Workshop on Inference in Computational Semantics (ICoS-5), Buxton, UK, 2006.

This paper proposes an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR), compute an USR which has fewer readings, but still describes at least one representative of each semantic equivalence class of the original 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. To our knowledge, it is the first redundancy elimination algorithm which maintains underspecification, rather than just enumerating non-redundant readings.

Download: Download

BibTeX Entry
@InProceedings{towards-redundancy,
	author = {Alexander Koller and Stefan Thater},
	title = {Towards an efficient redundancy elimination algorithm for underspecified representations},
	booktitle = {Proceedings of the Fifth International Workshop on Inference in Computational Semantics (ICoS-5)},
	year = 2006,
	address = {Buxton, UK}
}

Back: Publications