- Mon, 6. Jan.: Organizational meeting (slides)
- Wed, 8. Jan.: Finite state machines and regular
languages (slides, exercise sheet 1)
- Mon, 13. Jan.: Implementing finite state machines and
learning Prolog along the way (slides, exercise sheet 2)
- Wed, 15. Jan.: continued
Mon, 20. Jan.: Martin Luther King Day
- Wed, 22. Jan.: Towards more complex grammar formalisms:
Basic formal language theory (slides)
- Mon, 27. Jan.: More on recursive relations in Prolog
- Wed, 29. Jan.: From context free grammars to definite
clause grammars (slides, exercise sheet 3)
- Mon, 3. Feb.: What to encode in a grammar: A DCG for
English (slides)
- Wed, 5. Feb.: How to process with a grammar: Intro to Parsing (slides)
- Mon, 10. Feb.: Parsing strategies and their implementation
(continues slides above)
- Wed, 12. Feb.: Remembering sub-results: Well-formed
substring tables/CYK (slides,
exercise sheet 5)
Mon, 17. Feb.: Snow holiday
- Wed, 19. Feb.: Parsing strategies and CYK review
implementation of CYK (continues slides
above)
- Wed, 24. Feb.: Remembering subcomputations: The active
chart/Earley (continues slides above)
- Wed, 26. Feb.: More complex data structures:
From
atomic symbols to first order terms to feature structures (slides, exercise
sheet 6)
- Mon, 3. Mar.: Term and feature structure unification
(continues slides above) and
An introduction to the typed-feature based parsing system Trale (slides, description of final project)
- Wed, 5. Mar.: PATR-II and Parsing with complex categories
(slides)
- Mon, 10. Mar.: Chart-Parsing with complex categories
(slides)
- Wed, 12. Mar.: