Skip to content
CENG529Graduate

Combinators in Syntax and Semantics

Printed in the catalogue as COMBINATORS IN SYNTAX AND SEMANTICS

Course content

Combinators. Semantic dependencies and lambda calculus. Variable elimination. Syntacticizing the combinators. Systems with and without logical forms. Choice of universal dependencies. Computation with combinators (combinatory parsing). CCG as a linguistic theory. CCG as a computational theory. Radical lexicalization. Models and applications.

All CENG courses