|Time and Location||T 11:45am-1:45pm, Room 6496|
Prof. Liang Huang (huang at cs.qc), Instructor|
James Cross (jcross at gc.cuny), TA
|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 self-contained (with slides and handouts) but you may find the following textbooks helpful:
You might also find these Coursera courses helpful:
|1||Sep 2||Intro to NLP and Rudiments of linguistic theory|
Intro to Python for text processing
|Unit 1: Sequences and Noisy-Channel|
|2||Sep 9||Basic automata theory. FSA (DFA/NFA) and FST.|
|3||Sep 16||FSAs/FSTs cont'd
The Noisy-channel model.
|HW1 out: FSA/FSTs, carmel; recovering vowels|
|RELIGIOUS HOLIDAY - NO CLASS|
SVO/SOV vs. infix/postfix; adv of SVO: less case-marking; adv of SOV: no attachment ambiguity
language model: basic smoothing: Laplacian, Witten-Bell, Good-Turing
language model (cont'd): information theory, entropy and perplexity, Shannon game
Viterbi decoding for HMM; transliteration
|hw2 out: English pronunciation, Japanese transliteration|