CoChat

TACRED Revisited: A Thorough Evaluation of the TACRED Relation Extraction Task

Open access
Alt, Christoph, Gabryszak, Aleksandra, Hennig, Leonhard · 2020 · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
Cited by 132

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Abstract

TACRED (Zhang et al., 2017) is one of the largest, most widely used crowdsourced datasets in Relation Extraction (RE).But, even with recent advances in unsupervised pretraining and knowledge enhanced neural RE, models still show a high error rate.In this paper, we investigate the questions: Have we reached a performance ceiling or is there still room for improvement?And how do crowd annotations, dataset, and models contribute to this error rate?To answer these questions, we first validate the most challenging 5K examples in the development and test sets using trained annotators.We find that label errors account for 8% absolute F1 test error, and that more than 50% of the examples need to be relabeled.On the relabeled test set the average F1 score of a large baseline model set improves from 62.1 to 70.1.After validation, we analyze misclassifications on the challenging instances, categorize them into linguistically motivated error groups, and verify the resulting error hypotheses on three state-of-the-art RE models.We show that two groups of ambiguous relations are responsible for most of the remaining errors and that models may adopt shallow heuristics on the dataset when entities are not masked.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2020.acl-main.142

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 132

Metadata

Authors
Alt, C., Gabryszak, A., & Hennig, L.
Venue
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
Published
2020
Pages
1558-1569
OpenAlex
W3023215888
Cited by
132
References
11
FWCI
8.67
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.