Learning Interpretable Negation Rules via Weak Supervision at Document Level: A Reinforcement Learning Approach
被引:0
作者:
Prollochs, Nicolas
论文数: 0引用数: 0
h-index: 0
机构:
Univ Oxford, Oxford Man Inst, Oxford, EnglandUniv Oxford, Oxford Man Inst, Oxford, England
Prollochs, Nicolas
[1
]
Feuerriegel, Stefan
论文数: 0引用数: 0
h-index: 0
机构:
Swiss Fed Inst Technol, Zurich, SwitzerlandUniv Oxford, Oxford Man Inst, Oxford, England
Feuerriegel, Stefan
[2
]
论文数: 引用数:
h-index:
机构:
Neumann, Dirk
[3
]
机构:
[1] Univ Oxford, Oxford Man Inst, Oxford, England
[2] Swiss Fed Inst Technol, Zurich, Switzerland
[3] Univ Freiburg, Freiburg, Germany
来源:
2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1
|
2019年
关键词:
SPECULATION DETECTION;
SENTIMENT;
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
Negation scope detection is widely performed as a supervised learning task which relies upon negation labels at word level. This suffers from two key drawbacks: (1) such granular annotations are costly and (2) highly subjective, since, due to the absence of explicit linguistic resolution rules, human annotators often disagree in the perceived negation scopes. To the best of our knowledge, our work presents the first approach that eliminates the need for word-level negation labels, replacing it instead with document-level sentiment annotations. For this, we present a novel strategy for learning fully interpretable negation rules via weak supervision: we apply reinforcement learning to find a policy that reconstructs negation rules from sentiment predictions at document level. Our experiments demonstrate that our approach for weak supervision can effectively learn negation rules. Furthermore, an out-of-sample evaluation via sentiment analysis reveals consistent improvements (of up to 4.66 %) over both a sentiment analysis with (i) no negation handling and (ii) the use of word-level annotations from humans. Moreover, the inferred negation rules are fully interpretable.