Regular tree grammars as a formalism for scope underspecification

Alexander Koller, Michaela Regneri, and Stefan Thater

In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-08: HLT), Columbus, Ohio, 2008.

We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel algorithm for eliminating equivalent readings and the first efficient algorithm for computing the best reading of a scope ambiguity. We also show how to derive RTGs from more traditional underspecified descriptions.

Download: Download

BibTeX Entry
@InProceedings{charts-08,
	author = {Alexander Koller and Michaela Regneri and Stefan Thater},
	title = {Regular tree grammars as a formalism for scope underspecification},
	booktitle = {Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-08: HLT)},
	year = 2008,
	address = {Columbus, Ohio}
}

Back: Publications