skip to main content
10.1145/1273496.1273578acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
Article

Fast and effective kernels for relational learning from texts

Published:20 June 2007Publication History

ABSTRACT

In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such models by optimizing the dynamic programming algorithm of the kernel evaluation. Experiments with Support Vector Machines and the above kernels show the effectiveness and efficiency of our approach on two very important natural language tasks, Textual Entailment Recognition and Question Answering.

References

  1. Bar Haim, R., Dagan, I., Dolan, B., Ferro, L., Giampiccolo, D., Magnini, B., & Szpektor, I. (2006). The II PASCAL RTE challenge. PASCAL Challenges Workshop. Venice, Italy.Google ScholarGoogle Scholar
  2. Bikel, D., Schwartz, R., & Weischedel, R. (1999). An Algorithm that Learns What's in a Name. Machine Learning, Special Issue on Natural Language Learning. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Boughorbel, S., Tarel, J.-P., & Fleuret, F. (2004). Non-mercer kernel for SVM object recognition. Proceedings of BMVC 2004. London, England.Google ScholarGoogle ScholarCross RefCross Ref
  4. Charniak, E. (2000). A maximum-entropy-inspired parser. Proc. of the 1st NAACL. Seattle, Washington, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Collins, M., & Duffy, N. (2002). New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. Proceedings of ACL02. Morristown, NJ, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Corley, C., & Mihalcea, R. (2005). Measuring the semantic similarity of texts. Proc. of the ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment. Ann Arbor, Michigan, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cumby, C., & Roth, D. (2003). Kernel methods for relational learning. Proceedings of ICML 2003. Washington, DC, USA.Google ScholarGoogle Scholar
  8. Dagan, I., Glickman, O., & Magnini, B. (2005). The PASCAL RTE challenge. PASCAL Challenges Workshop. Southampton, U.K.Google ScholarGoogle Scholar
  9. Getoor, L. (2005). Tutorial on statistical relational learning. ILP (p. 415). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Haasdonk, B. (2005). Feature space interpretation of SVMs with indefinite kernels. IEEE Trans Pattern Anal Mach Intell, 27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Joachims, T. (1999). Making large-scale svm learning practical. Advances in Kernel Methods-Support Vector Learning. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Miller, G. A. (1995). WordNet: A lexical database for English. Communications of the ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Moschitti, A. (2006). Efficient convolution kernels for dependency and constituent syntactic trees. Proceedings of ECML, Berlin, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Peñnas, A., Rodrigo, A., Sama, V., & Verdejo, F. (2006). Overview of the answer validation exercise 2006. Working Notes for the CLEF 2006 Workshop. Alicante, Spain.Google ScholarGoogle Scholar
  15. Ponte, J. M., & Croft, W. B. (1998). A language modeling approach to information retrieval. Proceedings of SIGIR '98. New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Voorhees, E. M. (2003). Overview of TREC 2003. TREC.Google ScholarGoogle Scholar
  17. Zanzotto, F. M., & Moschitti, A. (2006). Automatic learning of textual entailments with cross-pair similarities. Proceedings of the 21st Coling and 44th ACL. Sydney, Australia. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Zelenko, D., Aone, C., & Richardella, A. (2003). Kernel methods for relation extraction. Journal of Machine Learning Research. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Fast and effective kernels for relational learning from texts

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        ICML '07: Proceedings of the 24th international conference on Machine learning
        June 2007
        1233 pages
        ISBN:9781595937933
        DOI:10.1145/1273496

        Copyright © 2007 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 20 June 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate140of548submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader