Computational Linguistics (SS 2011)
| Start: | Monday 18.04.2011 |
|---|---|
| When: | Lecture and Exercise: Mon, Thu: 2pm-4pm |
| Where: | Building C 72, room 2.11 |
| Organization: | Stephan Busemann |
Description
The goal of the course is to introduce the students to various standard algorithms in computational linguistics. The focus is on the structure of the algorithms, i.e. their data structures and mechanisms. The course discusses standard algorithms used for various types of linguistic processing in computational linguistics. The algorithms discussed in the course range from shallow methods such as pattern matching algorithms for strings and trees, and finite state methods; to machine learning and statistical techniques; to various algorithms used in deep linguistic processing. Examples of the latter are constraint based parsing, unification and underspecification. The algorithms are illustrated with practical applications from computational linguistics. The students will gain hands-on experience with the algorithms either through using existing implementations or by having to implement provided exercises. There will be a written exam at the end of the semester.
Details
This course is a core course in the computational linguistics specialization, in the MSc program. Course credits are 6 ECTS for MSc (4LP for Diplom)