Detmar Meurers: Introduction to symbolic computational linguistics (684.01, Winter 2001)
-
Syllabus with links to slides, exercises, and code:
- Tue, 2. Jan.: Introduction:
- Thu, 4. Jan.: Finite state techniques I:
Tue, 9. Jan.: Finite state techniques II
Thu, 11. Jan.: Finite state techniques III
Tue, 16. Jan.: Formal Language Theory I
Thu, 18. Jan.: Recursive relations in Prolog
- exercise sheet 3
(ps,
pdf)
Tue, 23. Jan.: Formal Language Theory II
Thu, 25. Jan.: From CFGs to DCGs I
Tue, 30. Jan.: DCGs as basic grammar formalism
Thu, 1. Feb.: Unbounded dependency constructions in DCGs
Tue, 6. Feb.: Parsing strategies
Thu, 8. Feb.: Basic top-down and bottom-up
parsing algorithms
Tue, 13. Feb.: Towards more efficient parsers: left-corner,
oracles, and well-formed substring tables
Thu, 15. Feb.: The CYK algorithm
Tue, 20. Feb.: The active chart: Earley's algorithm
- slides
(ps,
4up.ps,
pdf,
4up.pdf)
- code/earley/
- Background reading (pages 0-15) of Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira (1994): Principles and Implementation of Deductive Parsing
Thu, 22. Feb.: More on Earley's algorithm
Tue, 27. Feb.: Typed feature structures I
Thu, 1. Mar.: Unification
Tue, 6. Mar.: Implementing PATR in Prolog
Thu, 8. Mar.: Parsing with unification grammars and
wrapping up
This course reader,
which is intended as a basic guideline on the material covered in this
course, is a modified version of the module workbook for ``Techniques
in Natural Language Processing 1'' by Chris Mellish, Pete Whitelock
and Graeme Ritchie, 1994, Department of Artificial Intelligence,
University of Edinburgh. I would like to thank them for permitting me
to adapt their material for this course.
Practical infos and some links:
For questions or comments regarding this page, please contact: Detmar Meurers
Last modified: Thu Mar 8 17:54:22 EST 2001