Daily class schedule

CSCI 333
Natural Language Processing
Fall, 2016

week
M
W
F
reading in Jurafsky and Martin
8/29-9/2
Introduction.
Regular expressions and FSAs.
Morphology.
1.1-1.7, 2.1-2.4, 3.1-3.3
9/5-9/9
Labor Day
Finite state transducers.
Minimum edit distance
3.4-3.11
9/12-9/16
Statistical language modeling.  N-grams.
the N-gram model.
Perplexity.  Smoothing.
4.1-4.7
9/19-9/23
Parts of speech in English.  Part of speech tagging.
Hidden Markov models for tagging.
The forward algorithm.
5.1-5.7, 6.1-6.3
9/26-9/30
The Viterbi algorithm.
Syntax:  formal grammars for English.
More on grammars.
6.4-6.5, 12.1-12.6
10/3-10/7
Parsing. The CKY algorithm.
Review. 13.1-13.4.1
10/10-10/14
Midterm exam.
Yom Kuppur
The Earley algorithm.
13.4.2
10/17-10/21
Fall Break
10/24-10/28
Chunking. Statistical parsing.
Dependency grammars.
13.5, 14.1-14.7, 12.7
10/31-11/4
More on dependency grammars.
Features and unification.
Semantic analysis
15.1-15.5, 17.1-17.4
11/7-11/11
Computational semantics.
More on computational semanics.
Unification-based semantics.
18.1-18.4
11/14-11/18
Computational lexical semantics.
Word similarity and hyponyms.
Computational discourse.
19.1-19.3, 20.1-20.8
11/21-11/25
Pronomial anaphora resolution.
Information extraction.
Thanksgiving Break
21.1-21.6, 22.1-22.3
11/28-12/2
Machine translation.
Statistical machine translation.
Student presentations.
25.1-25.5
12/5-12/9
Student presentations.
Student presentations.
Review for final exam.

Final Exam (Saturday, December 17, 9-11 am)