[PDF] Top 20 ccg2lambda: A Compositional Semantics System

... We demonstrate a simple and easy-to-use system to produce logical semantic rep- resentations of sentences. Our software operates by composing semantic formu- las bottom-up given a CCG parse tree. It uses flexible ... See full document

... formal semantics classifica- tion can provide a non-trivial prior distribution on the inferences to be made ...a system achieves by following the prior alone is prohibitively low for more advanced natural ... See full document

... Functions are special kinds of relations which map concepts to new concepts in the same domain. This term should not be confused with its more general use in compositional semantics or logic. They do not ... See full document

... Our semantics draws inspiration from (i) Montague semantics, (ii) vector space models, and (iii) Bayesian ...precise semantics for probabilistic programming, provided by Borgstr¨om et ...effect ... See full document

... We have presented a method of deriving abstract denotation from DCS trees, which enables logi- cal inference on DCS, and we developed a textual inference system based on the framework. Exper- imental results have ... See full document

... Though similar in spirit, there are some important differences between CGCR10 and our approach. They use ILP instead of beam search and structural SVM instead of log-linear models, but the main difference is which ... See full document

... incorporating semantics into TAG trees. Stone and Doran (1997) describe a system used for generation that simul- taneously constructs the semantics and syntax of a sentence using ...the ... See full document

... model to generate the correct answer using any tree. Our system learns lexical associations between words and predicates. For example, area (by virtue of being a noun) triggers many predicates: city , state , area ... See full document

... additive compositional dis- tributional semantics ...extracting compositional distributional semantics examples and ...equation system that represents a regression problem with multiple ... See full document

... This aspect of the syntax–semantics inter- face has been troublesome for some logic-based approaches: while past work has used related machinery for selecting lexicon entries (Berant and Liang, 2014) or for ... See full document

... munities; while it is generally assumed among for- mal semanticists that adequate semantic represen- tations for natural language demand higher-order logic or type theory (Carpenter, 1997), the domi- nant view in ... See full document

... the semantics of a wide range of programming and specification languages, and language features, in order to be able to reason formally about systems built using a mix of such ...UTP semantics of the ... See full document

... the system of mental spaces – the mental spheres (cognitive contexts reflected in the consciousness of the carriers of a certain language), connected with the comprehension by a person of various situations and ... See full document

... fully compositional, whereby the meaning of a phrase is a function of the meaning of its parts; however, as they reduce meaning to logical form, they are not necessarily adapted to all language processing ... See full document

... logical system used for RTE (Bos and Mark- ert, 2005; Lewis and Steedman, 2013; Bjerva et ...formal semantics of natural language to use HOL as a representation language (Montague, ...reasoning ... See full document

... However, an increasingly popular line of work has emerged in the last few years on using probabilistic and corpus-based methods for semantics as well. Much of this work makes use of the semantically annotated ... See full document

... of logic programming languages, define a fixpoint semantics for unification-based grammars by taking the least fixpoint of the parsing step operator as the denotation of a grammar... Fig[r] ... See full document

... the to the abstraction next refine a spurious counterexample Abstraction refinement, assume-guarantee reasoning and the L* algorithm for learning regular languages are combined to yield [r] ... See full document

... The semantics we have proposed allows focusing subjuncts to be covered by a frame-based approach to semantic interpretation, by virtue of its being compositional, computationally practic[r] ... See full document

... Formal Semantics, they do encode relevant semantic information, as shown by their success in demanding semantic tasks such as predicting sentence simi- larity (Marelli et ...2014). Compositional ... See full document