Yandongl writeup of Bunescu 2005

This is a review of Bunescu_2005_a_shortest_path_dependency_kernel_for_relation_extraction by user:Yandongl.

This paper investigated the problem of using shortest path between two name entities for relation extraction task. The 'Kernel Trick' is used here, when computing the dot product between features. The proposed kernel function is quite simple, which has a O(n) time complexity. And it can measure the common features between two features.

Two parsers are mentioned in this paper: CCG for lexical features and tokens and CFG for local dependencies. Looks like CFG always beats CCG in the experiments.