Finite-State Methods In Natural Language Processing
Offered as a pair of short courses: 600.405 (Fall 2000) and its
sequel 600.406 (Spring 2001).
Catalog description: Finite-state transducers, a
generalization of finite-state automata, can efficiently compute many
useful functions and weighted (probabilistic) relations on
strings. We'll cover theory and practice, including algebraic
operations for building transducers, software tools, and a range of
applications to natural language.
This page is out of date. See the page for the spring semester.
Expired info for fall semester
Expired policies for fall semester
- Format: Lecture, discussion, weekly homework exercises (due
at the following class meeting), readings.
- Grades: Based on homework and participation. Monte Carlo grading may be used.
- Collaboration: You may work in pairs on the homework,
provided that each of you makes a real effort on each problem;
that you indicate who
you worked with; and that you write up your work separately.
- Communication: Assignments, notes, supplements, etc., will
be posted on this web page. I'll send you email from time to
time. Email is also the best way to reach me.
- Prerequisites: 600.271 (Automata and Computation Theory)
or permission of instructor.
- Postrequisites: None. That is, you're not required to
take the sequel (600.406) in the spring, although you are encouraged to!
Jason Eisner -
email@example.com - $Date: 2001/03/27 02:21:24 $