id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_spwpktmrkjellmefa22h7vbnp4	Siva Reddy	Transforming Dependency Structures to Logical Forms for Semantic Parsing	2016	14	.pdf	application/pdf	9283	1108	64	Transforming Dependency Structures to Logical Forms for Semantic Parsing based on the lambda calculus for deriving neoDavidsonian logical forms from dependency Semantic parsers map sentences onto logical forms DEPLAMBDA uses this system to generate robust logical forms, even when the dependency structure does not mirror predicate-argument relationships in constructions such as conjunctions, prepositional phrases, relative clauses, and wh-questions system is as follows: All natural language constituents have a lambda-calculus expression of type For example, (dobj acquired Pixar) receives the following expression after composition: Recall from Section 2 that every s-expression subtree receive a logical form of type η = Ind × Event → Bool. We next verify empirically that our proposed approach derives a useful logical compositional semantic representation from dependency syntax. In addition to the dependency-based semantic representation DEPLAMBDA (Section 3) and previous convert a graph built from dependency trees and semantic role structures to a first-order logical form,	./cache/work_spwpktmrkjellmefa22h7vbnp4.pdf	./txt/work_spwpktmrkjellmefa22h7vbnp4.txt