Computing weakest readings

Alexander Koller and Stefan Thater

In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL), Uppsala, 2010.

We present an efficient algorithm for computing the weakest readings of semantically ambiguous sentences. A corpus-based evaluation with a large-scale grammar shows that our algorithm reduces over 80\% of sentences to one or two readings, in negligible runtime, and thus makes it possible to work with semantic representations derived by deep large-scale grammars.

Download: Download

BibTeX Entry
@InProceedings{weakest-readings,
	author = {Alexander Koller and Stefan Thater},
	title = {Computing weakest readings},
	year = {2010},
	address = {Uppsala},
	booktitle = {Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL)}
}

Back: Publications