SOTAVerified

Natural Language Inference with Monotonicity

2019-05-01WS 2019Unverified0· sign in to hype

Hai Hu, Qi Chen, Larry Moss

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

This paper describes a working system which performs natural language inference using polarity-marked parse trees. The system handles all of the instances of monotonicity inference in the FraCaS data set. Except for the initial parse, it is entirely deterministic. It handles multi-premise arguments, and the kind of inference performed is essentially ``logical'', but it goes beyond what is representable in first-order logic. In any case, the system works on surface forms rather than on representations of any kind.

Tasks

Reproductions