We introduce a theoretical framework for discriminating between Semantically Tractable (ST) questions and difficult ones, and we show that ST questions are prevalent in the well-studied ATIS data set (Price, 1990).
we show that the semantic component of the NLI task can be surprisingly easy and can be used to compensate for syntactic parsing errors.