A Hierarchical Entity Graph Convolutional Network for Relation Extraction across Documents

1Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

Distantly supervised datasets for relation extraction mostly focus on sentence-level extraction, and they cover very few relations. In this work, we propose cross-document relation extraction, where the two entities of a relation tuple appear in two different documents that are connected via a chain of common entities. Following this idea, we create a dataset for two-hop relation extraction, where each chain contains exactly two documents. Our proposed dataset covers a higher number of relations than the publicly available sentence-level datasets. We also propose a hierarchical entity graph convolutional network (HEGCN) model for this task that improves performance by 1.1% F1 score on our two-hop relation extraction dataset, compared to some strong neural baselines.

Cite

CITATION STYLE

APA

Nayak, T., & Ng, H. T. (2021). A Hierarchical Entity Graph Convolutional Network for Relation Extraction across Documents. In International Conference Recent Advances in Natural Language Processing, RANLP (pp. 1022–1030). Incoma Ltd. https://doi.org/10.26615/978-954-452-072-4_115

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free