arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.15909cs.CL
收藏

学习即溯因:用于自然语言推理的可训练自然逻辑定理证明器

Learning as Abduction: Trainable Natural Logic Theorem Prover for Natural Language Inference

Utrecht University(乌得勒支大学)

Lasha Abzianidze

摘要:

用基于逻辑的方法处理自然语言推理变得越来越不常见。虽然这在几十年前可能是违反直觉的,但现在似乎很明显。这种概念的主要原因是:(a)基于逻辑的方法在处理广泛覆盖的文本时通常很脆弱,(b)它们需要大量的人工开发,而不是自动从数据中学习。我们通过将从数据中学习建模为溯因推理来克服这些缺点:反转定理证明过程来溯因语义关系,这些语义关系可以作为推理问题的黄金标签的最佳解释。换句话说,不是借助于词汇关系来证明语义级推理关系,而是考虑语义级推理关系来证明词汇关系。我们在自然语言的tableau定理证明器中实现了学习方法,并表明它将定理证明器在SICK数据集上的性能提高了1.4%,同时仍然保持了高精度(>94%)。所获得的结果是有竞争力的最先进的基于逻辑的系统之间。

英文摘要:

Tackling Natural Language Inference with a logic-based method is becoming less and less common. While this might have been counterintuitive several decades ago, nowadays it seems pretty obvious. The main reasons for such a conception are that (a) logic-based methods are usually brittle when it comes to processing wide-coverage texts, and (b) instead of automatically learning from data, they require much of manual effort for development. We make a step towards to overcome such shortcomings by modeling learning from data as abduction: reversing a theorem-proving procedure to abduce semantic relations that serve as the best explanation for the gold label of an inference problem. In other words, instead of proving sentence-level inference relations with the help of lexical relations, the lexical relations are proved taking into account the sentence-level inference relations. We implement the learning method in a tableau theorem prover for natural language and show that it improves the performance of the theorem prover on the SICK dataset by 1.4% while still maintaining high precision (>94%). The obtained results are competitive with the state of the art among logic-based systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑