Entailment Graph Learning with Textual Entailment and Soft Transitivity

04/07/2022
by   Zhibin Chen, et al.
0

Typed entailment graphs try to learn the entailment relations between predicates from text and model them as edges between predicate nodes. The construction of entailment graphs usually suffers from severe sparsity and unreliability of distributional similarity. We propose a two-stage method, Entailment Graph with Textual Entailment and Transitivity (EGT2). EGT2 learns local entailment relations by recognizing possible textual entailment between template sentences formed by typed CCG-parsed predicates. Based on the generated local graph, EGT2 then uses three novel soft transitivity constraints to consider the logical transitivity in entailment structures. Experiments on benchmark datasets show that EGT2 can well model the transitivity in entailment graph to alleviate the sparsity issue, and lead to significant improvement over current state-of-the-art methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2023

From the One, Judge of the Whole: Typed Entailment Graph Construction with Predicate Generation

Entailment Graphs (EGs) have been constructed based on extracted corpora...
research
01/04/2017

Textual Entailment with Structured Attentions and Composition

Deep learning techniques are increasingly popular in the textual entailm...
research
11/09/2015

Enacting textual entailment and ontologies for automated essay grading in chemical domain

We propose a system for automated essay grading using ontologies and tex...
research
07/23/2019

Happiness Entailment: Automating Suggestions for Well-Being

Understanding what makes people happy is a central topic in psychology. ...
research
06/21/2020

Enriching Large-Scale Eventuality Knowledge Graph with Entailment Relations

Computational and cognitive studies suggest that the abstraction of even...
research
09/06/2021

On non-structural subtype entailment

We prove that the non-structural subtype entailment problem for finite a...
research
08/13/2018

REGMAPR - A Recipe for Textual Matching

We propose a simple model for textual matching problems. Starting from a...

Please sign up or login with your details

Forgot password? Click here to reset