Consistent CCG parsing over multiple sentences for improved logical reasoning

2Citations
Citations of this article
84Readers
Mendeley users who have this article in their library.

Abstract

In formal logic-based approaches to Recognizing Textual Entailment (RTE), a Combinatory Categorial Grammar (CCG) parser is used to parse input premises and hypotheses to obtain their logical formulas. Here, it is important that the parser processes the sentences consistently; failing to recognize a similar syntactic structure results in inconsistent predicate argument structures among them, in which case the succeeding theorem proving is doomed to failure. In this work, we present a simple method to extend an existing CCG parser to parse a set of sentences consistently, which is achieved with an inter-sentence modeling with Markov Random Fields (MRF). When combined with existing logic-based systems, our method always shows improvement in the RTE experiments on English and Japanese languages.

Cite

CITATION STYLE

APA

Yoshikawa, M., Mineshima, K., Noji, H., & Bekki, D. (2018). Consistent CCG parsing over multiple sentences for improved logical reasoning. In NAACL HLT 2018 - 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies - Proceedings of the Conference (Vol. 2, pp. 407–412). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/n18-2065

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free