LangPro is an automated theorem prover for natural language.1 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. 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.
CITATION STYLE
Abzianidze, L. (2017). LangPro: Natural language theorem prover. In EMNLP 2017 - Conference on Empirical Methods in Natural Language Processing: System Demonstrations, Proceedings (pp. 115–120). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/d17-2020
Mendeley helps you to discover research relevant for your work.