COMP 4221 - Fall 2015
You are welcome to knock on the door of the instructor any time. The TAs' office hours are posted at http://course.cs.ust.hk/comp4221/ta/.
Welcome to COMP4221 for UGs and COMP5221 for PGs! (The COMP4221 course was formerly called COMP300H and COMP326, and the COMP5221 course was formerly called COMP526.) Tutorials will begin after Week 2.
Always check the Discussion Forum for up-to-the-minute
Discussion forum is at http://comp151.cse.ust.hk/~dekai/content/?q=forum/3.
Always read before asking/posting/emailing your question. This forum is based
on modern software, instead of using the old clunky ITSC newsgroup. You must
register for your account at the first lecture, tutorial, or lab.
Course home page is at http://www.cs.ust.hk/~dekai/4221/.
Tutorial info is at http://course.cs.ust.hk/comp4221/ta/.
Abbreviated Course Catalog Description
COMP 4221. Human language technology for text and spoken language. Machine learning, syntactic parsing, semantic interpretation, and context-based approaches to machine translation, text mining, and web search.
Human language technology for processing text and spoken language. Fundamental machine learning, syntactic parsing, semantic interpretation, and context models, algorithms, and techniques. Applications include machine translation, web technologies, text mining, knowledge management, cognitive modeling, intelligent dialog systems, and computational linguistics.
- Introduction to Text Alignment: Statistical Machine Translation Models from Bitexts to Bigrammars (forthcoming), by Dekai WU. Springer, 2013.
- Artificial Intelligence: A Modern Approach (2nd Edition), by Stuart RUSSELL and Peter NORVIG. Prentice-Hall, 2003. ISBN-13: 978-0137903955.
- Structure and Interpretation of Computer Programs (2nd edition),
by Harold ABELSON and Gerald Jay SUSSMAN,
with Julie SUSSMAN. MIT Press, 1984. ISBN-10:
Full text and code are available online at no cost for the Scheme book (Structure and Interpretation of Computer Programs) at http://mitpress.mit.edu/sicp/.
All materials submitted for grading must be your own work. You are advised against being involved in any form of copying (either copying other people's work or allowing others to copy yours). If you are found to be involved in an incident of plagiarism, you will receive a failing grade for the course and the incident will be reported for appropriate disciplinary actions.
Warning: sophisticated plagiarism detection systems are in operation!
CollaborationYou are encouraged to collaborate in study groups. However, you must write up solutions on your own. You must also acknowledge your collaborators in the write-up for each problem, whether or not they are classmates. Other cases will be dealt with as plagiarism.
The course will be graded on a curve, but no matter what the curve is, I guarantee you the following.
|If you achieve||85%||you will receive at least a||A||grade.|
Your grade will be determined by a combination of factors:
ExaminationsNo reading material is allowed during the examinations. No make-ups will be given unless prior approval is granted by the instructor, or you are in unfavorable medical condition with physician's documentation on the day of the examination. In addition, being absent at the final examination results in automatic failure of the course according to university regulations, unless prior approval is obtained from the department head.
There will be one midterm worth approximately 20%, and one final exam worth approximately 25%.
Science and engineering (including software engineering!) is about communication between people. Good participation in class and/or the online forum will count for approximately 5%.
All assignments must be submitted by 23:00 on the due date. Scheme programming assignments must run under Chicken Scheme on Linux. Assignments will be collected electronically using the automated CASS assignment collection system. Late assignments cannot be accepted. Sorry, in the interest of fairness, exceptions cannot be made.
Programming assignments will account for a total of approximately 50%.
All information for tutorials is at http://course.cs.ust.hk/comp4221/ta/.
|2015.09.09||2||Lecture||Does God play dice? Assumptions: scientific method, hypotheses,
models, learning, probability
Admiinistrivia (honor statement, HKUST classroom conduct)
|2015.09.14||3||Lecture||Languages of the world|
|2015.09.15||3||Lecture||Linguistic relativism and the Sapir-Whorf hypothesis; inductive bias, language bias, search bias; the great cycle of intelligence [18:00 LSK 1009]|
|2015.09.21||4||Lecture||Is machine translation intelligent? Interactive simulation|
|2015.09.22||4||Lecture||Learning to translate: engineering, social, and scientific motivations [at tutorial]|
|2015.09.23||4||Lecture||"It's all Chinese to me": linguistic complexity; challenges in modeling translation|
|2015.09.28||5||Holiday||Day after Mid-Autumn Festival|
|2015.09.29||5||Lecture||Evaluating translation quality: adequacy, fluency, fidelity, speed, memory, n-grams, BLEU [at tutorial]|
|2015.09.30||5||Lecture||Evaluating translation quality: case frames, semantic frames, semantic role labeling, predicate-argument structure|
|2015.10.05||6||Lecture||Evaluating translation quality: alignment; aligning semantic frames: Interactive exercise|
|2015.10.06||6||Lecture||Evaluating translation quality: HMEANT [at tutorial]|
|2015.10.07||6||Lecture||Evaluating translation quality: MEANT|
|2015.10.13||7||Lecture||Bag translation [at tutorial]|
|2015.10.14||7||Lecture||Markov models, n-gram models|
|2015.10.19||8||Lecture||Uninformed search; Dijkstra's shortest path algorithm|
|2015.10.20||8||Lecture||Anagrams with replacement; Chinese anagrams[at tutorial]|
|2015.10.21||8||Holiday||Chung Yeung Festival|
|2015.10.27||9||Lecture||HMM/SFSA/WFSA: hidden Markov models, finite-state models; parts of speech|
|2015.11.09||11||Lecture||HMM/SFSA/WFSA: generation vs recognition/parsing; converting state-based to transition based FSAs|
|2015.11.11||11||Lecture||Segmental HMM/SFA/WFSAs; WFST: finite-state translation models|
|2015.11.16||12||Lecture||HMM/SFSA/WFSA: formalization for Viterbi decoding and evaluation [slides]|
|2015.11.17||12||Lecture||HMM/SFSA/WFSA: forward algorithm, backward algorithm, expectations|
|2015.11.18||12||Lecture||HMM/SFSA/WFSA: forward-backward algorithm, expectation maximization (EM) algorithm|
|2015.11.23||13||Lecture||Alignment [article]; HMM alignment; Intro to functional programming and Scheme [slides]|
|2015.11.25||13||Lecture||AND/OR graphs; FSGs (finite-state grammars); segmental FSGs; CFGs (context-free grammars); segmental CFGs|
|2015.11.30||14||Lecture||Transduction grammars; inversion transduction grammars [article]; The magic number 4: how the generative capacity of ITGs explains the evolution of semantic frame structure [article]|
|2015.12.18||15||Exam||COMP4221 Final [G010, CYT Bldg, 12:30-15:30]|
- Scheme slides
- Scheme R5RS [html, pdf]
- Chicken Scheme 3.4 manual
- Chicken Scheme 3 eggs
- COMP221 A1
- COMP221 A2
Last updated: 2015.12.01