Data Structures and Algorithms for Computational Linguistics III

Introduction

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 Tuesday 14:15-16:00, Thursday 14:15-16:00, 0.01
Computer lab Wednesday 14:15-18:00, 0.01
First Lecture October 24
Lecturer Daniël de Kok <daniel.de-kok@uni-tuebingen.de>
Tutors Teslin Roys <teslin.roys@student.uni-tuebingen.de>, Peter Schoener <peter.schoener@student.uni-tuebingen.de>

Goals

By the end of the course you can:

Literature