Computation and Linguistic Analysis
Course goals This course will introduce students to computational linguistics (CL) and natural language processing (NLP), a field combining insights from linguistics and computer science. The course is concerned with concepts, models, and algorithms to interpret, generate, and learn natural languages, as well as applications of NLP.
We will look at these different levels of linguistic analysis: morphology, morpho-syntax, syntax, lexical semantics, and to some extent compositional semantics. In so doing, we will move from simple representations of language, such as finite-state techniques and n-gram analysis, to more advanced representations, such as those found in context-free and unification-based parsing. Some emphasis will be placed on parsing techniques in this course.
Course website: http://cl.indiana.edu/~md7/13/545/
|or by appointment|
|Project||26%||due Wed. May 1 @ 5pm|
Academic Misconduct: Academic misconduct is not allowed in this course. The Indiana University Code of Student Rights, Responsibilities, and Conduct (http://dsa.indiana.edu/Code/) defines academic misconduct as “any activity that tends to undermine the academic integrity of the institution . . . Academic misconduct may involve human, hard-copy, or electronic resources . . . Academic misconduct includes, but is not limited to . . . cheating, fabrication, plagiarism, interference, violation of course rules, and facilitating academic misconduct” (II. G.1-6).
Students with Disabilities: Students who need an accommodation based on the impact of a disability should contact me to arrange an appointment as soon as possible to discuss the course format, to anticipate needs, and to explore potential accommodations.
I rely on Disability Services for Students for assistance in verifying the need for accommodations and developing accommodation strategies. Students who have not previously contacted Disability Services are encouraged to do so (812-855-7578; http://www.indiana.edu/~iubdss/).
|Jan.||7||Intro to class (.pdf, 2x3.pdf)||ch. 1|
|9||Regular expressions & Automata (.pdf, 2x3.pdf)||ch. 2|
|14||Regular expressions & Automata|
|16||Morphology (.pdf, 2x3.pdf)||ch. 3|
|21||No class, MLK Day|
|23||Finite-State Transducers (FSTs)||HW1 due|
|28||FST work (.pdf, 2x3.pdf)|
|Feb.||4||Composition (.pdf, 2x3.pdf)||Roark&Sproat, ch. 2||HW2 due|
|6||N-grams (.pdf, 2x3.pdf)||ch. 4|
|11||Part-of-speech (POS) tagging (.pdf, 2x3.pdf)||ch. 5|
|13||Basics of set theory (.pdf, 2x3.pdf)|
|18||Context-Free Grammars (CFGs) (.pdf, 2x3.pdf)||ch. 12||HW3 due|
|20||CFGs & Parsing (.pdf, 2x3.pdf)||ch. 13|
|25||CFGs & Parsing||HW4 due|
|27||More on chart parsing|
|Mar.||4||Prolog (.pdf, 2x3.pdf) Code: examples.pl|
|6||Definite clause grammars, Code: grammar.pl||HW5 due|
|11||No class, Spring Break|
|13||No class, Spring Break|
|18||Unification-based parsing (.pdf, 2x3.pdf)||ch. 15|
|20||Unification-based parsing (.pdf, 2x3.pdf)|
|25||Grammar complexity (.pdf, 2x3.pdf)||ch. 16|
|27||sec. 13.5||HW6 due|
|Apr.||1||Dependency parsing (.pdf, 2x3.pdf)|
|8||Semantics (Knowledge-based) (.pdf, 2x3.pdf)||ch. 17||HW7 due|
|10||Semantic analysis||ch. 18|
|17||Lexical semantics||ch. 19||HW8 due|
|May||1||Written projects due|
Disclaimer This syllabus is subject to change and shift—and most likely will. All important changes will be made in writing, with ample time for adjustment.