Schedule

Schedule and Readings

Week	Date	Topic	Readings	Totals (approximate)
Week 1	Tuesday, Jan 15		Schwartz, Syllabus (~4 pages)	4 pages of readings
Week 1	Thursday, Jan 17		Lees-Miller, An Interactive Introduction to LaTeX (part 1) (p. 1‑21) Lees-Miller, An Interactive Introduction to LaTeX (part 2) (p. 1‑23) Lees-Miller, An Interactive Introduction to LaTeX (part 3) (p. 1‑34) Wikibooks, LaTeX Wikibook (p. 1‑748)	826 pages of optional readings
Week 2	Tuesday, Jan 22		Sproat, Introduction (p. xi‑xv) Sproat, Chapter 1 - "Applications of computational morphology" (p. 1‑14)	19 pages of readings
Week 2	Thursday, Jan 24		Sproat, Chapter 2.1 - "The nature of morphology: Introduction" (p. 15‑19) Beesley and Karttunen, Preliminaries (p. xii‑xviii) Beesley and Karttunen, Chapter 1.1-1.4 - "A Gentle Introduction, part 1" (p. 1‑17) Gansner et al., Section 1 - "Drawing graphs with dot" (p. 1‑4) Schwartz, Video lecture: Creating graphviz graphs with dot (0:00‑13:23)	32 pages of readings 13.4 minutes of video
Week 3	Tuesday, Jan 29		Beesley and Karttunen, Chapter 1.5-1.9 - "A Gentle Introduction, part 2" (p. 17‑37) Sproat, Chapter 2.2 - "Functions of morphology" (p. 19‑43)	46 pages of readings
Week 3	Thursday, Jan 31		Hulden, Morphological analysis with FSTs (~25 pages) Hulden, Foma: a finite-state compiler and library (p. 29‑32) Hulden, The foma FST compiler (~7 pages)	36 pages of readings
Week 4	Tuesday, Feb 05		Beesley and Karttunen, Chapter 2.1 - "Where We Are" (p. 43) Beesley and Karttunen, Chapter 2.2 - "Basic Concepts" (p. 43‑45) Beesley and Karttunen, Chapter 2.3 - "Simple Regular Expressions" (p. 45‑63) Beesley and Karttunen, Chapter 2.4 - "Complex Regular Expressions" (p. 63‑74) Beesley and Karttunen, Chapter 2.5 - "Properties of Finite-State Networks" (p. 74‑78)	40 pages of readings
Week 4	Thursday, Feb 07		Beesley and Karttunen, Chapter 3.1 - The xfst Interface (p. 81‑84) Beesley and Karttunen, Chapter 3.2 - Compiling regular expressions (p. 84‑108) Beesley and Karttunen, Chapter 3.3 - Interacting with the Operating System (p. 109‑121) Beesley and Karttunen, Chapter 3.4.1 - Modularization (p. 121) Beesley and Karttunen, Chapter 3.4.2 - Computing with defined variables (p. 121-123)	44 pages of readings
Week 5	Tuesday, Feb 12		Beesley and Karttunen, Chapter 3.5 - Rule-like Notations (p. 130‑182)	53 pages of readings
Week 5	Thursday, Feb 14		Beesley and Karttunen, Chapter 3.6 - Examining Networks (p. 182‑189) Beesley and Karttunen, Chapter 3.7 - Miscellaneous Operations on Networks (p. 190‑195) Beesley and Karttunen, Chapter 3.8 - Advanced xfst (p. 195‑201) Beesley and Karttunen, Chapter 3.9 - Operator Precedence (p. 201) Beesley and Karttunen, Chapter 3.10 - Conclusion (p. 202)	23 pages of readings
Week 6	Tuesday, Feb 19		Beesley and Karttunen, Chapter 4.1 - The lexc language (p. 203‑204) Beesley and Karttunen, Chapter 4.2 - Defining Simple Automata (p. 204‑226) Beesley and Karttunen, Chapter 4.3 - Defining Lexical Transducers (p. 226‑240)	40 pages of readings
Week 6	Thursday, Feb 21		Okrand, Chapter 3: Nouns (p. 19-31) Beesley and Karttunen, Chapter 4.4 - Useful lexc strategies (p. 240‑258) Beesley and Karttunen, Chapter 4.5 - Integration and Testing (p. 259‑270) Beesley and Karttunen, Chapter 4.6 - lexc Summary and Usage Notes (p. 270‑278)	53 pages of readings
Week 7	Tuesday, Feb 26		Beesley and Karttunen, Chapter 7 - Flag Diacritics (p. 339‑374)	36 pages of readings
Week 7	Thursday, Feb 28		Beesley and Karttunen, Chapter 5.0 - Planning and Managing Finite-State Projects (p. 279) Beesley and Karttunen, Chapter 5.1 - Infrastructure (p. 279‑283) Beesley and Karttunen, Chapter 5.2 - Linguistic Planning (p. 283‑293) Beesley and Karttunen, Chapter 5.3 - Composition is Our Friend (p. 293‑300) Beesley and Karttunen, Chapter 5.4 - Priority Union for Irregular Forms (p. 300‑307) Beesley and Karttunen, Chapter 5.5 - Conclusions (p. 307‑310)	32 pages of readings 5 pages of optional readings
Week 8	Tuesday, Mar 05		Beesley and Karttunen, Chapter 6.1 - The Challenge of Testing and Debugging (p. 311) Beesley and Karttunen, Chapter 6.2 - Testing on Real Corpora (p. 311‑319) Beesley and Karttunen, Chapter 6.3 - Checking the Alphabet (p. 319‑327) Beesley and Karttunen, Chapter 6.4 - Testing with Subtraction (p. 327‑338)	31 pages of readings
Week 8	Thursday, Mar 07		Beesley and Karttunen, Chapter 8 - Non-Concatenative Morphotactics (p. 375-419)	45 pages of readings
Week 9	Tuesday, Mar 12		Beesley and Karttunen, Chapter 9 - Finite State Linguistic Applications (p. 421‑455)	35 pages of readings
Week 9	Thursday, Mar 14		Sproat, Chapter 2.3 - "What is combined, and how?" (p. 43‑66) Sproat, Chapter 2.4 - "Morphemes, structure of words, & word-formation rules" (p. 66‑83) Sproat, Chapter 2.5 - "Morphotactics: The Order of Morphemes" (p. 83‑92) Sproat, Chapter 2.6 - "Phonology" (p. 92‑108) Sproat, Chapter 2.7 - "Psycholinguistic evidence" (p. 109‑122) Sproat, Chapter 2.8 - "Final note" (p. 122‑123) Sproat, Chapter 2.9 - "Further reading" (p. 123)	86 pages of readings
Week 10	Tuesday, Mar 19	Spring Break	Spring Break, Tuesday, Mar 19
Week 10	Thursday, Mar 21	Spring Break	Spring Break, Thursday, Mar 21
Week 11	Tuesday, Mar 26		Midterm exam review, Tuesday, Mar 26
Week 11	Thursday, Mar 28		Midterm exam, Thursday, Mar 28
Week 12	Tuesday, Apr 02		Partee et al., Chapter 1 - "Basic Concepts of Set Theory" (p. 3‑26) Partee et al., Chapter 2 - "Relations and Functions" (p. 27‑36) Partee et al., Chapter 16 - "Basic Concepts" (p. 433‑454) Chomsky (1956), Three Models for the Description of Language (p. 113‑124) Tantau, Chapter 2 - Tutorial: A Picture for Karl’s Students (p. 30‑48) Tantau, Chapter 3 - Tutorial: A Petri-Net for Hagen (p. 49‑60) Tantau, Chapter 5 - Tutorial: Diagrams as Simple Graphs (p. 69‑77) Tantau, Chapter 6 - Tutorial: A Lecture Map for Johannes (p. 78‑92) Partee et al., Chapter 17 - "Finite Automata, Regular Languages and Type 3 Grammars" (p. 455‑482)	81 pages of readings 70 pages of optional readings
Week 12	Thursday, Apr 04
Week 13	Tuesday, Apr 09		Chrupala et al, Learning Morphology with Morfette (p. 2362‑2366) Durett and DeNero, Supervised Learning of Complete Morphological Paradigms (p. 1185‑1193)	14 pages of readings
Week 13	Thursday, Apr 11		Hulden et al, Semi-supervised learning of morphological paradigms and lexicons (p. 569‑576) Ahlberg et al, Paradigm classification in supervised learning of morphology (p. 1024‑1028)	13 pages of readings
Week 14	Tuesday, Apr 16		Goldsmith, Segmentation and Morphology (p. 3‑35)	33 pages of readings
Week 14	Thursday, Apr 18		Roark and Sproat, Chapter 5 - "Machine Learning of Morphology" (p. 116‑136)	21 pages of readings
Week 15	Tuesday, Apr 23		Roark and Sproat, Chapter 4 - "A Brief History of Computational Morphology" (p. 100‑115) Antworth, Appendix B - "Two-level Phonology Revisited" (~17 pages)	33 pages of readings
Week 15	Thursday, Apr 25		Karttunen, The Proper Treatment of Optimality in Computational Phonology (p. 1‑11)	11 pages of readings
Week 16	Tuesday, Apr 30
Week 16	Thursday, May 02

This course entails approximately 861 total pages of required readings for the semester.