English
Related papers

Related papers: Re-TACRED: Addressing Shortcomings of the TACRED D…

200 papers

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 pre-training and knowledge enhanced neural RE, models still show a high…

Computation and Language · Computer Science 2020-05-01 Christoph Alt , Aleksandra Gabryszak , Leonhard Hennig

Large crowd-sourced datasets are often noisy and relation classification (RC) datasets are no exception. Reannotating the entire dataset is one probable solution however it is not always viable due to time and budget constraints. This paper…

Computation and Language · Computer Science 2021-12-28 Akshay Parekh , Ashish Anand , Amit Awekar

The DocRED dataset is one of the most popular and widely used benchmarks for document-level relation extraction (RE). It adopts a recommend-revise annotation scheme so as to have a large-scale annotated dataset. However, we find that the…

Computation and Language · Computer Science 2023-06-19 Qingyu Tan , Lu Xu , Lidong Bing , Hwee Tou Ng , Sharifah Mahani Aljunied

Sentence-level relation extraction mainly aims to classify the relation between two entities in a sentence. The sentence-level relation extraction corpus often contains data that are difficult for the model to infer or noise data. In this…

Computation and Language · Computer Science 2021-08-05 Seongsik Park , Harksoo Kim

Annotation noise is widespread in datasets, but manually revising a flawed corpus is time-consuming and error-prone. Hence, given the prior knowledge in Pre-trained Language Models and the expected uniformity across all annotations, we…

Computation and Language · Computer Science 2022-05-12 Chang Shu

Sentence-level relation extraction (RE) aims at identifying the relationship between two entities in a sentence. Many efforts have been devoted to this problem, while the best performing methods are still far from perfect. In this paper, we…

Computation and Language · Computer Science 2022-09-23 Wenxuan Zhou , Muhao Chen

Relation extraction (RE) is a fundamental task in information extraction, whose extension to multilingual settings has been hindered by the lack of supervised resources comparable in size to large English datasets such as TACRED (Zhang et…

Computation and Language · Computer Science 2023-05-16 Leonhard Hennig , Philippe Thomas , Sebastian Möller

Relation extraction systems require large amounts of labeled examples which are costly to annotate. In this work we reformulate relation extraction as an entailment task, with simple, hand-made, verbalizations of relations produced in less…

Computation and Language · Computer Science 2021-09-09 Oscar Sainz , Oier Lopez de Lacalle , Gorka Labaka , Ander Barrena , Eneko Agirre

Relation extraction is used to populate knowledge bases that are important to many applications. Prior datasets used to train relation extraction models either suffer from noisy labels due to distant supervision, are limited to certain…

Computation and Language · Computer Science 2021-02-22 Robert Ormandi , Mohammad Saleh , Erin Winter , Vinay Rao

The overarching objective of this paper is two-fold. First, to explore model-based approaches to characterize the primary cause of the noise. in the RE dataset TACRED Second, to identify the potentially noisy instances. Towards the first…

Computation and Language · Computer Science 2023-11-22 Akshay Parekh , Ashish Anand , Amit Awekar

DocRED is a widely used dataset for document-level relation extraction. In the large-scale annotation, a \textit{recommend-revise} scheme is adopted to reduce the workload. Within this scheme, annotators are provided with candidate relation…

Computation and Language · Computer Science 2022-04-19 Quzhe Huang , Shibo Hao , Yuan Ye , Shengqi Zhu , Yansong Feng , Dongyan Zhao

Document-level relation extraction (DocRE) predicts relations for entity pairs that rely on long-range context-dependent reasoning in a document. As a typical multi-label classification problem, DocRE faces the challenge of effectively…

Computation and Language · Computer Science 2023-04-04 Jia Guo , Stanley Kok , Lidong Bing

Relation extraction is an important task in structuring content of text data, and becomes especially challenging when learning with weak supervision---where only a limited number of labeled sentences are given and a large number of…

Computation and Language · Computer Science 2019-02-26 Hongtao Lin , Jun Yan , Meng Qu , Xiang Ren

To alleviate human efforts from obtaining large-scale annotations, Semi-Supervised Relation Extraction methods aim to leverage unlabeled data in addition to learning from limited samples. Existing self-training methods suffer from the…

Computation and Language · Computer Science 2021-09-13 Xuming Hu , Chenwei Zhang , Fukun Ma , Chenyao Liu , Lijie Wen , Philip S. Yu

Advances in machine learning research drive progress in real-world applications. To ensure this progress, it is important to understand the potential pitfalls on the way from a novel method's success on academic benchmarks to its practical…

Machine Learning · Computer Science 2024-10-25 Ivan Rubachev , Nikolay Kartashev , Yury Gorishniy , Artem Babenko

The lack of contextual information in text data can make the annotation process of text-based emotion classification datasets challenging. As a result, such datasets often contain labels that fail to consider all the relevant emotions in…

Computation and Language · Computer Science 2023-11-08 Daniel Yang , Aditya Kommineni , Mohammad Alshehri , Nilamadhab Mohanty , Vedant Modi , Jonathan Gratch , Shrikanth Narayanan

Relation extraction (RE) aims to extract relations from sentences and documents. Existing relation extraction models typically rely on supervised machine learning. However, recent studies showed that many RE datasets are incompletely…

Computation and Language · Computer Science 2023-06-19 Qingyu Tan , Lu Xu , Lidong Bing , Hwee Tou Ng

This paper proposes integrating semantics-oriented similarity representation into RankingMatch, a recently proposed semi-supervised learning method. Our method, dubbed ReRankMatch, aims to deal with the case in which labeled and unlabeled…

Computer Vision and Pattern Recognition · Computer Science 2021-09-28 Trung Quang Tran , Mingu Kang , Daeyoung Kim

Large Language Models (LLMs) are of great interest in vulnerability detection and repair. The effectiveness of these models hinges on the quality of the datasets used for both training and evaluation. Our investigation reveals that a number…

Software Engineering · Computer Science 2025-03-11 Anurag Swarnim Yadav , Joseph N. Wilson

Everyone makes mistakes. So do human annotators when curating labels for named entity recognition (NER). Such label mistakes might hurt model training and interfere model comparison. In this study, we dive deep into one of the…

Computation and Language · Computer Science 2019-09-05 Zihan Wang , Jingbo Shang , Liyuan Liu , Lihao Lu , Jiacheng Liu , Jiawei Han
‹ Prev 1 2 3 10 Next ›