Light-Weight Entailment Checking for Computational Semantics

摘要: Inference tasks in computational semantics have mostly been tackled by means of first-order theorem proving tools. While this is an important and welcome development, it has some inherent limitations. First, generating logic representations natural language documents hampered the lack efficient sufficiently robust NLP Second, costs deploying tools realworld situations may be prohibitive. And third, strict yes/no decisions delivered such are not always appropriate. In paper we report on approach to inference that works very minimal which can easily generated for arbitrary domains. Moreover, our computationally efficient, provides graded outcomes instead decisions. Our fully implemented, a preliminary evaluation discussed paper.