Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ACL
2010

favoriteEmaildiscussreport

138views Computational Linguistics» more ACL 2010»

Computing Weakest Readings

13 years 2 months ago

Computing Weakest Readings

Download www.aclweb.org

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.

Alexander Koller, Stefan Thater

Real-time Traffic

ACL 2010 | Ambiguous Sentences | Computational Linguistics | Deep Large-scale Grammars | Large-scale Grammars |

claim paper

Related Content

» The weakest failure detector for solving kset agreement

» Quantum weakest preconditions

» Parallel Assignments in Software Model Checking

» ENFORCe A System for Ensuring Formal Correctness of Highlevel Programs

» Local Computations in Graphs The Case of Cellular Edge Local Computations

» Staged Reads Mitigating the impact of DRAM writes on DRAM reads

» Computing Weakest Strategies for Safety Games of Imperfect Information

» Computing Strongest Necessary and Weakest Sufficient Conditions of FirstOrder Formulas

» The weakest failure detectors to solve certain fundamental problems in distributed computi...

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	ACL
Authors	Alexander Koller, Stefan Thater

Comments (0)