LangPro: Natural Language Theorem Prover

Lasha Abzianidze


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
Venue:
EMNLP
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
115–120
Language:
URL:
https://www.aclweb.org/anthology/D17-2020
DOI:
10.18653/v1/D17-2020
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/D17-2020.pdf