No description, website, or topics provided.
Protocol Buffer
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
README.md
assignment-rules.pb.txt
dependency-transformation-rule.proto
transformation-rules.pb.txt

README.md

Dependency to Lambda-calculus Conversion Rules

Overview

The files in this repository contain rules for conversion of syntactic dependency trees (in the "Stanford dependencies style") to lambda-calculus logical forms representing the semantics of a sentence or question.

These rules are described in more detail in the paper:
Siva Reddy, Oscar Täckström, Michael Collins, Tom Kwiatkowski, Dipanjan Das, Mark Steedman, Mirella Lapata (2016). Transforming Dependency Structures to Logical Forms for Semantic Parsing. Transactions of the Association for Computational Linguistics, vol 4.

Note that this repository does not include any software required to apply these rules.

Content

The rules consists of the following files:

License

This work is licensed by Google Inc. under a Creative Commons Attribution 4.0 International License.
alt text