A Shortest Path Dependency Kernel for Relation Extraction

@inproceedings{Bunescu2005ASP,
  title={A Shortest Path Dependency Kernel for Relation Extraction},
  author={Razvan C. Bunescu and Raymond J. Mooney},
  booktitle={HLT/EMNLP},
  year={2005}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 537 CITATIONS, ESTIMATED 46% COVERAGE

1,171 Citations

050100'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 1,171 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…