ConjNLI: Natural Language Inference Over Conjunctive Sentences
Swarnadeep Saha, Yixin Nie, Mohit Bansal
Abstract
Reasoning about conjuncts in conjunctive sentences is important for a deeper understanding of conjunctions in English and also how their usages and semantics differ from conjunctive and disjunctive boolean logic. Existing NLI stress tests do not consider non-boolean usages of conjunctions and use templates for testing such model knowledge. Hence, we introduce CONJNLI, a challenge stress-test for natural language inference over conjunctive sentences, where the premise differs from the hypothesis by conjuncts removed, added, or replaced. These sentences contain single and multiple instances of coordinating conjunctions ("and", "or", "but", "nor") with quantifiers, negations, and requiring diverse boolean and non-boolean inferences over conjuncts. We find that large-scale pre-trained language models like RoBERTa do not understand conjunctive semantics well and resort to shallow heuristics to make inferences over such sentences. As some initial solutions, we first present an iterative adversarial fine-tuning method that uses synthetically created training data based on boolean and non-boolean heuristics. We also propose a direct model advancement by making RoBERTa aware of predicate semantic roles. While we observe some performance gains, CONJNLI is still challenging for current methods, thus encouraging interesting future work for better understanding of conjunctions. 1
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- IndoNLI: A Natural Language Inference Dataset for IndonesianRahmad Mahendra, Alham Fikri Aji, Samuel Louvan, Fahrurrozi Rahman et al.EMNLP 2021 · 14 citations
- Adjective Scale Probe: Can Language Models Encode Formal Semantics Information?Wei Liu, Ming Xiang, Nai DingAAAI 2023 · 7 citations
- Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with ScalabilityJishnu Ray Chowdhury, Cornelia CarageaNeurIPS 2023 · 7 citations
- Efficient Beam Tree RecursionJishnu Ray Chowdhury, Cornelia CarageaNeurIPS 2023 · 4 citations
- How Hard is this Test Set? NLI Characterization by Exploiting Training DynamicsAdrian Cosma, Stefan Ruseti, Mihai Dascalu, Cornelia CarageaEMNLP 2024
Builds on6
- Learning The Difference That Makes A Difference With Counterfactually-Augmented DataDivyansh Kaushik, Eduard H. Hovy, Zachary Chase LiptonICLR 2020 · 625 citations
- Adversarial NLI: A New Benchmark for Natural Language UnderstandingYixin Nie, Adina Williams, Emily Dinan, Mohit Bansal et al.ACL 2020 · 602 citations
- Probing Natural Language Inference Models through Semantic FragmentsKyle Richardson, Hai Hu, Lawrence S. Moss, Ashish SabharwalAAAI 2020 · 152 citations
- Do Neural Models Learn Systematicity of Monotonicity Inference in Natural Language?Hitomi Yanaka, Koji Mineshima, Daisuke Bekki, Kentaro InuiACL 2020 · 34 citations
- The Curse of Performance Instability in Analysis Datasets: Consequences, Source, and SuggestionsXiang Zhou, Yixin Nie, Hao Tan, Mohit BansalEMNLP 2020 · 30 citations
Related papers
- IMPLI: Investigating NLI Models' Performance on Figurative LanguageKevin Stowe, Prasetya Ajie Utama, Iryna GurevychACL 2022 · 52 citations
- ADEPT: An Adjective-Dependent Plausibility TaskAli Emami, Ian Porada, Alexandra Olteanu, Kaheer Suleman et al.ACL 2021
- RobustLR: A Diagnostic Benchmark for Evaluating Logical Robustness of Deductive ReasonersSoumya Sanyal, Zeyi Liao, Xiang RenEMNLP 2022 · 6 citations
- Diagnosing the First-Order Logical Reasoning Ability Through LogicNLIJidong Tian, Yitian Li, Wenqing Chen, Liqiang Xiao et al.EMNLP 2021 · 21 citations
- Abductive Commonsense ReasoningChandra Bhagavatula, Ronan Le Bras, Chaitanya Malaviya, Keisuke Sakaguchi et al.ICLR 2020 · 521 citations
