Efficient kernels for sentence pair classification

EMNLP 2009 - Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: A Meeting of SIGDAT, a Special Interest Group of ACL, Held in Conjunction with ACL-IJCNLP 2009

Volumn , Issue , 2009, Pages 91-100

  Zanzotto, Fabio Massimo ^a   Dell'Arciprete, Lorenzo ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

DIRECTED ACYCLIC GRAPH (DAG); EFFICIENT KERNELS; FEATURE SPACE; FIRST ORDER; KERNEL FUNCTION; NOVEL ALGORITHM; REWRITE RULES;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 77957859915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1699510.1699523     Document Type: Conference Paper

References (22)

1. Roy Bar-Haim, Ido Dagan, Bill Dolan, Lisa Ferro, Danilo Giampiccolo, and Idan Magnini, Bernardo Szpektor. 2006. The second pascal recognising textual entailment challenge. In Proceedings of the Second PASCAL Challenges Workshop on Recognising Textual Entailment. Venice, Italy.
2. Bob Carpenter. 1992. The Logic of Typed Feature Structures. Cambridge University Press, Cambridge, England.
3. Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proceedings of ACL02.
4. C. Cortes and V. Vapnik. 1995. Support vector networks. Machine Learning, 20:1-25.
5. Ido Dagan and Oren Glickman. 2004. Probabilistic textual entailment: Generic appliedmodeling of language variability. In Proceedings of the Workshop on Learning Methods for Text Understanding and Mining, Grenoble, France.
6. Ido Dagan, Oren Glickman, and Bernardo Magnini. 2006. The pascal recognising textual entailment challenge. In Quionero-Candela et al., editor, LNAI 3944: MLCW 2005, pages 177-190, Milan, Italy. Springer-Verlag.
7. Marie-Catherine de Marneffe, Bill MacCartney, Trond Grenager, Daniel Cer, Anna Rafferty, and Christopher D. Manning. 2006. Learning to distinguish valid textual entailments. In Proceedings of the Second PASCAL Challenges Workshop on Recognising Textual Entailment, Venice, Italy.
8. Jason Eisner. 2003. Learning non-isomorphic tree mappings for machine translation. In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (ACL), Companion Volume, pages 205-208, Sapporo, July.
9. Thomas Gärtner. 2003. A survey of kernels for structured data. SIGKDD Explorations.
10. Aria D. Haghighi, Andrew Y. Ng, and Christopher D. Manning. 2005. Robust textual inference via graph matching. In HLT '05: Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, pages 387-394, Morristown, NJ, USA. Association for Computational Linguistics.
11. Andrew Hickl, J Williams, Jeremy Bensley, Kirk Roberts, Bryan Rink, and Ying Shi. 2006. Recognizing textual entailment with LCCs GROUNDHOG system. In Bernardo Magnini and Ido Dagan, editors, Proceedings of the Second PASCAL Recognizing Textual Entailment Challenge, Venice, Italy. Springer-Verlag.
12. Thorsten Joachims. 1999. Making large-scale svm learning practical. In B. Schlkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods-Support Vector Learning. MIT Press.
13. Johannes Köbler, Uwe Schöning, and Jacobo Torán. 1993. The graph isomorphism problem: its structural complexity. Birkhauser Verlag, Basel, Switzerland, Switzerland.
14. Alessandro Moschitti and Fabio Massimo Zanzotto. 2007. Fast and effective kernels for relational learning from texts. In Proceedings of the International Conference of Machine Learning (ICML). Corvallis, Oregon.
15. Alessandro Moschitti. 2004. A study on convolution kernels for shallow semantic parsing. In proceedings of the ACL, Barcelona, Spain.
16. C. Pollard and I.A. Sag. 1994. Head-driven Phrase Structured Grammar. Chicago CSLI, Stanford.
17. Rajat Raina, Aria Haghighi, Christopher Cox, Jenny Finkel, Jeff Michels, Kristina Toutanova, Bill Mac-Cartney, Marie-Catherine de Marneffe, Manning Christopher, and Andrew Y. Ng. 2005. Robust textual inference using diverse knowledge sources. In Proceedings of the 1st Pascal Challenge Workshop, Southampton, UK.
18. Jan Ramon and Thomas Gärtner. 2003. Expressivity versus efficiency of graph kernels. In First International Workshop on Mining Graphs, Trees and Sequences.
19. Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, and Eisaku Maeda. 2003. Hierarchical directed acyclic graph kernel: Methods for structured natural language data. In In Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pages 32-39.
20. Rui Wang and Günter Neumann. 2007. Recognizing textual entailment using a subsequence kernel method. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI-07), July 22-26, Vancouver, Canada.
21. Jie Wang. 1997. Average-case computational complexity theory. pages 295-328.
22. Fabio Massimo Zanzotto and Alessandro Moschitti. 2006. Automatic learning of textual entailments with cross-pair similarities. In Proceedings of the 21st Coling and 44th ACL, pages 401-408. Sydney, Australia, July.