Paraphrasing in Affirmative Terms Improves Negation Understanding

• URL: http://arxiv.org/abs/2406.07492v1
• Date: Tue, 11 Jun 2024 17:30:03 GMT
• Title: Paraphrasing in Affirmative Terms Improves Negation Understanding
• Authors: MohammadHossein Rezaei, Eduardo Blanco,
• Abstract summary: Negation is a common linguistic phenomenon. We show improvements with CondaQA, a large corpus requiring reasoning with negation, and five natural language understanding tasks.
• Score: 9.818585902859363
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Negation is a common linguistic phenomenon. Yet language models face challenges with negation in many natural language understanding tasks such as question answering and natural language inference. In this paper, we experiment with seamless strategies that incorporate affirmative interpretations (i.e., paraphrases without negation) to make models more robust against negation. Crucially, our affirmative interpretations are obtained automatically. We show improvements with CondaQA, a large corpus requiring reasoning with negation, and five natural language understanding tasks.

Related papers

• Generating Diverse Negations from Affirmative Sentences [0.999726509256195]
  Negations are important in real-world applications as they encode negative polarity in verb phrases, clauses, or other expressions. We propose NegVerse, a method that tackles the lack of negation datasets by producing a diverse range of negation types. We provide new rules for masking parts of sentences where negations are most likely to occur, based on syntactic structure. We also propose a filtering mechanism to identify negation cues and remove degenerate examples, producing a diverse range of meaningful perturbations.
  arXiv  Detail & Related papers  (2024-10-30T21:25:02Z)
• Revisiting subword tokenization: A case study on affixal negation in large language models [57.75279238091522]
  We measure the impact of affixal negation on modern English large language models (LLMs) We conduct experiments using LLMs with different subword tokenization methods. We show that models can, on the whole, reliably recognize the meaning of affixal negation.
  arXiv  Detail & Related papers  (2024-04-03T03:14:27Z)
• CONDAQA: A Contrastive Reading Comprehension Dataset for Reasoning about Negation [21.56001677478673]
  We present the first English reading comprehension dataset which requires reasoning about the implications of negated statements in paragraphs. CONDAQA features 14,182 question-answer pairs with over 200 unique negation cues. The best performing model on CONDAQA (UnifiedQA-v2-3b) achieves only 42% on our consistency metric, well below human performance which is 81%.
  arXiv  Detail & Related papers  (2022-11-01T06:10:26Z)
• Leveraging Affirmative Interpretations from Negation Improves Natural Language Understanding [10.440501875161003]
  Negation poses a challenge in many natural language understanding tasks. We show that doing so benefits models for three natural language understanding tasks. We build a plug-and-play neural generator that given a negated statement generates an affirmative interpretation.
  arXiv  Detail & Related papers  (2022-10-26T05:22:27Z)
• Transparency Helps Reveal When Language Models Learn Meaning [71.96920839263457]
  Our systematic experiments with synthetic data reveal that, with languages where all expressions have context-independent denotations, both autoregressive and masked language models learn to emulate semantic relations between expressions. Turning to natural language, our experiments with a specific phenomenon -- referential opacity -- add to the growing body of evidence that current language models do not well-represent natural language semantics.
  arXiv  Detail & Related papers  (2022-10-14T02:35:19Z)
• Not another Negation Benchmark: The NaN-NLI Test Suite for Sub-clausal Negation [59.307534363825816]
  Negation is poorly captured by current language models, although the extent of this problem is not widely understood. We introduce a natural language inference (NLI) test suite to enable probing the capabilities of NLP methods.
  arXiv  Detail & Related papers  (2022-10-06T23:39:01Z)
• A Question-Answer Driven Approach to Reveal Affirmative Interpretations from Verbal Negations [6.029488932793797]
  We create a new corpus consisting of 4,472 verbal negations and discover that 67.1% of them convey that an event actually occurred. Annotators generate and answer 7,277 questions for the 3,001 negations that convey an affirmative interpretation.
  arXiv  Detail & Related papers  (2022-05-23T17:08:30Z)
• Improving negation detection with negation-focused pre-training [58.32362243122714]
  Negation is a common linguistic feature that is crucial in many language understanding tasks. Recent work has shown that state-of-the-art NLP models underperform on samples containing negation. We propose a new negation-focused pre-training strategy, involving targeted data augmentation and negation masking.
  arXiv  Detail & Related papers  (2022-05-09T02:41:11Z)
• Composing Conversational Negation [0.0]
  We compose the negations of single words to capture the negation of sentences. We also describe how to model the negation of words whose meanings evolve in the text.
  arXiv  Detail & Related papers  (2021-07-14T16:24:41Z)
• Understanding by Understanding Not: Modeling Negation in Language Models [81.21351681735973]
  Negation is a core construction in natural language. We propose to augment the language modeling objective with an unlikelihood objective that is based on negated generic sentences. We reduce the mean top1 error rate to 4% on the negated LAMA dataset.
  arXiv  Detail & Related papers  (2021-05-07T21:58:35Z)
• Provable Limitations of Acquiring Meaning from Ungrounded Form: What will Future Language Models Understand? [87.20342701232869]
  We investigate the abilities of ungrounded systems to acquire meaning. We study whether assertions enable a system to emulate representations preserving semantic relations like equivalence. We find that assertions enable semantic emulation if all expressions in the language are referentially transparent. However, if the language uses non-transparent patterns like variable binding, we show that emulation can become an uncomputable problem.
  arXiv  Detail & Related papers  (2021-04-22T01:00:17Z)

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.