COMP4221 Introduction to Natural Language Processing, Spring 2020, HKUST

edited

Course organization

Logistics

Announcements

All lectures and tutorials will be held ONLINE LIVE INTERACTIVELY at the regularly scheduled times until further notice due to the coronavirus.

Times and places

Lecture 1, TuTh 12:00-13:20, Rm 2407 (L17-18)

Tut 1A F 09:30-10:20, Rm 1104 (Academic Concourse)

You are welcome to knock on the door of the instructor any time. The TA's office hours are posted at http://course.cs.ust.hk/comp4221/ta/.

Tutorials

All information for tutorials is at http://course.cs.ust.hk/comp4221/ta/.

Description

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.

Course description

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.

Learning objectives

At the end of the Natural Language Processing course, you will have achieved the following outcomes.

1. General
   1. Possess solid understanding of the fundamental concepts of natural language processing
   2. Possess solid understanding of the fundamental concepts of machine translation, and grasp how it stress tests all aspects of human intelligence and language processing
2. Transduction
   1. Know foundational input-output formulations of transduction, such as alignment, chunking, classification, dependency relations, and parsing
   2. Understand the relationship between noisy channel and loglinear models of string transduction, and their Bayesian interpretations
3. Syntax
   1. Understand the relationship between word segmentation and phrasal lexicons, the relationship to transduction and alignment, and associated algorithms
   2. Understand the relationship between traditional grammatical formalisms versus stochastic and weighted grammars
   3. Understand the strengths and weaknesses of part-of-speech models, and associated tagging algorithms
   4. Understand the various fundamental approaches to parsing, and how they deal with syntactic ambiguity
4. Alignment
   1. Understand how bilingual models of syntax generalize upon monolingual models to improve learnability
   2. Understand the combinatorial and empirical trade-offs between various learning models of alignment and compositionality, and their associated algorithms
   3. Understand the core methods for inducing lexicons, translation lexicons, phrasal translation lexicons, as well as permutation and reordering models
5. Decoding
   1. Understand the combinatorial and empirical trade-offs between various runtime models for translation, and their associated algorithms
   2. Understand how bilingual transduction models generalize upon monolingual parsing models
6. Semantics
   1. Understand lexical semantics models for word sense disambiguation, their relationship to phrasal lexicons and transduction, and associated ambiguity resolution algorithms
   2. Understand lexical semantics models for semantic frames (predicate-argument structures), and associated semantic role labeling algorithms
      

Textbooks

• Introduction to Text Alignment: Statistical Machine Translation Models from Bitexts to Bigrammars (forthcoming), by Dekai WU. Springer.
• 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: 0-262-01077-1. 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/.

Policies

Honor policy

To receive a passing grade, you are required to sign an honor statement acknowledging that you understand and will uphold all policies on plagiarism and collaboration.

Plagiarism

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.

University policy requires that students who cheat more than once be expelled. Please review the cheating topic from your UST Student Orientation.

Warning: sophisticated plagiarism detection systems are in operation!

Collaboration

You 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.

Grading

Course grading will be adjusted to the difficulty of assignments and exams. Moreover, I guarantee you the following.

Your grade will be determined by a combination of factors:

Examinations

No 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%.

Participation

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%.

Assignments

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%.

Required readings

Any linked material (unless labeled "Supplementary references") is required reading that you are responsible for.

Syllabus

An outline of the topics is in the calendar below.

Topics