English
Related papers

Related papers: Rewarding Coreference Resolvers for Being Consiste…

200 papers

Coreference Resolution (CR) is crucial for many NLP tasks, but existing LLMs struggle with hallucination and under-performance. In this paper, we investigate the limitations of existing LLM-based approaches to CR-specifically the…

Computation and Language · Computer Science 2025-09-16 Yujian Gan , Yuan Liang , Yanni Lin , Juntao Yu , Massimo Poesio

A common thread of retrieval-augmented methods in the existing literature focuses on retrieving encyclopedic knowledge, such as Wikipedia, which facilitates well-defined entity and relation spaces that can be modeled. However, applying such…

Computation and Language · Computer Science 2022-10-25 Wenhao Yu , Chenguang Zhu , Zhihan Zhang , Shuohang Wang , Zhuosheng Zhang , Yuwei Fang , Meng Jiang

In this paper, we propose a new paradigm for the task of entity-relation extraction. We cast the task as a multi-turn question answering problem, i.e., the extraction of entities and relations is transformed to the task of identifying…

Computation and Language · Computer Science 2019-09-05 Xiaoya Li , Fan Yin , Zijun Sun , Xiayu Li , Arianna Yuan , Duo Chai , Mingxin Zhou , Jiwei Li

Event Coreference Resolution (ECR) is the task of linking mentions of the same event either within or across documents. Most mention pairs are not coreferent, yet many that are coreferent can be identified through simple techniques such as…

Computation and Language · Computer Science 2023-05-11 Shafiuddin Rehan Ahmed , Abhijnan Nath , James H. Martin , Nikhil Krishnaswamy

In knowledge graph construction, a challenging issue is how to extract complex (e.g., overlapping) entities and relationships from a small amount of unstructured historical data. The traditional pipeline methods are to divide the extraction…

Computation and Language · Computer Science 2024-05-24 Jian Cheng , Tian Zhang , Shuang Zhang , Huimin Ren , Guo Yu , Xiliang Zhang , Shangce Gao , Lianbo Ma

Traditional learning-based coreference resolvers operate by training the mention-pair model for determining whether two mentions are coreferent or not. Though conceptually simple and easy to understand, the mention-pair model is…

Computation and Language · Computer Science 2014-05-21 Altaf Rahman , Vincent Ng

Current methods to extract relational triples directly make a prediction based on a possible entity pair in a raw sentence without depending on entity recognition. The task suffers from a serious semantic overlapping problem, in which…

Computation and Language · Computer Science 2024-10-28 Xiaocheng Luo , Yanping Chen , Ruixue Tang , Caiwei Yang , Ruizhang Huang , Yongbin Qin

Connections between relations in relation extraction, which we call class ties, are common. In distantly supervised scenario, one entity tuple may have multiple relation facts. Exploiting class ties between relations of one entity tuple…

Artificial Intelligence · Computer Science 2017-08-08 Hai Ye , Wenhan Chao , Zhunchen Luo , Zhoujun Li

The introduction of pretrained language models has reduced many complex task-specific NLP models to simple lightweight layers. An exception to this trend is coreference resolution, where a sophisticated task-specific model is appended to a…

Computation and Language · Computer Science 2021-06-01 Yuval Kirstain , Ori Ram , Omer Levy

Relation Extraction (RE) is one of the fundamental tasks in Information Extraction and Natural Language Processing. Dependency trees have been shown to be a very useful source of information for this task. The current deep learning models…

Computation and Language · Computer Science 2019-07-09 Amir Pouran Ben Veyseh , Thien Huu Nguyen , Dejing Dou

Relating entities and events in text is a key component of natural language understanding. Cross-document coreference resolution, in particular, is important for the growing interest in multi-document analysis tasks. In this work we propose…

Computation and Language · Computer Science 2021-04-20 Emily Allaway , Shuai Wang , Miguel Ballesteros

Coreference evaluation metrics are hard to optimize directly as they are non-differentiable functions, not easily decomposable into elementary decisions. Consequently, most approaches optimize objectives only indirectly related to the end…

Computation and Language · Computer Science 2017-06-23 Phong Le , Ivan Titov

Coreference resolution systems are typically trained with heuristic loss functions that require careful tuning. In this paper we instead apply reinforcement learning to directly optimize a neural mention-ranking model for coreference…

Computation and Language · Computer Science 2016-11-02 Kevin Clark , Christopher D. Manning

Joint entity and relation extraction is the fundamental task of information extraction, consisting of two subtasks: named entity recognition and relation extraction. However, most existing joint extraction methods suffer from issues of…

Computation and Language · Computer Science 2024-03-28 Wenjun Kong , Yamei Xia

This paper suggests a direction of coreference resolution for online decoding on actively generated input such as dialogue, where the model accepts an utterance and its past context, then finds mentions in the current utterance as well as…

Computation and Language · Computer Science 2022-05-24 Liyan Xu , Jinho D. Choi

Large language models (LLMs) are probabilistic in nature and perform more reliably when augmented with external information. As complex queries often require multi-step reasoning over the retrieved information, with no clear or…

Information Retrieval · Computer Science 2026-04-10 Roxana Petcu , Evangelos Kanoulas , Maarten de Rijke

Classifying and resolving coreferences of objects (e.g., product names) and attributes (e.g., product aspects) in opinionated reviews is crucial for improving the opinion mining performance. However, the task is challenging as one often…

Computation and Language · Computer Science 2021-07-20 Jiahua Chen , Shuai Wang , Sahisnu Mazumder , Bing Liu

Bibliographic reference parsers extract metadata (e.g. author names, title, year) from bibliographic reference strings. No reference parser consistently gives the best results in every scenario. For instance, one tool may be best in…

Information Retrieval · Computer Science 2018-08-29 Dominika Tkaczyk , Paraic Sheridan , Joeran Beel

Large Language Models (LLMs) often struggle with hallucinations and outdated information. To address this, Information Retrieval (IR) systems can be employed to augment LLMs with up-to-date knowledge. However, existing IR techniques contain…

Computation and Language · Computer Science 2024-11-26 Danupat Khamnuansin , Tawunrat Chalothorn , Ekapol Chuangsuwanich

Document-level relation extraction (RE) aims to identify the relations between entities throughout an entire document. It needs complex reasoning skills to synthesize various knowledge such as coreferences and commonsense. Large-scale…

Computation and Language · Computer Science 2022-07-26 Xinyi Wang , Zitao Wang , Weijian Sun , Wei Hu