Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2010 | ACL | large-scale grammar,negligible runtime,semantically ambiguous sentence,semantic representation,corpus-based evaluation,deep large-scale grammar,weakest reading,efficient algorithm,computing weakest reading |
Field | DocType | Volume |
Rule-based machine translation,Computer science,Grammar,Artificial intelligence,Natural language processing | Conference | P10-1 |
Citations | PageRank | References |
5 | 0.60 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Koller | 1 | 438 | 35.50 |
| Stefan Thater | 2 | 756 | 38.54 |