SOTAVerified

Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoders

2020-10-08EMNLP 2020Code Available1· sign in to hype

Jue Wang, Wei Lu

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Named entity recognition and relation extraction are two important fundamental problems. Joint learning algorithms have been proposed to solve both tasks simultaneously, and many of them cast the joint task as a table-filling problem. However, they typically focused on learning a single encoder (usually learning representation in the form of a table) to capture information required for both tasks within the same space. We argue that it can be beneficial to design two distinct encoders to capture such two different types of information in the learning process. In this work, we propose the novel table-sequence encoders where two different encoders -- a table encoder and a sequence encoder are designed to help each other in the representation learning process. Our experiments confirm the advantages of having two encoders over one encoder. On several standard datasets, our model shows significant improvements over existing approaches.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ACE 2004Table-SequenceRE+ Micro F159.6Unverified
ACE 2005Table-SequenceRE Micro F167.6Unverified
Adverse Drug Events (ADE) CorpusTable-SequenceRE+ Macro F180.1Unverified
CoNLL04Table-SequenceRE+ Macro F1 75.4Unverified

Reproductions