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.- Anthology ID:
- W19-0502
- Volume:
- Proceedings of the 13th International Conference on Computational Semantics - Short Papers
- Month:
- May
- Year:
- 2019
- Address:
- Gothenburg, Sweden
- Venue:
- IWCS
- SIG:
- SIGSEM
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 8–15
- Language:
- URL:
- https://aclanthology.org/W19-0502
- DOI:
- 10.18653/v1/W19-0502
- Cite (ACL):
- Hai Hu, Qi Chen, and Larry Moss. 2019. Natural Language Inference with Monotonicity. In Proceedings of the 13th International Conference on Computational Semantics - Short Papers, pages 8–15, Gothenburg, Sweden. Association for Computational Linguistics.
- Cite (Informal):
- Natural Language Inference with Monotonicity (Hu et al., IWCS 2019)
- PDF:
- https://preview.aclanthology.org/auto-file-uploads/W19-0502.pdf