Towards Controllable Natural Language Inference through Lexical Inference Types
Not on the map. Why?
Abstract (arXiv)
Explainable natural language inference aims to provide a mechanism to produce explanatory (abductive) inference chains which ground claims to their supporting premises. A recent corpus called EntailmentBank strives to advance this task by explaining the answer to a question using an entailment tree citedalvi2021explaining. They employ the T5 model to directly generate the tree, which can explain how the answer is inferred. However, it lacks the ability to explain and control the generation of intermediate steps, which is crucial for the multi-hop inference process. % One recent corpus, EntailmentBank, aims to push this task forward by explaining an answer to a question according to an entailment tree citedalvi2021explaining. They employ T5 to generate the tree directly, which can explain how the answer is inferred but cannot explain how the intermediate is generated, which is essential to the multi-hop inference process. In this work, we focus on proposing a controlled natural language inference architecture for multi-premise explanatory inference. To improve control and enable explanatory analysis over the generation, we define lexical inference types based on Abstract Meaning Representation (AMR) graph and modify the architecture of T5 to learn a latent sentence representation (T5 bottleneck) conditioned on said type information. We also deliver a dataset of approximately 5000 annotated explanatory inference steps, with well-grounded lexical-symbolic operations. Experimental results indicate that the inference typing induced at the T5 bottleneck can help T5 to generate a conclusion under explicit control.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 37 references that are in the map. First posted on arXiv 7 Aug 2023.
Builds on
29 of 37 references.
References · 29
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2020BLEURT: Learning Robust Metrics for Text Generationcited by 1,196
- 2021Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Modelscited by 462
- 2015Adversarial Autoencoderscited by 359
- 2020ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Languagecited by 309
- 2017Toward Controlled Generation of Textcited by 271
- 2020Transformers as Soft Reasoners over Languagecited by 265
17 more
- 2017Learning Discourse-level Diversity for Neural Dialog Models using Conditional Variational Autoencoderscited by 222
- 2021Explaining Answers with Entailment Treescited by 148
- 2018Disentangled Representation Learning for Non-Parallel Text Style Transfercited by 127
- 2020Optimus: Organizing Sentences via Pre-trained Modeling of a Latent Spacecited by 114
- 2022Controllable Natural Language Generation with Contrastive Prefixescited by 75
- 2018WorldTree: A Corpus of Explanation Graphs for Elementary Science Questions supporting Multi-Hop Inferencecited by 60
- 2019Generating Sentences from Disentangled Syntactic and Semantic Spacescited by 59
- 2018Content preserving text generation with attribute controlscited by 47
- 2021Transformer-based Conditional Variational Autoencoder for Controllable Story Generationcited by 44
- 2020A Survey on Explainability in Machine Reading Comprehensioncited by 33
- 2021Sentence Bottleneck Autoencoders from Transformer Language Modelscited by 19
- 2019Mathematical Reasoning in Latent Spacecited by 17
- 2021Hybrid Autoregressive Inference for Scalable Multi-hop Explanation Regenerationcited by 17
- 2021Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standardscited by 12
- 2022Learning Disentangled Representations for Natural Language Definitionscited by 12
- 2023Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networkscited by 6
- 2022Quasi-symbolic Semantic Geometry over Transformer-based Variational AutoEncodercited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.