Methods in Computational Linguistics I
CUNY Graduate Center – Fall 2023

Synopsis

This course is the first of a two-semester series introducing modern software development. The intended audience are students interested in speech and language processing technologies, though the materials will be beneficial to all language researchers.

Objectives

Using the Python programming language, students will be able to write programs which count the frequencies of various linguistic phenomena in text. They will be able to process text stored in various structured data formats. They will come to understand how computers encode multilingual text. They will learn the basic principles of command-line design and master regular expressions.

Materials

Readings will be assigned throughout the term and posted to the course schedule, although there will be no official "textbook." Students are strongly encouraged to bring a laptop computer to the lecture and practicum. Students are also welcome to use the Computational Linguistics Laboratory (7400.13) for practice and assignments.

Assignments

Assignments will take the form of a small software development projects accompanied by a write-up describing the general approach taken and any challenges encountered. Students will usually be able to verify the technical correctness of their code by running a provided unit test. Students will also be graded on the readability of their code, and the quality of the write-up. We will use GitHub Classroom for assignment turn-in.

The final assignment will be an open-ended project which will involve collecting basic statistics (e.g., counts) of some linguistic phenomenon from either raw text or structured data. Students are encouraged to conceive of projects relevant to their research interests. Students should discuss project plans with the instructor during office hours to confirm that it is both feasible and of appropriate scope. Because of the open-ended nature of the final assignment, unit tests will not be provided.

Grading

80% of students' grades will be derived from the assignments; the remaining 20% will be reserved for participation and attendance. Assignments must be submitted on time or will receive a 0 grade (barring a documented emergency).

Accommodations

The instructor will attempt to provide all reasonable accommodations to students upon request. If you believe you are covered under the Americans With Disabilities Act, please direct accommodations requests to Vice President for Student Affairs Matthew G. Schoengood.

Attendance

Students are extended to attend all lectures and practica (in person). However, students who have reason to believe they may be contagious for COVID-19 or other infectious diseases should attend the course online after contacting the instructor. Other absences will not be excused, and the instructor reserves the right to tie grades to attendance records. The instructor and practicum leader are not responsible for reviewing materials missed to absence.

Integrity

In line with the Student Handbook policies on plagiarism, students are expected to complete their own work. However, a student is permitted to collaborate with another student during the coding phase of an assignment so long as they: do not share lines of code with each other, mutually disclose their collaboration in their write-ups, and do not collaborate at all on their write-ups.

The general ethos of the integrity policy is that actions which shortcut the learning process are forbidden while actions which promote learning are encouraged. Studying lecture notes together, for example, provides an additional avenue for learning and is encouraged. Using a classmate’s solution to a homework, however, is prohibited because it avoids the learning process entirely. If you have any questions about what is or is not permissible, please contact your instructor.

The instructor reserves the right to refer violations to the Academic Integrity Officer.

Respect

For the sake of the privacy, students are asked not to record lectures. Students are expected to be considerate of their peers and to treat them with respect during class discussions.

Links and references

Schedule

(Please note that this is subject to change.)


W0 Date Due Class Topics Slides Reading
T 8/29 Lect. Syllabus;
course plans
Slides-L1 Bird §1
Joyner §1
Shaw Preface
R 8/31 None
W1
T 9/5 Lect. Literals;
variables;
operators
Slides-L2 Joyner §2
Shaw §1-14
R 9/7 Prac. Notebook
Solutions
W2
T 9/12 HW1
due
Lect. Control flow Slides-L3 Joyner §3-3.3
Shaw §27-33
R 9/14 Prac. Notebook
Solutions
W3
T 9/19 HW2
due
Lect. Indexing Slides-L4 Joyner §4.2-4.3
Shaw §34
Shaw §36-38
R 9/21 Prac. Notebook
Solutions
W4
T 9/26 HW3
due
Lect. Functions Slides-L5 Joyner §3.4
R 9/28 Prac. Notebook
Solutions
W5
T 10/3 Lect. File I/O;
Modules;
Function Stubs
Slides-L6 Joyner §4.4
Shaw §15-17
Bird §3-3.2
R 10/5 Prac. Notebook
Solutions
W6
T 10/10 HW4
due
No class
(GC has a "Monday"
schedule today)
R 10/12 Lect. Text encoding Slides-L7 Bird §3.3
Gorman
Spolsky
chardet
unicodedata
W7
T 10/17 Lect. Searching;
Sorting
Slides-L8
R 10/19 Prac. Notebook
Solutions
Joyner §5.2
W8
T 10/24 HW5
due
Lect. More Sorting;
Comprehensions
Slides-L9
R 10/26 Prac. Notebook
Solutions
W9
T 10/31 Lect. Binary Search Trees;
Dictionaries;
Hash-Based Containers
Slides-L10 Kuchling
Joyner §4.5
Shaw §39
R 11/2 Prac. Notebook
Solutions
W10
T
(election🇺🇸day)
11/7 Lect. Regular expressions;
Command-line interface
Slides-L11 Regex
Unix for Poets
R 11/09 HW6
due
(12th)
Prac. Notebook
Solutions
W11
T 11/14 Lect. Modules;
CSV; TSV;
JSON; YAML
Slides-L12 argparse
csv
json
R 11/16 Prac. Notebook
Solutions
W12
T 11/21 HW7
due
Lect. Classes Slides-L13 Joyner §5.1
Shaw §40-44
R 11/23 No class (Thanksgiving)
W13
T 11/28 [Term
paper
specs
]
Lect. Unit testing Slides-L14 unittest
R 11/30 Prac. Notebook
Solutions
W14
T 12/5 HW8
due
Lect. Recursion; NLTK Slides-L15 Bird §5
R 12/7 Special wrap up: walking through real comp ling research
W15 No class (Reading Days)
W16 12/20 Term paper due