A shortest path dependency kernel for relation extraction
Răzvan Bunescu, Raymond J. Mooney · 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.
Cited by 955 works. doi:10.3115/1220575.1220666 Open-access PDF
Authors
References
- Statistical Learning Theory
- An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
- Three generative, lexicalised models for statistical parsing
- An Introduction to Support Vector Machines and Other Kernel‐based Learning Methods
- Message Understanding Conference-6
- The Syntactic Process
- Dependency tree kernels for relation extraction
- Kernel methods for relation extraction
- Three generative, lexicalised models for statistical parsing
- Learning relations by pathfinding