Login
Computer Science @ Rochester
Friday, April 01, 2011
3:30 PM
CSB 703
SKIL
University of Rochester
Computing Weakest Readings
We’ll be discussing Koller & Thater's ACL 2010 paper “Computing Weakest Readings”:
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.