Segmentation Approach for Coreference Resolution Task

• URL: http://arxiv.org/abs/2007.04301v1
• Date: Tue, 30 Jun 2020 16:44:28 GMT
• Title: Segmentation Approach for Coreference Resolution Task
• Authors: Aref Jafari, Ali Ghodsi
• Abstract summary: In coreference resolution, it is important to consider all members of a coreference cluster and decide about all of them at once. This paper proposes a new approach for coreference resolution which can resolve all coreference mentions to a given mention in the document in one pass.
• Score: 4.000580823870735
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In coreference resolution, it is important to consider all members of a coreference cluster and decide about all of them at once. This technique can help to avoid losing precision and also in finding long-distance relations. The presented paper is a report of an ongoing study on an idea which proposes a new approach for coreference resolution which can resolve all coreference mentions to a given mention in the document in one pass. This has been accomplished by defining an embedding method for the position of all members of a coreference cluster in a document and resolving all of them for a given mention. In the proposed method, the BERT model has been used for encoding the documents and a head network designed to capture the relations between the embedded tokens. These are then converted to the proposed span position embedding matrix which embeds the position of all coreference mentions in the document. We tested this idea on CoNLL 2012 dataset and although the preliminary results from this method do not quite meet the state-of-the-art results, they are promising and they can capture features like long-distance relations better than the other approaches.

Related papers

• Contextual Document Embeddings [77.22328616983417]
  We propose two complementary methods for contextualized document embeddings. First, an alternative contrastive learning objective that explicitly incorporates the document neighbors into the intra-batch contextual loss. Second, a new contextual architecture that explicitly encodes neighbor document information into the encoded representation.
  arXiv  Detail & Related papers  (2024-10-03T14:33:34Z)
• Revisiting Proposal-based Object Detection [59.97295544455179]
  We revisit the pipeline for detecting objects in images with proposals. We solve a simple problem where we regress to the area of intersection between proposal and ground truth. Our revisited approach comes with minimal changes to the detection pipeline and can be plugged into any existing method.
  arXiv  Detail & Related papers  (2023-11-30T12:40:23Z)
• Hybrid Rule-Neural Coreference Resolution System based on Actor-Critic Learning [53.73316523766183]
  Coreference resolution systems need to tackle two main tasks. One task is to detect all of the potential mentions, the other is to learn the linking of an antecedent for each possible mention. We propose a hybrid rule-neural coreference resolution system based on actor-critic learning.
  arXiv  Detail & Related papers  (2022-12-20T08:55:47Z)
• Neural Coreference Resolution based on Reinforcement Learning [53.73316523766183]
  Coreference resolution systems need to solve two subtasks. One task is to detect all of the potential mentions, the other is to learn the linking of an antecedent for each possible mention. We propose a reinforcement learning actor-critic-based neural coreference resolution system.
  arXiv  Detail & Related papers  (2022-12-18T07:36:35Z)
• Cross-document Event Coreference Search: Task, Dataset and Modeling [26.36068336169796]
  We propose an appealing, and often more applicable, complementary set up for the task - Cross-document Coreference Search. To support research on this task, we create a corresponding dataset, which is derived from Wikipedia. We present a novel model that integrates a powerful coreference scoring scheme into the DPR architecture, yielding improved performance.
  arXiv  Detail & Related papers  (2022-10-23T08:21:25Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Focus on what matters: Applying Discourse Coherence Theory to Cross Document Coreference [22.497877069528087]
  Event and entity coreference resolution across documents vastly increases the number of candidate mentions, making it intractable to do the full $n2$ pairwise comparisons. Existing approaches simplify by considering coreference only within document clusters, but this fails to handle inter-cluster coreference. We draw on an insight from discourse coherence theory: potential coreferences are constrained by the reader's discourse focus. Our approach achieves state-of-the-art results for both events and entities on the ECB+, Gun Violence, Football Coreference, and Cross-Domain Cross-Document Coreference corpora.
  arXiv  Detail & Related papers  (2021-10-11T15:41:47Z)
• WEC: Deriving a Large-scale Cross-document Event Coreference dataset from Wikipedia [14.324743524196874]
  We present Wikipedia Event Coreference (WEC), an efficient methodology for gathering a large-scale dataset for cross-document event coreference from Wikipedia. We apply this methodology to the English Wikipedia and extract our large-scale WEC-Eng dataset. We develop an algorithm that adapts components of state-of-the-art models for within-document coreference resolution to the cross-document setting.
  arXiv  Detail & Related papers  (2021-04-11T14:54:35Z)
• Improving Calibration in Deep Metric Learning With Cross-Example Softmax [11.014197662964335]
  We propose Cross-Example Softmax which combines the properties of top-$k$ and threshold relevancy. In each iteration, the proposed loss encourages all queries to be closer to their matching images than all queries are to all non-matching images. This leads to a globally more calibrated similarity metric and makes distance more interpretable as an absolute measure of relevance.
  arXiv  Detail & Related papers  (2020-11-17T18:47:28Z)
• Streamlining Cross-Document Coreference Resolution: Evaluation and Modeling [25.94435242086499]
  Recent evaluation protocols for Cross-document (CD) coreference resolution have often been inconsistent or lenient. Our primary contribution is proposing a pragmatic evaluation methodology which assumes access to only raw text. Our model adapts and extends recent neural models for within-document coreference resolution to address the CD coreference setting.
  arXiv  Detail & Related papers  (2020-09-23T10:02:10Z)
• Active Learning for Coreference Resolution using Discrete Annotation [76.36423696634584]
  We improve upon pairwise annotation for active learning in coreference resolution. We ask annotators to identify mention antecedents if a presented mention pair is deemed not coreferent. In experiments with existing benchmark coreference datasets, we show that the signal from this additional question leads to significant performance gains per human-annotation hour.
  arXiv  Detail & Related papers  (2020-04-28T17:17:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.