Abstract
LangPro is an automated theorem prover for natural language. Given a set of premises and a hypothesis, it is able to prove semantic relations between them. The prover is based on a version of analytic tableau method specially designed for natural logic. The proof procedure operates on logical forms that preserve linguistic expressions to a large extent. %This property makes the logical forms easily obtainable from syntactic trees. %, in particular, Combinatory Categorial Grammar derivation trees. The nature of proofs is deductive and transparent. On the FraCaS and SICK textual entailment datasets, the prover achieves high results comparable to state-of-the-art.- Anthology ID:
- D17-2020
- Volume:
- Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
- Month:
- September
- Year:
- 2017
- Address:
- Copenhagen, Denmark
- Editors:
- Lucia Specia, Matt Post, Michael Paul
- Venue:
- EMNLP
- SIG:
- SIGDAT
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 115–120
- Language:
- URL:
- https://aclanthology.org/D17-2020
- DOI:
- 10.18653/v1/D17-2020
- Cite (ACL):
- Lasha Abzianidze. 2017. LangPro: Natural Language Theorem Prover. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 115–120, Copenhagen, Denmark. Association for Computational Linguistics.
- Cite (Informal):
- LangPro: Natural Language Theorem Prover (Abzianidze, EMNLP 2017)
- PDF:
- https://preview.aclanthology.org/naacl-24-ws-corrections/D17-2020.pdf
- Code
- kovvalsky/LangPro
- Data
- SICK