This is the web page of the course Data Structures and Algorithms for Computational Lingustics III, WS 2019-2020 taught at the Department of Computational Linguistics, University of Tübingen.

This programming course provides an introduction to algorithms and data structures that are commonly used in computational linguistics, such as string distance measures, data structures for approximate string search, finite state automata, and parsing algorithms. The course is driven by assignments where participants implement these algorithms and data structures in small, but practical, applications.

Practical information

Lectures Monday 10:15-11:45, room 0.01
  Wednesday 10:15-11:45, room 0.01
Computer lab Friday 8:15-11:45, room 0.01
First Lecture October 21
Lecturers Corina Dima <>
  Çağrı Çöltekin <>
Tutors Kevin Glocker <>
  Teslin Roys <>


By the end of the course you will be able to:

GitHub registration

To register, and access to some of the course material, you need to complete an introductory assignment. Please do this before Wednesday 23rd.