|
Syllabus
for Introduction to Computational Linguistics I: LIN386
Instructor
Contact Information
office hours: Thur/Fri, 1:30-3pm or by appointment
Graduate standing. Syntax I or consent of
instructor.
This page serves as the syllabus for this course. Jurafsky, D. and J. H. Martin, Speech and language processing: An
Introduction to Natural Language Processing, Computational Linguistics,
and Speech Recognition, Upper Saddle River, NJ: Prentice-Hall, 2000.
Selected readings from this text will be suggested, along with
relevant research papers.
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.
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:
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. Evaluation will be based on the project and homeworks. There will be
no exams.
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:
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.
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
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.
The course is designed to 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.
If you turn in your assignment late, expect points to be
deducted. Extensions will be
considered on a case-by-case basis, but in most cases they will not be
granted.
For other assignments, by default, 5 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.
You are encouraged to discuss assignments with classmates. But
all written work must be your own. Programming assignments must
be your own except for 2-person team assignments. All work
ideas, quotes, and code fragments that originate from elsewhere must
be cited according to standard academic practice. Students caught
cheating will automatically fail the course. If in doubt, ask the
instructor.
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, I will work with
you to make appropriate arrangements.
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.
Page maintained by Jason Baldridge. |