Composite Kernels For Relation Extraction

The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how different kernels for parse trees can be combined to improve the relation extraction quality. On a public benchmark dataset the combination of a kernel for phrase grammar parse trees and for dependency parse trees outperforms all known tree kernel approaches alone suggesting that both types of trees contain complementary information for relation extraction.

• Type: Journal
• Year: 2009
• Where: ACL
• Authors: Frank Reichartz, Hannes Korte, Gerhard Paass
• Keywords: ACL 2009, Computational Linguistics, Dependency Parse Trees, Parse Trees, Relation Extraction