Syllabus
Instructor Contact Information
Jason Baldridgeoffice hours: Tues 2:30-4, Wed 1:30-3 or by appointment
office: Calhoun 510
phone: 232-7682
fax: 471-4340
email: jbaldrid@mail.utexas.edu
Katrin Erk
office hours: Wed 2-4, Thur 4-5 or by appointment
office: Calhoun 512
phone: 471-9020
fax: 471-4340
email: katrin.erk@mail.utexas.edu
Lab Information
location: Calhoun 514lab hours: Mon-Fri 9am-4:30pm
lab administrator: Praveen Balasubramanium
lab administrator office hours: Mon and Wed, 10-11:30am
phone: 471-9025
email: praveen_b@mail.utexas.edu
Prerequisites
Graduate standing. Syntax I or consent of instructor. Previous programming experience.
Syllabus and Text
This page serves as the syllabus for this course.
The official course text book:Selected readings from this text will be suggested, along with other readings made available for download or copying. You can see updates to some chapters of Jurafsky and Martin for the second edition of the book.
Assignments
Assignments will be updated on the assignments page. A tentative schedule for the entire semester is posted on the schedule page. Readings and exercises may change up one week in advance of their due dates.
To see your grades go to eGradebook.
Philosophy and Goal
The foremost goal of this course is to expose the student to the core techniques and applications of computational linguistics, with a primary focus on symbolic approaches. Students will gain an appreciation for the difficulties inherent in NLP and and understanding of strategies for tackling them. The course will address both theoretical and applied topics.
Some specific goals of the course are to enable students to:
- understand core algorithms and data structures used in NLP
- write non-trivial programs for NLP (using the Python programming language)
- build and use finite state transducers with XFST
- appreciate the relationship between linguistic theory and computational applications, especially with respect to syntax
- write computational grammars and analyze their adequacy
- complete a non-trivial NLP project and write a report in the format of submissions to computational linguistics conferences
This course presents an opportunity for students to gain experience with models and algorithms used in computational linguistics that underly practical applications while gaining an appreciation for the theoretical questions which they raise and which they can help us tackle. It will thus help prepare the student both for jobs in the industry and for doing original research in computational linguistics.
With respect to content, the goal of this course is to give the student an appreciation for the broad research topics currently being pursued in the field of computational linguistics. By the end of the course, the student should be able to
- identify and discuss the characteristics of different NLP techniques; and
- implement finite-state transducers and context-free parsers.
The course is designed to include key activities engaged in by computational linguistics researchers, including generation of ideas and programs, critical oral discussion of ideas, and written evaluation and presentation of ideas. This will help students make the transition to doing real research in the field. For those students with interest, it could possibly lead to subsequent research opportunities.
Content Overview
The field of computational linguistics has experienced significant growth in the last ten years. In addition to the hard work of researchers in the field in general, some of the most important factors behind this include the use of statistical techniques, the availability of large (sometimes annotated) corpora (including the web itself), and the availablity of relatively cheap and powerful computers. Together, these factors have played a major part in making computational linguistics very relevant in applied settings. This course will focus on many of the core technologies and techniques used in computational linguistics, such as finite-state methods, context-free grammars and parsing. It will also serve as an introduction to Python programming and programming for NLP.
This course provides a broad introduction to computational linguistics with a particular emphasis on core algorithms and data structures. Topics include:
- finite-state automata and transducers
- computational morphology
- part-of-speech tagging and chunking
- context-free grammars, categorial grammars, and parsing
- feature structures and unification
- computational semantics
- grammar engineering
There will be four programming assignments and a project. There will be a project proposal halfway through the semester with an opportunity for revisions in the form of a progress report. The grade for the final project will be based largely on the written report due at the end of the semester and a presentation on the project given during the final week of class.
The sequel to this course, Computational Linguistics II, addresses empirical methods (primarily statistical) and applications of natural language processing.
Course Requirements
Assignments (15% each):
Project proposal draft (5%):
Project progress report (5%):
Project final report (20%):
Project presentation (10%):
Extension Policy
Homework must be turned in on the due date in order to receive credit. Extensions will be considered on a case-by-case basis and only if the student asks for the extension before the deadline. In most cases they will not be granted.
In the event that an extension is granted, points will be deducted for lateness. By default, 10 points (out of 100) will be deducted for lateness, plus an additional 1 point for every 24-hour period beyond 2 that the assignment is late. For example, an assignment due at 2pm on Tuesday will have 5 points deducted if it is turned in late but before 2pm on Thursday. It will have 6 points deducted if it is turned in by 2pm Friday, etc.
The greater the advance notice of a need for an extension, the greater the likelihood of leniency.
Academic Dishonesty Policy
You are encouraged to discuss assignments with classmates. But all written work must be your own. Students caught cheating will automatically fail the course. If in doubt, ask the instructor.
Notice about students with disabilities
The University of Texas at Austin provides upon request appropriate academic accommodations for qualified students with disabilities. To determine if you qualify, please contact the Dean of Students at 471-6529; 471-4641 TTY. If they certify your needs, we will work with you to make appropriate arrangements.
Notice about missed work due to religious holy days
A student who misses an examination, work assignment, or other project due to the observance of a religious holy day will be given an opportunity to complete the work missed within a reasonable time after the absence, provided that he or she has properly notified the instructor. It is the policy of the University of Texas at Austin that the student must notify the instructor at least fourteen days prior to the classes scheduled on dates he or she will be absent to observe a religious holy day. For religious holy days that fall within the first two weeks of the semester, the notice should be given on the first day of the semester. The student will not be penalized for these excused absences, but the instructor may appropriately respond if the student fails to complete satisfactorily the missed assignment or examination within a reasonable time after the excused absence.
