Tree edit models for recognizing textual entailments, paraphrases, and answers to questions

NAACL HLT 2010 - Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2010, Pages 1011-1019

  Heilman, Michael ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GREEDY SEARCH; LOGISTIC REGRESSION MODELS; QUESTION ANSWERING; RECOGNIZING TEXTUAL ENTAILMENTS; SYNTACTIC FEATURES; TREE KERNELS; TREE TRANSFORMATION;

COMPUTATIONAL LINGUISTICS; LOGISTICS; REGRESSION ANALYSIS;

FORESTRY;

FORESTRY; MANAGEMENT; MATERIALS HANDLING; REGRESSION ANALYSIS;

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

References (38)

1. M. Bernard, L. Boyer, A. Habrard, and M. Sebban. 2008. Learning probabilistic models of tree edit distance.
2. D. M. Bikel, R. Schwartz, and R. M. Weischedel. 1999. An algorithm that learns what's in a name. Machine Learning, 34.
3. P. Bille. 2005. A survey on tree edit distance and related problems. Theoretical Computer Science, 337.
4. S. Chawathe and H. Garcia-Molina. 1997. Meaningful change detection in structured data. In Proc. of ACM SIGMOD.
5. M. Collins and N. Duffy. 2001. Convolution kernels for natural language. In Proc. of NIPS.
6. H. Cui, R. Sun, K. Li, M. Kan, and T. Chua. 2005. Question answering passage retrieval using dependency relations. In Proc. of ACM-SIGIR.
7. A. Culotta and J. Sorensen. 2004. Dependency tree kernels for relation extraction. In Proc. of ACL.
8. D. Das and N. A. Smith. 2009. Paraphrase identification as probabilistic quasi-synchronous recognition. In Proc. of ACL-IJCNLP.
9. M. de Marneffe, B. MacCartney, T. Grenager, D. Cer, A. Rafferty, and C. D. Manning. 2006. Learning to distinguish valid textual entailments. In Proc. of the Second PASCAL Challenges Workshop.
10. B. Dolan, C. Quirk, and C. Brockett. 2004. Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources. In Proc. of COLING.
11. J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proc. of COLING.
12. D. Giampiccolo, B. Magnini, I. Dagan, and B. Dolan, editors. 2007. The third pascal recognizing textual entailment challenge.
13. D. Gildea. 2003. Loosely tree-based alignment for machine translation. In Proc. of ACL.
14. S. Harmeling. 2007. An extensible probabilistic transformation-based approach to the third Recognizing Textual Entailment challenge. In Proc. of ACL-PASCAL Workshop on Textual Entailment and Paraphrasing.
15. T. Hastie, R. Tibshirani, and J. Friedman. 2001. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer.
16. D. Haussler. 1999. Convolution kernels on discrete structures. Technical Report ucs-crl-99-10, University of California Santa Cruz.
17. G. E. Hinton. 1999. Product of experts. In Proc. of ICANN.
18. P. N. Klein. 1989. Computing the edit-distance between unrooted ordered trees. In Proc. of European Symposium on Algorithms.
19. M. Kouylekov and B. Magnini. 2005. Recognizing textual entailment with tree edit distance algorithms. In Proc. of the PASCAL RTE Challenge.
20. S. le Cessie and J. C. van Houwelingen. 1997. Ridge estimators in logistic regression. Applied Statistics, 41.
21. B. MacCartney and C. D. Manning. 2008. Modeling semantic containment and exclusion in natural language inference. In Proc. of COLING.
22. R. McDonald, F. Pereira, K. Ribarov, and J. Hajič. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. of HLT-EMNLP.
23. G. A. Miller, R. Beckwith, C. Fellbaum, D. Gross, and K. J. Miller. 1990. WordNet: An on-line lexical database. International Journal of Lexicography, 3(4).
24. A. Moschitti. 2006. Efficient convolution kernels for dependency and constituent syntactic trees. In Proc. of ECML.
25. K. Papineni, S. Roukos, T. Ward, and W.-J. Zhu. 2002. BLEU: a method for automatic evaluation of machine translation. In Proc. of ACL.
26. J. Pearl. 1984. Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley.
27. V. Punyakanok, D. Roth, and W. Yih. 2004. Mapping dependencies trees: An application to question answering. In Proc. of the 8th International Symposium on Artificial Intelligence and Mathematics.
28. A. Ratnaparkhi. 1996. A maximum entropy part-of-speech tagger. In Proc. of EMNLP.
29. F. Schilder and B. T. McInnes. 2006. TLR at DUC 2006: approximate tree similarity and a new evaluation regime. In Proc. of DUC.
30. B. Schölkopf and A. J. Smola. 2001. Learning with Kernels. MIT Press.
31. D. A. Smith and J. Eisner. 2006. Quasi-synchronous grammars: Alignment by soft projection of syntactic dependencies. In Proc. of HLT-NAACL Workshop on Statistical Machine Translation.
32. V. N. Vapnik. 1995. The Nature of Statistical Learning Theory. Springer.
33. E. M. Voorhees. 2004. Overview of TREC 2004. In Proc. of TREC.
34. S. Wan, M. Dras, R. Dale, and C. Paris. 2006. Using dependency-based features to take the "para-farce" out of paraphrase. In Proc. of the Australasian Language Technology Workshop.
35. M. Wang, N. A. Smith, and T. Mitamura. 2007. What is the Jeopardy model? A quasi-synchronous grammar for QA. In Proc. of EMNLP-CoNLL.
36. F. M. Zanzotto and A. Moschitti. 2006. Automatic learning of textual entailments with cross-pair similarities. In Proc. of COLING/ACL.
37. D. Zelenko, C. Aone, and A. Richardella. 2003. Kernel methods for relation extraction. J. of Machine Learning Research, 3.
38. K. Zhang and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18.