Shortest Path Dependency Kernel for Relation Extraction
An Implementation of "Shortest Path Dependency Kernel for Relation Extraction" by R. Bunescu and R. Mooney.
Steps to Run
- Run
TwoEntities.ipynb
if entries with only two entities are to be considered. - Run
MultipleEntities.ipynb
/MultipleEntities.py
if entries with multiple entities are also to be considered.
Citation
Paper
@inproceedings{bunescu-mooney-2005-shortest,
title = "A Shortest Path Dependency Kernel for Relation Extraction",
author = "Bunescu, Razvan and
Mooney, Raymond",
booktitle = "Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing",
month = oct,
year = "2005",
address = "Vancouver, British Columbia, Canada",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/H05-1091",
pages = "724--731",
}
Dataset
@data{SP2/AARXSN_2019,
author = {French, Leon and Lane, Suzanne and Xu, Lydia and Siu, Celia and Kwok, Cathy and Chen, Yigi and Krebs, Claudia and Pavlidis, Paul},
publisher = {Scholars Portal Dataverse},
title = {{Application and evaluation of automated methods to extract neuroanatomical connectivity statements from free text}},
year = {2019},
version = {V1},
doi = {10.5683/SP2/AARXSN},
url = {https://doi.org/10.5683/SP2/AARXSN}
}