TL;DR
This paper introduces a set prediction approach using transformer networks for joint entity and relation extraction, eliminating the need for sequence ordering and improving accuracy on benchmark datasets.
Contribution
The paper proposes a novel set prediction network with bipartite matching loss for joint extraction, outperforming existing sequence-based models.
Findings
Significantly outperforms state-of-the-art methods on benchmark datasets.
Uses non-autoregressive parallel decoding for efficient set prediction.
Employs bipartite matching loss to handle permutation invariance in triples.
Abstract
The joint entity and relation extraction task aims to extract all relational triples from a sentence. In essence, the relational triples contained in a sentence are unordered. However, previous seq2seq based models require to convert the set of triples into a sequence in the training phase. To break this bottleneck, we treat joint entity and relation extraction as a direct set prediction problem, so that the extraction model can get rid of the burden of predicting the order of multiple triples. To solve this set prediction problem, we propose networks featured by transformers with non-autoregressive parallel decoding. Unlike autoregressive approaches that generate triples one by one in a certain order, the proposed networks directly output the final set of triples in one shot. Furthermore, we also design a set-based loss that forces unique predictions via bipartite matching. Compared…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTanh Activation · Sigmoid Activation · Long Short-Term Memory · Sequence to Sequence
