Philgoo Han writeup of Bunescu and Mooney, 2005

This is a review of Bunescu_2005_a_shortest_path_dependency_kernel_for_relation_extraction by user:Ironfoot.

• Relation extraction using shortest path in dependency graph.
  • It is assumed that relation appears within a sentence.
  • CCG parser(local + non-local dep) and CFG parser(local dep) for extractin dependency graph
• Relation : dependency path
  • Each word with multiple class (word, POS, generalization over POS, entity type)
  • Kernel between two relation (simple and fast)
    • Easy to understand examples
• Experiment
  • Single step vs two step learning. Trade-off of precision vs recall
  • CFG shows better performance than CCG (opposite of my expectation, however it says CFG catches local dep better)
  • Overall results are quite lower than I thought. I may need broader view in the area to understand this.