A mostly unlexicalized model for recognizing textual entailment
Paper · 2018 · Mithun Paul, Rebecca Sharp and Mihai Surdeanu
Summary
The paper addresses the textual entailment half of the FEVER fact-checking task. The system must decide whether retrieved Wikipedia evidence SUPPORTS or REFUTES a claim. The authors worry that models relying on specific words or word embeddings memorize domain-bound cues, which then fail to transfer, for example from news to science. They therefore build a classifier whose inputs are almost entirely unlexicalized:
- overlap ratios for all words, nouns and verbs;
- verb polarity mismatches detected through dependency parses;
- WordNet antonym counts;
- agreement between numbers;
- similarity statistics computed from GloVe embeddings;
- indicator features for short closed lists of hedging and refuting words, whose meaning is assumed stable across domains.
Retrieval reuses the official DrQA-based baseline. Text is processed with CoreNLP, and classification is a linear SVM. The system scores below the lexicalized decomposable attention baseline (FEVER score 0.19 vs 0.2745). However, its transparency supports ablation, weight inspection and error analysis, and these point to missing syntactic and discourse signals. The work is a modest, interpretable step toward fact verification that can move between domains.
Key points
- Data: FEVER training set of 145,449 claims and development set of 19,998. After dropping NOT ENOUGH INFO claims, 109,810 claims were used for training and 13,332 for tuning.
- Test results with baseline retrieval: label accuracy 0.3694 vs 0.4884 for the baseline, and FEVER score 0.1900 vs 0.2745. Evidence F1 is identical (0.1826) because both use the same IR component.
- Oracle setting on the dev set (gold evidence sentences): 55.60 at submission and 56.88 after adding the lexical similarity features, vs 65.13 for the baseline.
- Feature groups:
- 5 overlap features;
- 60 hedging indicators;
- 19 refuting-word indicators;
- 4 polarity tuples;
- 4 antonym features;
- 2 numeric features;
- embedding similarity statistics (max, min and mean pairwise cosine, plus averaged-vector similarity).
- Ablation: removing word overlap drops accuracy to 50.89, and removing hedging drops it to 50.96. These were the largest effects. The strongest REFUTES weight (1.30) belongs to the case where a verb appearing in both texts carries negation in the claim yet appears affirmatively in the evidence.
Interesting ideas
- I1. Encode polarity disagreement as cross-tuples (claim negated/evidence positive and the reverse) over verbs shared by both texts, ignoring which verb it is; in this paper it became the most decisive refutation signal.
- I2. Measure overlap three ways (relative to the claim, to the evidence, and to their union), because coverage in one direction means something different from coverage in the other.
- I3. Ban content words as features but allow small closed lists of function-like cues (hedges, refuters) whose meaning holds across domains; this keeps the model portable while still capturing stance.
- I4. Treat numbers mentioned in the claim but missing from the evidence as a sign of exaggeration or conflict.
- I5. Use a transparent model to run group-wise ablation, print the top-weighted features per class, and manually trace a sample of errors. The traced errors revealed that missing role alignment (who wrote the film), implicit negation via "only", and argumentative cues such as "despite" misfire on neutral encyclopedic text.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (frames): When a claim frame and an evidence frame share a predicate, compare their polarity slots and emit an explicit mismatch flag that can serve as a refutation reason.
- I2 (answer): A reader can check how much of a question's content is covered by the story, separately from how much of the story the question touches, to tell "unsupported" apart from "off-topic".
- I3 (frames): Hedges and refuting markers can be tagged as modality or speech-act attributes on frames, kept separate from the domain lexicon.
- I4 (world): Compare quantities stored as measures and values in the text world, and report a claimed number that has no matching state as a concrete, explainable discrepancy.
- I5 (learn): Mova's evaluation can ablate feature or rule groups and include register-shifted negative controls, such as neutral Wikipedia-style text, to catch cues that only work in argumentative prose.
Institutions
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 9,086 worksArtificial Intelligence · 8,889 worksArts and Humanities · 9,296 worksLanguage and Linguistics · 9,206 works
🧭 Topics 1Research subjects and languages the work is about.Reasoning · 510 works
Cite
Cite as Mithun Paul, Rebecca Sharp and Mihai Surdeanu. 2018. A mostly unlexicalized model for recognizing textual entailment. Proceedings of the First Workshop on Fact Extraction and VERification (FEVER).
@inproceedings{paul2018mostly,
title = {{A mostly unlexicalized model for recognizing textual entailment}},
author = {Mithun Paul, Rebecca Sharp and Mihai Surdeanu},
booktitle = {Proceedings of the First Workshop on Fact Extraction and VERification (FEVER)},
year = {2018},
doi = {10.18653/v1/w18-5528},
url = {https://doi.org/10.18653/v1/w18-5528}
}References
- Steven Bird, Ewan Klein, and Edward Loper. 2009. Natural language processing with Python: analyzing text with the natural language toolkit. ” O’Reilly Media, Inc.”. find
- Steven Bird and Edward Loper. 2004. Nltk: the natural language toolkit. In Proceedings of the ACL 2004 on Interactive poster and demonstration sessions, page 31. Association for Computational Linguistics.
- Danqi Chen, Adam Fisch, Jason Weston, and Antoine Bordes. 2017. Reading wikipedia to answer open-domain questions. arXiv preprint arXiv:1704.00051. ↗
- Marti A. Hearst, Susan T Dumais, Edgar Osuna, John Platt, and Bernhard Scholkopf. 1998. Support vector machines. IEEE Intelligent Systems and their applications, 13(4):18–28. ↗
- Ankur P Parikh, Oscar Täckström, Dipanjan Das, and Jakob Uszkoreit. 2016. A decomposable attention model for natural language inference. arXiv preprint arXiv:1606.01933. bogus, debunk, denies, deny, despite, doubt, doubts, fake, false, fraud, hoax, neither, no, nope, nor, not, pranks, refute, retract Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. Glove: Global vectors for word representation. In Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), pages 1532–1543. ↗
- Dean Pomerleau and Delip Rao. 2017. Fake news challenge. find
- James Thorne, Andreas Vlachos, Christos Christodoulopoulos, and Arpit Mittal. 2018. Fever: a large-scale dataset for fact extraction and verification. arXiv preprint arXiv:1803.05355. ↗
- William Yang Wang. 2017. ” liar, liar pants on fire”: A new benchmark dataset for fake news detection. arXiv preprint arXiv:1705.00648. ↗
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/paul-2018-mostly-unlexicalized-model-recognizing-textual/