pith. sign in

arxiv: 1609.07479 · v3 · pith:GNXOKXKZnew · submitted 2016-09-23 · 💻 cs.CL

Incorporating Relation Paths in Neural Relation Extraction

classification 💻 cs.CL
keywords relationentitiesextractionsentencestargetcontainingchainsdirect
0
0 comments X
read the original abstract

Distantly supervised relation extraction has been widely used to find novel relational facts from plain text. To predict the relation between a pair of two target entities, existing methods solely rely on those direct sentences containing both entities. In fact, there are also many sentences containing only one of the target entities, which provide rich and useful information for relation extraction. To address this issue, we build inference chains between two target entities via intermediate entities, and propose a path-based neural relation extraction model to encode the relational semantics from both direct sentences and inference chains. Experimental results on real-world datasets show that, our model can make full use of those sentences containing only one target entity, and achieves significant and consistent improvements on relation extraction as compared with baselines. The source code of this paper can be obtained from https: //github.com/thunlp/PathNRE.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Deep Ranking Based Cost-sensitive Multi-label Learning for Distant Supervision Relation Extraction

    cs.CL 2019-07 unverdicted novelty 4.0

    A deep ranking cost-sensitive multi-label model is introduced for distant supervision relation extraction that models class ties between relations via ranking losses and rescales costs for imbalance.