The reviewed record of science sign in
Pith

arxiv: 2108.09505 · v1 · pith:HGYDMK3Z · submitted 2021-08-21 · cs.CL

A Hierarchical Entity Graph Convolutional Network for Relation Extraction across Documents

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HGYDMK3Zrecord.jsonopen to challenge →

classification cs.CL
keywords extractionrelationdatasetdocumentschainconvolutionaldatasetsentities
0
0 comments X
read the original 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.

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.