Breaking NLI Systems with Sentences that Require Simple Lexical Inferences
2018-05-06ACL 2018Code Available1· sign in to hype
Max Glockner, Vered Shwartz, Yoav Goldberg
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/BIU-NLP/Breaking_NLIOfficialIn papernone★ 0
- github.com/coetaur0/ESIMpytorch★ 374
Abstract
We create a new NLI test set that shows the deficiency of state-of-the-art models in inferences that require lexical and world knowledge. The new examples are simpler than the SNLI test set, containing sentences that differ by at most one word from sentences in the training set. Yet, the performance on the new test set is substantially worse across systems trained on SNLI, demonstrating that these systems are limited in their generalization ability, failing to capture many simple inferences.