A Shortest Path Dependency Kernel for Relation Extraction

By Razvan C. Bunescu, Raymond J. Mooney. 2005

1,040 citations recorded by the source corpus.

We present a novel approach to relation extraction, based on the observation that the information required to assert a relationship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.

Subfields: Artificial Intelligence, Information Extraction

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Percy Liang
  3. Christopher D. Manning
  4. Luke S. Zettlemoyer
  5. Yejin Choi
  6. Zhiyuan Liu
  7. Jianfeng Gao
  8. Yoav Goldberg

In Information Extraction

  1. Yuan Luo
  2. Christopher D. Manning
  3. Thien Huu Nguyen
  4. Ralph Grishman
  5. Alessandro Moschitti
  6. Ozlem Uzuner
  7. Gabor Angeli
  8. Peter Szolovits

Citations in the corpus