Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
SIGDOC '86 Proceedings of the 5th annual international conference on Systems documentation
A library of generic concepts for composing knowledge bases
Proceedings of the 1st international conference on Knowledge capture
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
An Underspecified Segmented Discourse Representation Theory (USDRT)
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Monotonic semantic interpretation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Computational Semantics in Discourse: Underspecification, Resolution, and Inference
Journal of Logic, Language and Information
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Dynamic programming for parsing and estimation of stochastic unification-based grammars
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
SenseRelate::TargetWord: a generalized framework for word sense disambiguation
ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Efficient processing of underspecified discourse representations
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
The necessity of syntactic parsing for semantic role labeling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Joint parsing and semantic role labeling
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Exploiting paraphrases and deferred sense commitment to interpret questions more reliably
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Exploiting paraphrases and deferred sense commitment to interpret questions more reliably
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
| Hi-index | 0.00 |
Text Understanding systems often commit to a single best interpretation of a sentence before analyzing subsequent text. This interpretation is chosen by resolving ambiguous alternatives to the one with the highest confidence, given the context available at the time of commitment. Subsequent text, however, may contain information that changes the confidence of alternatives. This may especially be the case with multiple redundant texts on the same topic. Ideally, systems would delay choosing among ambiguous alternatives until more text has been read. One solution is to maintain multiple candidate interpretations of each sentence until the system acquires disambiguating evidence. Unfortunately, the number of alternatives explodes quickly. In this paper, we propose a packed graphical (PG) representation that can efficiently represent a large number of alternative interpretations along with dependencies among them. We also present an algorithm for combining multiple PG representations to help resolve ambiguity and prune alternatives when the time comes to commit to a single interpretation. Our controlled experiments show that by delaying ambiguity resolution until multiple texts have been read, our prototype's accuracy is higher than when committing to interpretations sentence-by-sentence.