Computational Linguistics: Schedule

• Mon 19.4: Seminar: Lison - Introduction to the course, Finite-State Automata
• Thu 22.4: Exercises: Lison - Finite-State Automata
• Mon 26.4: Seminar: Kiefer - Chart-based parsing and generation
• Thu 29.4: Exercises: Kiefer - Chart-based parsing and generation
• Mon 03.5: Seminar: Krieger - Ontologies
• Thu 06.5: Exercises: Krieger - Ontologies
• Mon 10.05: Seminar: Kiefer - Unification-based parsing and generation
• Thu 13.05: PUBLIC HOLIDAYS (Himmelfahrt)
• Mon 17.05: Seminar: Klakow - Maximum Entropy Models
• Thu 20.05: Exercises: Kiefer - Unification-based parsing and generation
• Mon 24.05: PUBLIC HOLIDAYS (Pfingstmontag)
• Thu 27.05: Seminar: Klakow - Conditional Random Fields
• Mon 31.05: Exercises: Klakow - Maximum Entropy Models
• Thu 03.06: PUBLIC HOLIDAYS (Fronleichnam)
• Mon 07.06: Seminar: Eisele - Alignment algorithms
• Thu 10.06: Exercises: Klakow - Conditional Random Fields
• Mon 14.06: Seminar: Lison: Shallow matching algorithms (strings)
• Thu 17.06: Exercises: Eisele - Alignment algorithms
• Mon 21.06: Seminar: Lison: Shallow matching algorithms (trees)
• Thu 24.06: Exercises: Lison: Shallow matching algorithms
• Thu 01.07: Test exam
• Mon 05.07: Question hour
• Thu 08.07: Final exam (90 minutes writing time)