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.
More in CENG
- CENG100Computer Engineering Orientation
- CENG111Introduction to Computer Eng. Concepts
- CENG140C Programming
- CENG213Data Structures
- CENG222Statistical Methods for Computer Engineering
- CENG223Discrete Computational Structures
- CENG232Logic Design
- CENG240Programming with Python for Engineers