Grammars, Automata and Parsing
Lecturer(s):Mark Johnson (Brown University)
Type:Advanced Course
Section:Language and Computation
Time: 11.00-12.30 (Slot 2)
Room:EM 3.36


This course provides a unified view of grammars, automata, parsing and
inference from HMMs and finite state machines, through (P)CFGs to MaxEnt
or log-linear models for context-sensitive grammar.   It covers both
categorical and stochastic approaches.  The course starts with finite
state machines and HMMs, then moves to (Probabilistic) Context-Free
Grammars and (Stochastic) Push-down Automata, and ends with MaxEnt or
log-linear models and Context-Sensitive Grammars.

It also covers inference methods for the stochastic approaches, focusing
mainly on Maximum Likelihood estimation.  The course covers estimation
from visible training data, and estimation from partially labelled and
unlabelled training data using Expectation Maximization, including the
Forward-Backward Algorithm and the Inside-Outside Algorithm.


© ESSLLI 2005 Organising Committee 2004-12-01