Apappu writeup on Bunescu and Mooney 2

This is a review of Bunescu_2005_a_shortest_path_dependency_kernel_for_relation_extraction by user:Apappu.

Reviewed Paper: A Shortest Path Dependency Kernel for Relation Extraction

• This paper aims at extracting relations between entities in same sentence by capturing shortest path between the two entities in the dependency graph.

• CFG parser has been used to extract local dependencies and CCG parser was put to use to capture non-local dependencies.

• A cartesian product of various feature classes has been used to define the feature space and a simple kernel has been modified to find out number of common word features/classes between two relation examples.

• This work could be more interesting if the relations extracted were used as features to extract entity "candidates" without using dependency graphs, treating with a bag of words kernel.