Course description

This course is an introduction to symbolic computational linguistics for graduate and advanced undergraduate students---a general description for its course number can be found here. The course is complemented by an introduction to statistical approaches in computational linguistics (684.02) generally taught in the spring quarter.

The course covers the basic issues of the following topics: finite state automata and transducers, formal language theory, computability and complexity, recognizers/parsers for context free grammars, memoization, parsing with complex categories (term unification, graph unification).

The theoretical material is combined with practical exercises in Prolog implementing different aspects of parsers. At the end of the course, students complete a project consisting of building and testing a grammar fragment for a short English text of their choice.

General information

Back to main course page


For questions or comments regarding this page, please contact: Detmar Meurers
Last modified: Sat Jan 4 21:11:22 EST 2003