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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Reichartz, F., Korte, H., & Paass, G. (2009). Dependency tree kernels for relation extraction from natural language text. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5782 LNAI, pp. 270–285). https://doi.org/10.1007/978-3-642-04174-7_18
Mendeley helps you to discover research relevant for your work.