From the One, Judge of the Whole: Typed Entailment Graph Construction with Predicate Generation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to construct entailment graphs suffer from severe sparsity issues due to limited corpora and the long-tail phenomenon of predicate distributions. |
| Approach: | They propose a multi-stage method to generate entailment graphs by generating new predicates and detecting enanglement relations among seed predicats. |
| Outcome: | The proposed method can generate high-quality graphs with high precision over state-of-the-art methods and boost the performance of down-stream inference tasks. |
Similar Papers
Entailment Graph Learning with Textual Entailment and Soft Transitivity (2022.acl-long)
Copied to clipboard
| Challenge: | Typed entailment graphs suffer from severe sparsity and unreliability of distributional similarity . enlargement relation is critical to semantic understanding and natural language inference . |
| Approach: | They propose a method to learn local entailment relations by recognizing textual enanglement between template sentences formed by typed CCG-parsed predicates. |
| Outcome: | The proposed method can model transitivity in entailment graphs to alleviate sparsity and improve performance over current methods. |
Cross-lingual Inference with A Chinese Entailment Graph (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing work on predicate entailment detection from typed open relation triples has not been able to detect predicates. |
| Approach: | They propose a pipeline for building Chinese entailment graphs using an open relation extraction method. |
| Outcome: | The proposed pipeline outperforms monolingual and Chinese entailment graphs on a parallel dataset. |
Align-then-Enhance: Multilingual Entailment Graph Enhancement with Soft Predicate Alignment (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to learn typed entailment graphs with predicates as nodes and enttailment relations as edges are incomplete. |
| Approach: | They propose a task to utilize entailment information from one EG to enhance another in a different language. |
| Outcome: | The proposed framework outperforms existing graphs in multilingual entailment graph enhancement tasks. |
Natural Logic at the Core: Dynamic Rewards for Entailment Tree Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to generating entailment trees lack logical consistency . static reward structures or intricate dependencies within multi-step reasoning are often ignored . |
| Approach: | They propose a method that integrates natural logic principles into reinforcement learning to guide entailment tree generation. |
| Outcome: | Experiments on EntailmentBank show that the proposed method improves interpretability and generalization. |
Inference Helps PLMs’ Conceptual Understanding: Improving the Abstract Inference Ability with Hierarchical Conceptual Entailment Graphs (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to abstract inference ignore the *polysemy* and *hierarchical nature of concepts* . prevailing approaches disregard how arguments might entail differently across various concept levels, thereby missing potential enlargement connections. |
| Approach: | They propose a framework that organizes arguments hierarchically and delves into entailment relations at diverse concept levels. |
| Outcome: | The proposed framework improves the model's generalization and reasoning prowess in natural language inference. |
Entailment-Preserving First-order Logic Representations in Natural Language Entailment (2025.acl-long)
Copied to clipboard
| Challenge: | First-order logic (FOL) is often used to represent logical entailment, but determining natural language (NL) enanglement using FOL remains a challenge. |
| Approach: | They propose an Entailment-Preserving FOL representations task and a method which trains an NL-to-FOL translator by using the natural language entailment labels as verifiable rewards. |
| Outcome: | The proposed method achieves 1.8–2.7% improvement in EPR and 17.4–20.6% increase in E PR@16 compared to baselines in three datasets. |
Explaining Answers with Entailment Trees (2021.emnlp-main)
Copied to clipboard
Bhavana Dalvi, Peter Jansen, Oyvind Tafjord, Zhengnan Xie, Hannah Smith, Leighanna Pipatanangkura, Peter Clark
| Challenge: | ENTAILMENTBANK is the first dataset to contain multistep entailment trees. |
| Approach: | They propose to generate explanations in the form of entailment trees, a tree of multipremise entanglements steps from facts that are known to the hypothesis of interest. |
| Outcome: | The proposed model can generate explanations in the form of entailment trees . this is a tree of multipremise enttailment steps from facts known to the hypothesis of interest. |
Natural Language Deduction with Incomplete Information (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing systems for reasoning given incomplete information are inadequate . current approaches to reasoning are based on latent reasoning by large language models . |
| Approach: | They propose a system that generates a natural language "proof" by abductively inferring a premise from another premise and a conclusion. |
| Outcome: | The proposed system can handle the underspecified setting where not all premises are stated at the outset; additional assumptions need to be materialized to prove a claim. |
Explanation Graph Generation via Generative Pre-training over Synthetic Graphs (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing frameworks for explanation graph generation are limited due to the large number of datasets available. |
| Approach: | They propose a text-to-graph generative task to pre-train a model to bridge the text-graph gap. |
| Outcome: | The proposed framework surpasses all baseline systems with remarkable margins on ExplaGraphs and CommonsenseQA. |
Corpus Annotation Graph Builder (CAG): An Architectural Framework to Create and Annotate a Multi-source Graph (2023.eacl-demo)
Copied to clipboard
| Challenge: | Graphs are a natural representation of complex data as their structure allows users to discover (often implicit) relations among the nodes intuitively. |
| Approach: | They propose a corpus annotation graph framework that extends graphs with automatically extracted annotations. |
| Outcome: | The proposed framework can be used for further analyses across multiple downstream tasks. |