|
This is a hands-on introductory course in computational linguistics,
starting from formal systems and graduating to tackling fragments of
natural language. Both classroom lectures and computer laboratory
exercises to reinforce the material will be used.
Syllabus See webpages of previous years. Email List Hosted at listserv.arizona.edu The name of the list is LING388@LISTSERV.ARIZONA.EDU
Software We will use SWI-Prolog (freely available) in the computer laboratory classes. Students will implement finite state automata, transducers, and parsers based on grammar rules in a series of computer laboratory exercises. Other software used in homeworks include Microsoft Word (for regular expression search). We will also build a mini-machine translator. |
Instructor: Sandiway Fong sandiway@email.arizona.edu
Office: Douglass 311
|
|
| Date | Lecture Notes | Number of Slides |
Audio | Topic | |
|---|---|---|---|---|---|
| Powerpoint | |||||
| 8/22 | lecture1.pdf | lecture1.ppt | 26 | Administrivia and Introduction | |
| 8/24 | lecture2.pdf | lecture2.ppt | 18 | Computer Lab Class in SS 224. Introduction to concepts and how to get started with Prolog. | |
| 8/29 | lecture3.pdf | lecture3.ppt | 18 | Prolog lists. | |
| 8/31 | lecture4.pdf | lecture4.ppt | 15 | Recursion and Prolog lists. Prolog's computation rule. | |
| Date | Lecture Notes | Number of Slides |
Audio | Topic | |
|---|---|---|---|---|---|
| Powerpoint | |||||
| 9/5 | lecture5.pdf | lecture5.ppt | 20 | Homework 1 review. Recursion and Prolog lists contd. append/3. | |
| 9/7 | lecture6.pdf | lecture6.ppt | 14 | Updated Friday 8th 11:45am
Computer Lab Class. Homework 2 |
|
| 9/12 | lecture7.pdf | lecture7.ppt | 12 | More with Prolog. Arithmetic. Natural numbers. Even and odd numbers. Output. If-then-else. | |
| 9/14 | No class today | ||||
| 9/19 | lecture8.pdf | lecture8.ppt | 20 | Regular Expressions. GREP. Microsoft Word regular expression search. | |
| 9/21 | lecture9.pdf | lecture9.ppt | 26 | Homework 2 review. Homework 3.
Data file: WSJ9_040.txt |
|
| 9/26 | lecture10.pdf | lecture10.ppt | 25 | Prolog and FSA | |
| 9/28 | No class today | ||||
| Date | Lecture Notes | Number of Slides |
Audio | Topic | |
|---|---|---|---|---|---|
| Powerpoint | |||||
| 10/3 | lecture11.pdf | lecture11.ppt | 22 | Removing determinism: sets of states construction. Lambda-transitions: elimination and Prolog implementation. | |
| 10/5 | lecture12.pdf | lecture12.ppt | 17 | Computer Lab class. Homework 4.
Updated: 4:40pm 10/5 |
|
| 10/10 | lecture13.pdf | lecture13.ppt | 21 | What is a grammar?. Derivations. Definite Clause Grammars (DCG). Writing grammars in Prolog. | |
| 10/12 | lecture14.pdf | lecture14.ppt | 24 | Computer Lab class. Writing grammars. Building parse trees. VP Idioms. Returning literal and idiomatic parses. | |
| 10/17 | lecture15.pdf | lecture15.ppt | 20 | A note on idioms. Lexical features in grammar rules. Using an extra parameter for Determiner-Noun agreement. | |
| 10/19 | lecture16.pdf | lecture16.ppt | 20 | Homework 3 review. Homework 5 on determiner/quantifier noun agreement. | |
| 10/24 | lecture17.pdf | lecture17.ppt | 19 | Implementating passivization: object in subject position, passive morphology constraint, and the option of a by-phrase subject. Subject-verb number agreement. | |
| 10/26 | lecture18.pdf | lecture18.ppt | 15 | Computer Lab Class. Implementating passivization. Coping with left recursion: the idea of exploiting lookahead. Counting by marking. Implementation subject-verb number agreement.
Updated: 5:45pm 10/26 |
|
| 10/31 | lecture19.pdf | lecture19.ppt | 26 | Homework 4 Review. Regular Grammars. | |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 11/2 | lecture20.pdf | lecture20.ppt | 12 | Homework 6.
Updated: (typos corrected) 5:40pm 11/2 |
| 11/7 | lecture21.pdf | lecture21.ppt | 19 | Review: equivalence under computation. The limits of finite state technology. |
| 11/9 | lecture22.pdf | lecture22.ppt | 25 | Computer Lab Class. Calling Prolog from DCG rules. The univ =.. predicate. Predicate-argument structure. Extra arguments for counting. |
| 11/14 | lecture23.pdf | lecture23.ppt | 25 | DCG for Japanese. Handling wh-NP questions. |
| 11/16 | lecture24.pdf | lecture24.ppt | 20 | DCG for English. Handling wh-NP questions. Insertion of wh-traces. |
| 11/21 | lecture25.pdf | lecture25.ppt | 38 | Putting the DCGs for English and Japanese together. The translation engine. Tree-to-tree mapping. Mapping via predicate-argument structure. |
| 11/23 | Thanksgiving: no class. | |||
| 11/28 | lecture26.pdf | lecture26.ppt | 35 | Review of the translation engine. Idioms. Homework 7.
Files: e.pl j.pl t.pl |
| 11/30 | lecture27.pdf | lecture27.ppt | 5 | Homework 7 help. How does Google translate do on the homework questions? |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 12/5 | lecture28.pdf | lecture28.ppt | 7 | Class evaluations. A look back. Other courses. Homework 7 help. |