Abstract
The automatic extraction of relations from unstructured natural text is challenging but offers practical solutions for many problems like automatic text understanding and semantic retrieval. Relation extraction can be formulated as a classification problem using support vector machines and kernels for structured data that may include parse trees to account for syntactic structure. In this paper we present new tree kernels over dependency parse trees automatically generated from natural language text. Experiments on a public benchmark data set show that our kernels with richer structural features significantly outperform all published approaches for kernel-based relation extraction from dependency trees. In addition we optimize kernel computations to improve the actual runtime compared to previous solutions.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blohm, S., Cimiano, P.: Scaling up pattern induction for web relation extraction through frequent itemset mining. In: Proc. KI 2008 WS on Ontology-Based IE Systems (2008)
Bunescu, R.C., Mooney, R.J.: A shortest path dependency kernel for relation extraction. In: Proc. EMNLP 2005 (2005)
Bunescu, R.C., Mooney, R.J.: Subsequence kernels for relation extraction. In: Proc. Neural Information Processing Systems, NIPS 2005 (2005)
Culotta, A., Sorensen, J.: Dependency tree kernels for relation extraction. In: Proc. ACL 2004 (2004)
Harabagiu, S., Bejan, C.A., Morarescu, P.: Shallow semantics for relation extraction. In: Proc. IJCAI 2005 (2005)
Hearst, M.: Automatic acquisition of hyponyms from large text corpora. In: Proc. COLING 1992 (1992)
Horvath, T., Paass, G., Reichartz, F., Wrobel, S.: A logic-based approach to relation extraction from texts. In: ILP 2009 (2009)
Joachims, T.: Text categorization with support vector machines: learning with many relevant features. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398. Springer, Heidelberg (1998)
Joachims, T.: Making large-scale SVM learning practical. In: Advances in Kernel Methods - Support Vector Learning. MIT Press, Cambridge (1999)
Klein, D., Manning, C.D.: Accurate unlexicalized parsing. In: Proc. ACL 2003 (2003)
Klein, D., Manning, C.D.: Corpus-based induction of syntactic structure: Models of dependency and constituency. In: Proc. ACL 2004 (2004)
Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.: Text classification using string kernels. JMLR (2), 419–444 (2002)
Mitchell, A.: ACE-2 Version 1.0; corpus LDC2003T11. Linguistic Data Consortium, Philadelphia (2003), http://www.ldc.upenn.edu
Moschitti, A.: Efficient convolution kernels for dependency and constituent syntactic trees. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 318–329. Springer, Heidelberg (2006)
Paaß, G., Reichartz, F.: Exploiting semantic constraints for estimating supersenses with crfs. In: Proc. SDM 2009 (2009)
Reichartz, F., Korte, H., Paass, G.: Composite kernels for relation extraction. In: Proc. ACL 2009 (2009)
Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)
Tjong, E.F., Sang, K., De Meulder, F.: Language-independent named entity recognition. CoRR cs.CL/0306050 (2003)
Yang, Y.: An evaluation of statistical approaches to text categorization. Information Retrieval 1(1-2), 69–90 (1999)
Zelenko, D., Aone, C., Richardella, A.: Kernel methods for relation extraction. J. Mach. Learn. Res. 3, 1083–1106 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reichartz, F., Korte, H., Paass, G. (2009). Dependency Tree Kernels for Relation Extraction from Natural Language Text. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2009. Lecture Notes in Computer Science(), vol 5782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04174-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04174-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04173-0
Online ISBN: 978-3-642-04174-7
eBook Packages: Computer ScienceComputer Science (R0)