LangPro: Natural Language Theorem ProverAbzianidze, L., 6-Sep-2017, p. 115-120. 5 p.
Research output: Contribution to conference › Paper › Academic
LangPro is an automated theorem prover for natural language (https://github.com/kovvalsky/LangPro). 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.
|Number of pages||5|
|Publication status||Published - 6-Sep-2017|
|Event||Conference on Empirical Methods in Natural Language Processing: System Demonstrations - Copenhagen, Denmark|
Duration: 7-Sep-2017 → 11-Sep-2017
|Conference||Conference on Empirical Methods in Natural Language Processing|
|Period||07/09/2017 → 11/09/2017|
Conference on Empirical Methods in Natural Language Processing: System Demonstrations
07/09/2017 → 11/09/2017Copenhagen, Denmark
- cs.CL, 68T50, I.2.7
No data available