Abstract
Detecting hypernymy relations is a key task in NLP, which is addressed in the literature using two complementary approaches. Distributional methods, whose supervised variants are the current best performers, and path-based methods, which received less research attention. We suggest an improved path-based algorithm, in which the dependency paths are encoded using a recurrent neural network, that achieves results comparable to distributional methods. We then extend the approach to integrate both path-based and distributional signals, significantly improving upon the state-of-the-art on this task.
Original language | English |
---|---|
Title of host publication | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 - Long Papers |
Publisher | Association for Computational Linguistics (ACL) |
Pages | 2389-2398 |
Number of pages | 10 |
ISBN (Electronic) | 9781510827585 |
DOIs | |
State | Published - 2016 |
Event | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 - Berlin, Germany Duration: 7 Aug 2016 → 12 Aug 2016 |
Publication series
Name | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 - Long Papers |
---|---|
Volume | 4 |
Conference
Conference | 54th Annual Meeting of the Association for Computational Linguistics, ACL 2016 |
---|---|
Country/Territory | Germany |
City | Berlin |
Period | 7/08/16 → 12/08/16 |
Bibliographical note
Publisher Copyright:© 2016 Association for Computational Linguistics.