Johns Hopkins Computer

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

Jason Eisner - - $Date: 2001/03/27 02:21:24 $