Lambda Calculus for Semantic Parsing

Lambda Calculs for Semantic Parsing

Nowadays, learning semantic representation in logical forms with lambda calculus is paramount to NLP and also a popular research topic.

Lambda Calculus as Programming Language

Syntax of lambda calculus

The syntax of lambda calculus is very simple.

<expression> ::= <constant> 
			   | <variable>
			   | (<expression1> <expression2>)
			   | (lambda <variable>.<expression>)

1. are numbers like “0” and “1” or predefined functions like “+” or “*”.
2. are random variable names like “x”,”y” or “z”
3. The third rule means function application (f x), in other words, applying the function LHS expr1 with the RHS expr2 as aruguments
4. The forth rule is a lambda abstraction, for building/defining new functions.

Refer to Programming Languages : Lambda Calculus

Semantic Parsing with Combinatory Categorial Grammars

There is a tutorial for this topic which is taught by Professor Yoav Artzi from Cornell University.
Refer to Semantic Parsing with Combinatory Categorial Grammars

赏

谢谢你请我吃糖果