|
This is a hands-on introductory course in computational linguistics,
starting from formal systems and graduating to tackling fragments of
natural language.
Some programming using Perl and SWI-Prolog will be required. Syllabus See webpages of previous years. Email List Hosted at listserv.arizona.edu The name of the list is LING388@LISTSERV.ARIZONA.EDU
Software Students are expected to install Perl and SWI-Prolog, both freely available on their own computers or use the computer lab facilities in S SCI 224. We will also build a mini-machine translator. |
Instructor: Sandiway Fong sandiway@email.arizona.edu
Office: Douglass 311
|
|
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 8/21 | lecture1.pdf | lecture1.ppt | 27 | Administrivia and Introduction.
Homework: Install Perl and Prolog. |
| 8/23 | lecture2.pdf | lecture2.ppt | 19 | Regular Expressions (regexp). Perl and regexp. |
| 8/28 | lecture3.pdf | lecture3.ppt | 13 | Running Perl. More on Perl: variables, conditionals. String comparison vs. numeric comparison. |
| 8/30 | lecture4.pdf | lecture4.ppt | 13 | More on Perl and regexps: iterators. regexp: multiple matches and grouping. Homework 1.
(Slides modified after class.)
Data file: wsj500.txt |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 9/4 | lecture5.pdf | lecture5.ppt | 11 | Perl and regexp: hierarchical grouping, multiple matching, pos function and substitutions. |
| 9/6 | lecture6.pdf | lecture6.ppt | 22 | Finite State Automata (FSA). |
| 9/11 | lecture7.pdf | lecture7.ppt | 14 | Finite State Automata contd.: empty transitions, non-deterministic and deterministic. Transforming non-determinstic FSA (NDFSA) into (deterministic) FSA. Homework 2 |
| 9/13 | lecture8.pdf | lecture8.ppt | 11 | Finite State Transducers. Worked examples: binary number arithmetic, and -ize verb formation. Homework #3: Perl regexp search-and-replace equivalent. |
| 9/18 | lecture9.pdf | lecture9.ppt | 13 | Homework 1 review. Homework 2 due today. More on FST. |
| 9/20 | lecture10.pdf | lecture10.ppt | 13 | Homework 2 review. Homework 3 due today. Regular grammars. SWI-Prolog. DCG system. |
| 9/25 | lecture11.pdf | lecture11.ppt | 14 | Homework 3 review. Regular grammars. Equivalence between right recursive regular grammars and FSA. |
| 9/27 | lecture12.pdf | lecture12.ppt | 12 | Pre-midterm review. |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 10/2 | lecture13.pdf | lecture13.ppt | Midterm exam. | |
| 10/4 | Midterm exam review. | |||
| 10/9 | lecture14.pdf | lecture14.ppt | 15 | Midterm graded and returned. Parsing and DCG. Top-down and bottom derivations via sentential forms. Prolog uses top-down, leftmost derivations. Variable substitution in lists and grammars. |
| 10/11 | lecture15.pdf | lecture15.ppt | 26 | Translation of DCG rules into underlying Prolog rules. Computing a parse tree using an extra argument. |
| 10/16 | lecture16.pdf | lecture16.ppt | 23 | Idioms. Extra argument for agreement. |
| 10/18 | No class today | |||
| 10/23 | lecture17.pdf | lecture17.ppt | 14 | More agreement. Determiner-noun. Quantifiers. Count/Mass and bare nouns phrases. Homework Exercise 2: Due next Tuesday. |
| 10/25 | lecture18.pdf | lecture18.ppt | 20 | Implementating passivization: object in subject position, passive morphology constraint, and the option of a by-phrase subject. Subject-verb number agreement (partially implemented).
Slides updated 11am 10/25 |
| 10/30 | lecture19.pdf | lecture19.ppt | 20 | Handling left recursive adjunction rules directly in Prolog. Adding lookahead detection. Modifying the input sentence. |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 11/1 | lecture20.pdf | lecture20.ppt | 13 | NP rules: proper nouns and bare plurals. Subject-verb agreement. Case Constraint. Homework 5. |
| 11/6 | lecture21.pdf | lecture21.ppt | 18 | Predicate argument structure. Thematic relations. Building predicate argument structures in Prolog. |
| 11/8 | lecture22.pdf | lecture22.ppt | 30 | Building predicate argument structures in Prolog: the intransitive verb case. Japanese grammar. |
| 11/13 | lecture23.pdf | lecture23.ppt | 22 | DCG for English. Handling wh-NP questions. Insertion of wh-traces. |
| 11/15 | lecture24.pdf | lecture24.ppt | 25 | DCG for English: multiple wh-questions. Language translator: tree-to-tree mapping. |
| 11/20 | lecture25.pdf | lecture25.ppt | 21 | Language translator: tree-to-tree mapping. Wh-question cases.
Language translator based on predicate-argument structure mapping. |
| 11/27 | lecture26.pdf | lecture26.ppt | 22 | Adding to the predicate argument-based translator. Exercise: (1) tense, (2) yes-no questions and (3) English idioms. |
| 11/29 | lecture27.pdf | lecture27.ppt | 13 | Modifying the translator: (1) yes-no questions and (2) Japanese idioms. |
| Date | Lecture Notes | Number of Slides |
Topic | |
|---|---|---|---|---|
| Powerpoint | ||||
| 12/4 | lecture28.pdf | lecture28.ppt | 18 | Take-home final. Due Thursday.
Code: t.prolog |