Abstract
The increased demand for structured scientific knowledge has attracted considerable attention on extracting scientific relation from the ever growing scientific publications. Distant supervision is a widely applied approach to automatically generate large amounts of labelled sentences for scientific Relation Extraction (RE). However, the brevity of the labelled sentences would hinder the performance of distantly supervised RE (DS-RE). Specifically, authors always omit the Background Knowledge (BK) that they assume is well known by readers, but would be essential for a machine to identify relationships. To address this issue, in this work, we assume that the reasoning paths between entity pairs over a knowledge graph could be utilized as BK to fill the "gaps" in text and thus facilitate DS-RE. Experimental results prove the effectiveness of the reasoning paths for DS-RE, because the proposed model that incorporates the reasoning paths achieves significant and consistent improvements as compared with a state-of-the-art DS-RE model.
Original language | English |
---|---|
Pages | 19-28 |
Number of pages | 10 |
Publication status | Published - 2019 |
Event | 33rd Pacific Asia Conference on Language, Information and Computation, PACLIC 2019 - Hakodate, Japan Duration: 2019 Sept 13 → 2019 Sept 15 |
Conference
Conference | 33rd Pacific Asia Conference on Language, Information and Computation, PACLIC 2019 |
---|---|
Country/Territory | Japan |
City | Hakodate |
Period | 19/9/13 → 19/9/15 |
ASJC Scopus subject areas
- Language and Linguistics
- Computer Science (miscellaneous)