Stay Together: A System for Single and Split-antecedent Anaphora Resolution

• URL: http://arxiv.org/abs/2104.05320v1
• Date: Mon, 12 Apr 2021 10:01:08 GMT
• Title: Stay Together: A System for Single and Split-antecedent Anaphora Resolution
• Authors: Juntao Yu, Nafise Sadat Moosavi, Silviu Paun, Massimo Poesio
• Abstract summary: Split-antecedent anaphora is rarer and more complex to resolve than single-antecedent anaphora. We introduce a system that resolves both single and split-antecedent anaphors, and evaluate it in a more realistic setting.
• Score: 19.98823717287972
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The state-of-the-art on basic, single-antecedent anaphora has greatly improved in recent years. Researchers have therefore started to pay more attention to more complex cases of anaphora such as split-antecedent anaphora, as in Time-Warner is considering a legal challenge to Telecommunications Inc's plan to buy half of Showtime Networks Inc-a move that could lead to all-out war between the two powerful companies. Split-antecedent anaphora is rarer and more complex to resolve than single-antecedent anaphora; as a result, it is not annotated in many datasets designed to test coreference, and previous work on resolving this type of anaphora was carried out in unrealistic conditions that assume gold mentions and/or gold split-antecedent anaphors are available. These systems also focus on split-antecedent anaphors only. In this work, we introduce a system that resolves both single and split-antecedent anaphors, and evaluate it in a more realistic setting that uses predicted mentions. We also start addressing the question of how to evaluate single and split-antecedent anaphors together using standard coreference evaluation metrics.

Related papers

• Sentiment Analysis through LLM Negotiations [58.67939611291001]
  A standard paradigm for sentiment analysis is to rely on a singular LLM and makes the decision in a single round. This paper introduces a multi-LLM negotiation framework for sentiment analysis.
  arXiv  Detail & Related papers  (2023-11-03T12:35:29Z)
• Conjunct Resolution in the Face of Verbal Omissions [51.220650412095665]
  We propose a conjunct resolution task that operates directly on the text and makes use of a split-and-rephrase paradigm in order to recover the missing elements in the coordination structure. We curate a large dataset, containing over 10K examples of naturally-occurring verbal omissions with crowd-sourced annotations. We train various neural baselines for this task, and show that while our best method obtains decent performance, it leaves ample space for improvement.
  arXiv  Detail & Related papers  (2023-05-26T08:44:02Z)
• Few-Shot Anaphora Resolution in Scientific Protocols via Mixtures of In-Context Experts [9.642187680042657]
  We present MICE (Mixtures of In-Context Experts), which we demonstrate is effective for few-shot anaphora resolution in scientific protocols. MICE combines the predictions of hundreds of in-context experts, yielding a 30% increase in F1 score over a competitive prompt retrieval baseline.
  arXiv  Detail & Related papers  (2022-10-07T16:51:45Z)
• Scoring Coreference Chains with Split-Antecedent Anaphors [23.843305521306227]
  We propose a solution to the technical problem of generalizing existing metrics for identity anaphora so that they can also be used to score cases of split-antecedents. This is the first such proposal in the literature on anaphora or coreference, and has been successfully used to score both split-antecedent plural references and discourse deixis.
  arXiv  Detail & Related papers  (2022-05-24T19:07:36Z)
• Author Clustering and Topic Estimation for Short Texts [69.54017251622211]
  We propose a novel model that expands on the Latent Dirichlet Allocation by modeling strong dependence among the words in the same document. We also simultaneously cluster users, removing the need for post-hoc cluster estimation. Our method performs as well as -- or better -- than traditional approaches to problems arising in short text.
  arXiv  Detail & Related papers  (2021-06-15T20:55:55Z)
• Anaphoric Binding: an integrated overview [0.0]
  Different anaphors may have different sets of admissible antecedents. These constraints stem from what appears as quite cogent generalisations. This kind of anaphoric binding constraints appears as a most significant subset of natural language knowledge.
  arXiv  Detail & Related papers  (2021-03-11T19:48:36Z)
• Learning from History for Byzantine Robust Optimization [52.68913869776858]
  Byzantine robustness has received significant attention recently given its importance for distributed learning. We show that most existing robust aggregation rules may not converge even in the absence of any Byzantine attackers.
  arXiv  Detail & Related papers  (2020-12-18T16:22:32Z)
• Free the Plural: Unrestricted Split-Antecedent Anaphora Resolution [23.843305521306227]
  We introduce the first model for unrestricted resolution of split-antecedent anaphors. We show that we can substantially improve its performance by addressing the sparsity issue. Evaluation on the gold annotated ARRAU corpus shows that the out best model uses a combination of three auxiliary corpora.
  arXiv  Detail & Related papers  (2020-10-31T11:21:39Z)
• When Hearst Is not Enough: Improving Hypernymy Detection from Corpus with Distributional Models [59.46552488974247]
  This paper addresses whether an is-a relationship exists between words (x, y) with the help of large textual corpora. Recent studies suggest that pattern-based ones are superior, if large-scale Hearst pairs are extracted and fed, with the sparsity of unseen (x, y) pairs relieved. For the first time, this paper quantifies the non-negligible existence of those specific cases. We also demonstrate that distributional methods are ideal to make up for pattern-based ones in such cases.
  arXiv  Detail & Related papers  (2020-10-10T08:34:19Z)
• Modeling Voting for System Combination in Machine Translation [92.09572642019145]
  We propose an approach to modeling voting for system combination in machine translation. Our approach combines the advantages of statistical and neural methods since it can not only analyze the relations between hypotheses but also allow for end-to-end training.
  arXiv  Detail & Related papers  (2020-07-14T09:59:38Z)
• Bridging Anaphora Resolution as Question Answering [10.81197069967052]
  We cast bridging anaphora resolution as question answering based on context. We present a question answering framework (BARQA) for this task. We propose a novel method to generate a large amount of "quasi-bridging" training data.
  arXiv  Detail & Related papers  (2020-04-16T19:42:43Z)

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.