Time and Location  T 11:45am1:45pm, Room 6496 
Personnel 
Prof. Liang Huang (huang at cs.qc), Instructor James Cross (jcross at gc.cuny), TA 
Office Hours (TBD) 
Additional office hours available before HW dues and exams. 
Prerequisites  CS: algorithms and datastructures (especially recursion and dynamic programming).
solid at programming (in Python). basic understanding of formal language and automata theory. Ling: minimal understanding of morphology, phonolgy, and syntax (we'll review these). Math: good understanding of basic probability theory. 
Textbooks  This course is selfcontained (with slides and handouts) but you may find the following textbooks helpful:

MOOCs 
You might also find these Coursera courses helpful:

Grading 

Week  Date  Topics  Homework/Quiz 
1  Sep 2  Intro to NLP and Rudiments of linguistic theory Intro to Python for text processing  Ex0 
Unit 1: Sequences and NoisyChannel  
2  Sep 9  Basic automata theory. FSA (DFA/NFA) and FST.  
3  Sep 16  FSAs/FSTs cont'd
The Noisychannel model.  HW1 out: FSA/FSTs, carmel; recovering vowels 
RELIGIOUS HOLIDAY  NO CLASS  
5  Sep 30 
hw1 discussions
SVO/SOV vs. infix/postfix; adv of SVO: less casemarking; adv of SOV: no attachment ambiguity simple pluralizer language model: basic smoothing: Laplacian, WittenBell, GoodTuring  Quiz 0
ex1 out 
6  Oct 7 
language model (cont'd): information theory, entropy and perplexity, Shannon game
Viterbi decoding for HMM; transliteration  hw2 out: English pronunciation, Japanese transliteration 