paper-with-me

홈 › Papers

Flexible Generation of Natural Language Deductions

2021-04-18 · EMNLP 2021 11 · Kaj Bostrom, Xinyu Zhao, Swarat Chaudhuri, Greg Durrett

An interpretable system for open-domain reasoning needs to express its reasoning process in a transparent form. Natural language is an attractive representation for this purpose -- it is both highly expressive and easy for humans to understand. However, manipulating natural language statements in logically consistent ways is hard: models must cope with variation in how meaning is expressed while remaining precise. In this paper, we describe ParaPattern, a method for building models to generate deductive inferences from diverse natural language inputs without direct human supervision. We train BART-based models (Lewis et al., 2020) to generate the result of applying a particular logical operation to one or more premise statements. Crucially, we develop a largely automated pipeline for constructing suitable training examples from Wikipedia. We evaluate our models using out-of-domain sentence compositions from the QASC (Khot et al., 2020) and EntailmentBank (Dalvi et al., 2021) datasets as well as targeted perturbation sets. Our results show that our models are substantially more accurate and flexible than baseline systems. ParaPattern achieves 85% validity on examples of the 'substitution' operation from EntailmentBank without the use of any in-domain training data, matching the performance of a model fine-tuned for EntailmentBank. The full source code for our method is publicly available.

📄 PDF Abstract BibTeX arXiv:2104.08825

Code (1)

alephic/ParaPattern 공식 구현 pytorch

Tasks

Sentence

Similar Papers 제목 키워드 기반

Natural Language Deduction with Incomplete Information

2022-11-01 · Zayne Sprague, Kaj Bostrom, Swarat Chaudhuri, Greg Durrett

A growing body of work studies how to answer a question or verify a claim by generating a natural language "proof": a chain of deductive inferences yielding the answer based on a set of premises. However, these methods c…

Text Generation

Learning Lambek grammars from proof frames

2013-10-02 · Roberto Bonato, Christian Retoré

In addition to their limpid interface with semantics, categorial grammars enjoy another important property: learnability. This was first noticed by Buskowsky and Penn and further studied by Kanazawa, for Bar-Hillel categ…

ALTER: Auxiliary Text Rewriting Tool for Natural Language Generation

2019-09-14 · IJCNLP 2019 11 · Qiongkai Xu, Chenchen Xu, Lizhen Qu

In this paper, we describe ALTER, an auxiliary text rewriting tool that facilitates the rewriting process for natural language generation tasks, such as paraphrasing, text simplification, fairness-aware text rewriting, a…

FairnessStyle TransferText GenerationText Simplification+1

Dancing with Critiques: Enhancing LLM Reasoning with Stepwise Natural Language Self-Critique

2025-03-21 · Yansi Li, Jiahao Xu, Tian Liang, Xingyu Chen 외

Enhancing the reasoning capabilities of large language models (LLMs), particularly for complex tasks requiring multi-step logical deductions, remains a significant challenge. Traditional inference time scaling methods ut…

Decision Making

CalliffusionV2: Personalized Natural Calligraphy Generation with Flexible Multi-modal Control

2024-10-03 · Qisheng Liao, Liang Li, Yulang Fei, Gus Xia

In this paper, we introduce CalliffusionV2, a novel system designed to produce natural Chinese calligraphy with flexible multi-modal control. Unlike previous approaches that rely solely on image or text inputs and lack f…

Few-Shot Learning