Computational Linguistics I

This topic offers an introduction to rule-based strategies in language technology, including finite state machines, formal grammars, parsing algorithms, unification-based formalisms and their relation to technological systems like machine translation. A basic introduction to programming will be provided if necessary.

The students will acquire knowledge of basic theories and methods in rule-based computational language analysis.

Lectures, group instructions and laboratory work. More on assessment: Obligatory exercises must be approved before students are allowed to take the take-home exam. The size of the exercises must be between 3-5 typed A4-pages each (line spacing 1.5). The size of the take-home exam depends partly on the subject, but is usually between 8-15 typed A4-pages (line spacing 1.5).