Efficient Logical Inference for Semantic Processing
نویسندگان
چکیده
Dependency-based Compositional Semantics (DCS) provides a precise and expressive way to model semantics of natural language queries on relational databases, by simple dependency-like trees. Recently abstract denotation is proposed to enable generic logical inference on DCS. In this paper, we discuss some other possibilities to equip DCS with logical inference, and we discuss further on how logical inference can help textual entailment recognition, or other semantic precessing tasks.
منابع مشابه
Recognizing Textual Entailment Using Description Logic and Semantic Relatedness
Recognizing Textual Entailment using Description Logic and Semantic Relatedness Reda Siblini, Ph.D. Concordia University, 2014 Textual entailment (TE) is a relation that holds between two pieces of text where one reading the first piece can conclude that the second is most likely true. Accurate approaches for textual entailment can be beneficial to various natural language processing (NLP) appl...
متن کاملEfficient Semantic Inference over Language Expressions
According to the traditional formal semantics approach, inference is conducted at the logical level. Texts are first translated into some logical form and then new propositions are inferred from interpreted texts by a logical theorem prover. However, text understanding systems usually employ shallower lexical and lexical-syntactic representations, sometimes augmented with partial semantic annot...
متن کاملHigher-order logical inference with compositional semantics
We present a higher-order inference system based on a formal compositional semantics and the wide-coverage CCG parser. We develop an improved method to bridge between the parser and semantic composition. The system is evaluated on the FraCaS test suite. In contrast to the widely held view that higher-order logic is unsuitable for efficient logical inferences, the results show that a system base...
متن کاملANALOG: A Logical Language for Natural Language Processing
We present a formal description of a logical language that is based on a propositional semantic network. Variables in this language are not atomic and have potentially complex structure. We start from the individual components of a semantic network system, atomic nodes and relations that connect nodes, and provide a complete speci cation for the structure of nodes and a subsumption procedure be...
متن کاملA Logical Language for Natural Language Processing
We present a formal description of a logical language that is based on a propositional semantic network. Variables in this language are not atomic and have potentially complex structure. We start from the individual components of a semantic network system, atomic nodes and relations that connect nodes, and provide a complete speci cation for the structure of nodes and a subsumption procedure be...
متن کامل