Review
HUANG Rui-hong,SUN Le,FENG Yuan-yong,HUANG Yun-ping,
2008, 22(5): 102-108.
Entity Relation Extraction is one of the important research fields in Information Extraction. This paper explores the effectiveness of two kernel-based methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation extraction based on ACE 2007 corpus. For the convolution kernel, the influence by the different parse tree spans on the performance of relation extraction is studied. Then, experiments with composite kernels, which are a combination of the convolution kernel and feature-based kernels, are conducted to investigate the complementary effects between tree kernel and flat kernels. Finally, we improve the shortest path dependency kernel by replacing the strict same length requirement with finding the longest common subsequences between two shortest dependency paths. Experiments prove that kernel-based methods are effective for Chinese relation extraction as well.