Probabilistic tree-edit models with structured latent variables for textual entailment and question answering

Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 2, Issue , 2010, Pages 1164-1172

  Wang, Mengqiu ^a   Manning, Christopher D ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE METRICS; LATENT VARIABLE; LINGUISTIC FEATURES; NATURAL LANGUAGE PROCESSING; PARSE TREES; PROBABILISTIC MODELS; QUESTION ANSWERING; SEMANTIC RELATEDNESS; TEXTUAL ENTAILMENT;

ALIGNMENT; COMPUTATIONAL LINGUISTICS; PLANT EXTRACTS; SEMANTICS; TEXT PROCESSING;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 80053434997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. Bernard, M., L. Boyer, A. Habrard, and M. Sebban. 2008. Learning probabilistic models of tree edit distance. Pattern Recognition, 41(8):2611-2629.
2. Bille, P. 2005. A survey on tree edit distance and related problems. Theoretical Computer Science, 337(1-3):217-239. (Pubitemid 40644674)
3. Blunsom, P., T. Cohn, and M. Osborne. 2008. A discriminative latent variable model for statistical machine translation. In Proceedings of ACL-HLT.
4. Chang, Ming-Wei, Dan Goldwasser, Dan Roth, and Vivek Srikumar. 2010. Discriminative learning over constrained latent representations. In Proceedings of NAACL-HLT.
5. Clark, S. and J. R. Curran. 2004. Parsing the wsj using ccg and log-linear models. In Proceedings of ACL.
6. Cui, Hang, Renxu Sun, Keya Li, Min-Yen Kan, and Tat-Seng Chua. 2005. Question answering passage retrieval using dependency relations. In Proceedings of SIGIR.
7. Dagan, I., O. Glickman, and B. Magnini. 2006. The pascal recognising textual entailment challenge. Machine Learning Challenges, LNCS, 3944:177- 190. (Pubitemid 44029923)
8. Das, Dipanjan and Noah A. Smith. 2009. Paraphrase identification as probabilistic quasi-synchronous recognition. In Proceedings of ACL-IJCNLP.
9. de Marneffe, M.-C., B. MacCartney, T. Grenager, D. Cer, A. Rafferty, and C. D. Manning. 2006. Learning to distinguish valid textual entailments. In Proceedings of the second PASCAL Challenges Workshop on RTE.
10. de Salvo Braz, R., R. Girju, V. Punyakanok, D. Roth, and M. Sammons. 2005. An inference model for semantic entailment and question-answering. In Proceedings of AAAI.
11. Finkel, J. R., T. Grenager, and C. D. Manning. 2005. Incorporating non-local information into information extraction systems by gibbs sampling. In Proceedings of ACL.
12. Finkel, J. R., C. D. Manning, and A. Y. Ng. 2006. Solving the problem of cascading errors: Approximate bayesian inference for linguistic annotation pipelines. In Proceedings of EMNLP.
13. Haghighi, A., A. Y. Ng, and C. D. Manning. 2005. Robust textual inference via graph matching. In Proceedings of EMNLP.
14. Harmeling, S. 2007. An extensible probabilistic transformation-based approach to the third recognizing textual entailment challenge. In Proceedings of ACL PASCAL Workshop on Textual Entailment and Paraphrasing.
15. Heilman, M. and N. A. Smith. 2010. Tree edit models for recognizing textual entailments, paraphrases, and answers to questions. In Proceedings of NAACL-HLT.
16. Jijkoun, V. and M. de Rijke. 2005a. Recognizing textual entailment: Is word similarity enough?. In Machine Learning Challenge Workshop, volume 3944 of LNCS, pages 449-460. Springer. (Pubitemid 44029938)
17. Jijkoun, V. and M. de Rijke. 2005b. Recognizing textual entailment using lexical similarity. In Proceedings of the PASCAL Challenges Workshop on RTE.
18. Klein, P. N. 1989. Computing the edit-distance between unrooted ordered trees. In Proceedings of European Symposium on Algorithms.
19. Kouylekov, M. and B. Magnini. 2006. Tree edit distance for recognizing textual entailment: Estimating the cost of insertion. In Proceedings of the second PASCAL Challenges Workshop on RTE.
20. Lafferty, J., A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML.
21. MacCartney, Bill and Christopher D. Manning. 2007. Natural logic for textual inference. In Proceedings of Workshop on Textual Entailment and Paraphrasing at ACL 2007.
22. MacCartney, B. and C. D. Manning. 2008. Modeling semantic containment and exclusion in natural language inference. In Proceedings of COLING.
23. MacCartney, B., T. Grenager, M.-C. de Marneffe, D. Cer, and C. D. Manning. 2006. Learning to recognize features of valid textual entailments. In Proceedings of HLT-NAACL.
24. MacCartney, B., M. Galley, and C. D. Manning. 2008. A phrase-based alignment model for natural language inference. In Proceedings of EMNLP.
25. Marsi, E., E. Krahmer, and W. Bosma. 2007. Dependency-based paraphrasing for recognizing textual entailment. In Proceedings of ACL PASCAL Workshop on Textual Entailment and Paraphrasing.
26. McCallum, A., K. Bellare, and F. Pereira. 2005. A conditional random field for discriminativelytrained finite-state string edit distance. In Proceedings of UAI.
27. McDonald, R., K. Crammer, and F. Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of ACL.
28. Mehdad, Yashar. 2009. Automatic cost estimation for tree edit distance using particle swarm optimization. In Proceedings of ACL.
29. Moldovan, D., C. Clark, S. Harabagiu, and S. Maiorano. 2003. Cogex: A logic prover for question answering. In Proceedings of HLT-NAACL.
30. Nielsen, R. D., W. Ward, and J. H. Martin. 2006. Toward dependency path based entailment. In Proceedings of the second PASCAL Challenges Workshop on RTE.
31. Papineni, K., S. Roukos, T. Ward, and W. Zhu. 2002. Bleu: a method for automatic evaluation of machine translation. In Proceedings of ACL.
32. Petrov, S., A. Pauls, and D. Klein. 2007. Discriminative log-linear grammars with latent variables. In Proceedings of NIPS.
33. Punyakanok, V., D. Roth, and W. Yih. 2004. Mapping dependencies trees: An application to question answering. In Proceedings of AI-Math.
34. Raina, R., A. Y. Ng, and C. Manning. 2005. Robust textual inference via learning and abductive reasoning. In Proceedings of AAAI.
35. Ratnaparkhi, Adwait. 1996. A maximum entropy part-of-speech tagger. In Proceedings of EMNLP.
36. Smith, D. A. and J. Eisner. 2006. Quasi-synchronous grammars: Alignment by soft projection of syntactic dependencies. In Proceedings of the HLTNAACL Workshop on Statistical Machine Translation.
37. Snow, R., L. Vanderwende, and A. Menezes. 2006. Effectively using syntax for recognizing false entailment. In Proceedings of HLT-NAACL.
38. Vanderwende, L., A. Menezes, and R. Snow. 2006. Microsoft research at rte-2: Syntactic contributions in the entailment task: an implementation. In Proceedings of the second PASCAL Challenges Workshop on RTE.
39. Wang, M., N. A. Smith, and T. Mitamura. 2007. What is the jeopardy model? a quasi-synchronous grammar for question answering. In Proceedings of EMNLP-CoNLL.
40. Zanzotto, F. M., A. Moschitti, M. Pennacchiotti, and M.T. Pazienza. 2006. Learning textual entailment from examples. In Proceedings of the second PASCAL Challenges Workshop on RTE.
41. Zhang, K. and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18.
42. Zhang, K. 1996. A constrained edit distance between unordered labeled trees. Algorithmica, 15(3):205- 222. (Pubitemid 126418810)