Schedule
From 11711
Contents
Introduction
Date  Topic  Instructor  Reading  Homework 
T 9/1  Introduction to 11711  Frederking  
R 9/3  Introduction to NLP  Ballesteros 
Part I: FiniteState NLP
Date  Topic  Instructor  Reading  Homework 
T 9/8  DFAs and NFAs  Dyer  Hopcroft & Ullman: 1 (all), 2.1, 2.2  
R 9/10  Regular Expressions  Dyer  Hopcroft & Ullman: 3 (all)  
F 9/11  Recitation: Example DFA Proof  Dyer  
T 9/15  Finite state properties & finite state transducers  Dyer  M. Mohri. FiniteState Transducers in Language and Speech Processing. (skim).  
R 9/17  Finite state morphology  Mortensen  
T 9/22  Statistical Language Modelling  Rosenfeld  
R 9/24  Weighted Finite State Transducers  Dyer  Notes on Weighted FSTs  
F 9/25  Recitation: Installing OpenFST and probability review  Dyer  
T 9/29  Intro to HMMs  Dyer 


R 10/1  HMM estimation  Dyer  
F 10/2  Recitation: Viterbi Algorithm  Vivian  
T 10/6  Dyer  
R 10/8  Semirings and Generalized Path Sums  Dyer  
F 10/9  Recitation on semirings  Austin  
T 10/13  Ballesteros  
R 10/15  PDAs and their equivalence to CFGs  Ballesteros  
F 10/16  Recitation: Exam Review  TAs  
T 10/20  Midterm Exam 
Part II: Parsing and ContextFree Languages
Date  Topic  Instructor  Reading  Homework 
R 10/22  Introduction to parsing: top down vs. bottom up, exponential space of parses, ambiguity, charts, CKY and CNF  Ballesteros 


F 10/23  No Recitation: Midsemester Break  
T 10/27  Earley's algorithm and ShiftReduce PhraseStructure algorithm.  Ballesteros 


R 10/29  PCFGs, weighted CFGs, and weighted CKY, insideoutside  Ballesteros 


F 10/30  Recitation: CFG conversions  Vivian  
T 11/3  Parameter estimation from treebanks, Markovization, etc  Ballesteros 


R 11/5  Dependency syntax introduction: linguistics, relationship to phrase structure syntax.  Ballesteros 


F 11/6  Recitation: insideoutside algorithm for PCFGs.  Austin  
T 11/10  Transitionbased dependency parsing  Ballesteros 


R 11/12  Arcfactored models, Eisner's algorithm, Spanning tree parsing, Graphbased dependency parsing  Ballesteros 


F 11/13  Recitation: Transitionbased dependency parsing  Vivian  
T 11/17  Weighted logic programs, semirings, agenda algorithm  Dyer  
R 11/19  Feature Structures and Unification  Frederking  Jurafsky and Martin: Ch. 15 (Note: errors in textbook)  
F 11/20  Recitation: Unification  Austin 
Part III: Semantics and Discourse
Date  Topic  Instructor  Reading  Homework 
T 11/24  First order predicate calculus  Frederking  Jurafsky and Martin: 17 and 18 (Note: errors in textbook)  
R 11/26  No Class: Thanksgiving  
F 11/27  No Recitation: Thanksgiving  
T 12/1  CCGs and Lambda Calculus  Frederking 
Jurafsky and Martin: Section 12.7.2. And see this tutorial online (especially section on "Templatebased GENLEX"). See also the paper Steedman for a brief introduction, and Steedman and Baldridge for more details. Lambda calculus was in Ch. 17 and 18. 

R 12/3  Lexical Semantics: PropBank, PredArg, and Distributions  Frederking 
Jurafsky and Martin: 19 and 20.620.9 (Note: errors in textbook) 

F 12/4  Recitation: CCGs  Vivian  
T 12/8  Discourse Structure, Coreference Resolution  Frederking  Jurafsky and Martin: 21  
R 12/10  Current NLP at CMU and LTI/Overview  Instructors 


F 12/11  Recitation: Final exam review  TAs  
M 12/14  Final exam 14 p.m. Location Doherty A302 