We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/Breaking NLI Systems with Sentences that Require Simple Lexical Inferences
Conference ProceedingsArtificial Intelligence & Machine Learning

Breaking NLI Systems with Sentences that Require Simple Lexical Inferences

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Max Glockner, Vered Shwartz, Yoav Goldberg (2018). Breaking NLI Systems with Sentences that Require Simple Lexical Inferences. Annual Meeting of the Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/p18-2103

Copy in another style

Glockner, M., Shwartz, V., & Goldberg, Y. (2018). Breaking NLI Systems with Sentences that Require Simple Lexical Inferences. Annual Meeting of the Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/p18-2103
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.