SOTAVerified

Natural Language Inference

Natural language inference (NLI) is the task of determining whether a "hypothesis" is true (entailment), false (contradiction), or undetermined (neutral) given a "premise".

Example:

| Premise | Label | Hypothesis | | --- | ---| --- | | A man inspects the uniform of a figure in some East Asian country. | contradiction | The man is sleeping. | | An older and younger man smiling. | neutral | Two men are smiling and laughing at the cats playing on the floor. | | A soccer game with multiple males playing. | entailment | Some men are playing a sport. |

Approaches used for NLI include earlier symbolic and statistical approaches to more recent deep learning approaches. Benchmark datasets used for NLI include SNLI, MultiNLI, SciTail, among others. You can get hands-on practice on the SNLI task by following this d2l.ai chapter.

Further readings:

Papers

Showing 15511600 of 1961 papers

TitleStatusHype
On-demand Injection of Lexical Knowledge for Recognising Textual Entailment0
Soft Label Memorization-Generalization for Natural Language Inference0
Understanding Deep Learning Performance through an Examination of Test Set Difficulty: A Psychometric Case Study0
Bilateral Multi-Perspective Matching for Natural Language SentencesCode0
Structured Attention Networks0
Task-Specific Attentive Pooling of Phrase Alignments Contributes to Sentence Matching0
Textual Entailment with Structured Attentions and CompositionCode0
Proceedings of the Computing Natural Language Inference Workshop0
Quantifier Scoping and Semantic Preferences0
Textual Inference: getting logic from humansCode0
An overview of Natural Language Inference Data Collection: The way forward?0
A Type-Theoretical system for the FraCaS test suite: Grammatical Framework meets Coq0
Correcting ContradictionsCode0
Modeling Extractive Sentence Intersection via Subtree Entailment0
Compositional Distributional Models of Meaning0
Reading and Thinking: Re-read LSTM Unit for Textual Entailment Recognition0
Context-Sensitive Inference Rule Discovery: A Graph-Based Method0
ENIAM: Categorial Syntactic-Semantic Parser for Polish0
Annotation and Analysis of Discourse Relations, Temporal Relations and Multi-Layered Situational Relations in Japanese Texts0
Get Semantic With Me! The Usefulness of Different Feature Types for Short-Answer Grading0
Building a Dictionary of Affixal NegationsCode0
Natural Language Processing for Intelligent Access to Scientific Information0
Crowdsourcing Complex Language Resources: Playing to Annotate Dependency Syntax0
A Hybrid Approach to Generation of Missing Abstracts in Biomedical Literature0
Neural Attention for Learning to Rank Questions in Community Question Answering0
A Neural Architecture Mimicking Humans End-to-End for Natural Language Inference0
Contradiction Detection for Rumorous Claims0
Ordinal Common-sense Inference0
Exploiting Sentence Similarities for Better Alignments0
Building compositional semantics and higher-order inference system for a wide-coverage Japanese CCG parser0
Rule Extraction for Tree-to-Tree Transducers by Cost Minimization0
Automatic Identification of Narrative Diegesis and Point of View0
Automatic Extraction of Implicit Interpretations from Modal Constructions0
PaCCSS-IT: A Parallel Corpus of Complex-Simple Sentences for Automatic Text Simplification0
Research on attention memory networks as a model for learning natural language inference0
AMR Parsing with an Incremental Joint Model0
Supervised Distributional Hypernym Discovery via Domain Adaptation0
POLY: Mining Relational Paraphrases from Multilingual Sentences0
Tense Manages to Predict Implicative Behavior in Verbs0
Learning to Reason With Adaptive Computation0
A Hybrid Approach for Deep Machine Translation0
Toward the automatic extraction of knowledge of usable goods0
Lexical-Morphological Modeling for Legal Text Analysis0
Selective Annotation of Modal Readings: Delving into the Difficult Data0
Machine Comprehension Using Match-LSTM and Answer PointerCode0
Verbs Taking Clausal and Non-Finite Arguments as Signals of Modality -- Revisiting the Issue of Meaning Grounded in Syntax0
Natural Solution to FraCaS Entailment Problems0
Adding Context to Semantic Data-Driven Paraphrasing0
Improved Representation Learning for Question Answer Matching0
Learning To Use Formulas To Solve Simple Arithmetic Problems0
Show:102550
← PrevPage 32 of 40Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1UnitedSynT5 (3B)% Test Accuracy94.7Unverified
2UnitedSynT5 (335M)% Test Accuracy93.5Unverified
3EFL (Entailment as Few-shot Learner) + RoBERTa-large% Test Accuracy93.1Unverified
4Neural Tree Indexers for Text Understanding% Test Accuracy93.1Unverified
5RoBERTa-large+Self-Explaining% Test Accuracy92.3Unverified
6RoBERTa-large + self-explaining layer% Test Accuracy92.3Unverified
7CA-MTL% Test Accuracy92.1Unverified
8SemBERT% Test Accuracy91.9Unverified
9MT-DNN-SMARTLARGEv0% Test Accuracy91.7Unverified
10MT-DNN-SMART_100%ofTrainingDataDev Accuracy91.6Unverified
#ModelMetricClaimedVerifiedStatus
1Vega v2 6B (KD-based prompt transfer)Accuracy96Unverified
2PaLM 540B (fine-tuned)Accuracy95.7Unverified
3Turing NLR v5 XXL 5.4B (fine-tuned)Accuracy94.1Unverified
4ST-MoE-32B 269B (fine-tuned)Accuracy93.5Unverified
5DeBERTa-1.5BAccuracy93.2Unverified
6MUPPET Roberta LargeAccuracy92.8Unverified
7DeBERTaV3largeAccuracy92.7Unverified
8T5-XXL 11BAccuracy92.5Unverified
9T5-XXL 11B (fine-tuned)Accuracy92.5Unverified
10ST-MoE-L 4.1B (fine-tuned)Accuracy92.1Unverified
#ModelMetricClaimedVerifiedStatus
1UnitedSynT5 (3B)Matched92.6Unverified
2Turing NLR v5 XXL 5.4B (fine-tuned)Matched92.6Unverified
3T5-XXL 11B (fine-tuned)Matched92Unverified
4T5Matched92Unverified
5T5-11BMismatched91.7Unverified
6T5-3BMatched91.4Unverified
7ALBERTMatched91.3Unverified
8DeBERTa (large)Matched91.1Unverified
9Adv-RoBERTa ensembleMatched91.1Unverified
10SMARTRoBERTaDev Matched91.1Unverified