Schedule

Schedule and Readings

Week	Date	Topic	Readings	Totals (approximate)
Week 1	Tuesday, Jan 21		Schwartz, Syllabus (~4 pages)	4 pages of readings
Week 1	Thursday, Jan 23	Introduction to computational morphology	Sproat, Introduction (p. xi‑xv) Sproat, Chapter 1 - "Applications of computational morphology" (p. 1‑14) Rosenfelder, Chapter 1 - "Introduction" (p. 7-12) Rosenfelder, Chapter 2 - "A naming language" (p. 13-16) Rosenfelder, Chapter 3 - "The overall process" (p. 17-26)	38 pages of readings
Week 2	Tuesday, Jan 28	Linguistic foundations (part 1)	Sproat, Chapter 2.1 - "The nature of morphology: Introduction" (p. 15‑19) Sproat, Chapter 2.2 - "Functions of morphology" (p. 19‑43) Sproat, Chapter 2.3 - "What is combined, and how?" (p. 43‑66) Lieber, Chapter 1 - "What is morphology?" (p. 1-8) Lieber, Chapter 3 - "Lexeme formation" (p. 35-59)	54 pages of readings 33 pages of optional readings
Week 2	Thursday, Jan 30	Linguistic foundations	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) Rosenfelder, Chapter 4 - "Word Building" (p. 50-56)	68 pages of readings
Week 3	Tuesday, Feb 04	A Gentle Introduction to Finite-State Morphology	Beesley and Karttunen, Preliminaries (p. xii‑xviii) Beesley and Karttunen, Chapter 1.1-1.4 - "A Gentle Introduction, part 1" (p. 1‑17) Beesley and Karttunen, Chapter 1.5-1.9 - "A Gentle Introduction, part 2" (p. 17‑37) Schwartz, Video lecture: Creating graphviz graphs with dot (00:00‑13:23)	44 pages of readings 13.4 minutes of optional video
Week 3	Thursday, Feb 06	Set Theory	Partee et al., Chapter 1 - "Basic Concepts of Set Theory" (p. 3‑26) Roark and Sproat, Chapter 4 - "A Brief History of Computational Morphology" (p. 100‑115) Hulden, Morphological analysis with FSTs (~25 pages)	24 pages of readings 41 pages of optional readings
Week 4	Tuesday, Feb 11	A More Systematic Introduction to Finite-State Morphology	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 13	Relations and Functions	Partee et al., Chapter 2 - "Relations and Functions" (p. 27‑36) Partee et al., Chapter 4 - "Infinities" (p. 55‑73)	29 pages of readings
Week 5	Tuesday, Feb 18	Languages, Grammars, and Automata	Partee et al., Chapter 16 - "Basic Concepts" (p. 433‑454) Chomsky (1956), Three Models for the Description of Language (p. 113‑124)	22 pages of readings 12 pages of optional readings
Week 5	Thursday, Feb 20	FSTs and Regular Languages	Partee et al., Chapter 17 - "Finite Automata, Regular Languages and Type 3 Grammars" (p. 455‑482)	28 pages of readings
Week 6	Tuesday, Feb 25	A domain-specific language for finite-state morphology	Exam 1, Estimated approximate date 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) Hulden, The foma FST compiler (~7 pages)	44 pages of readings 7 pages of optional readings
Week 6	Thursday, Feb 27	A domain-specific language for finite-state morphology	Beesley and Karttunen, Chapter 3.5 - Rule-like Notations (p. 130‑182)	53 pages of readings
Week 7	Tuesday, Mar 03	A domain-specific language for finite-state morphology	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) Hulden, Foma: a finite-state compiler and library (p. 29‑32)	23 pages of readings 4 pages of optional readings
Week 7	Thursday, Mar 05	A domain-specific language for representing lexicons	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 8	Tuesday, Mar 10	A domain-specific language for representing lexicons	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)	40 pages of readings
Week 8	Thursday, Mar 12	Planning and Managing Finite-State Projects	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 9	Tuesday, Mar 17	Spring Break
Week 9	Thursday, Mar 19	Spring Break
Week 10	Tuesday, Mar 24	Testing and Debugging	Schwartz, Video lecture: Testing and Make (00:00-55:23) Schwartz, Video lecture: Tokenization using longest-match (00:00-23:35) 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 79 minutes of video
Week 10	Thursday, Mar 26	Flag Diacritics	Schwartz, Video lecture: Flag Diacritics - Unification Operator (00:00-16:59) Schwartz, Video lecture: Flag Diacritics - Various Operators (00:00-32:31) Schwartz, Video lecture: Flag Diacritics for Arabic definite and indefinite nouns (00:00-34:08) Beesley and Karttunen, Chapter 7 - Flag Diacritics (p. 339‑374)	36 pages of readings 83 minutes of video
Week 11	Tuesday, Mar 31	Implementing a Finite-State Analyzer for Klingon	Okrand, Chapter 1: The Sounds of Klingon (p. 13-17) Schwartz, Video lecture: The Sounds of Klingon (00:00-09:02) Okrand, Chapter 2: Grammatical Sketch (p. 18) Okrand, Chapter 3: Nouns (p. 19-31) Schwartz, Video lecture: Klingon Nouns (00:00-26:40)	19 pages of readings 36 minutes of video
Week 11	Thursday, Apr 02	Implementing a Finite-State Analyzer for Klingon	Okrand, Chapter 4: Verbs (p. 32-50) Okrand, Chapter 5: Other Kinds of Words (p. 51-58) Okrand, Chapter 6: Syntax (p. 51-58)	29 pages of readings
Week 12	Tuesday, Apr 07	Non-Concatenative Morphotactics	Beesley and Karttunen, Chapter 8 - Non-Concatenative Morphotactics (p. 375-419) Schwartz, Video lecture: Non-concatenative morphology in XFST (00:00-08:08) Schwartz, Video lecture: Compile-replace for non-concatenative morphology in XFST (00:00-09:49)	45 pages of readings 18 minutes of video
Week 12	Thursday, Apr 09	Applications of FSTs	Beesley and Karttunen, Chapter 9 - Finite State Linguistic Applications (p. 421‑455) Schwartz, Video lecture: Tokenization of words (00:00-49:00)	35 pages of readings 49 minutes of video
Week 13	Tuesday, Apr 14	Two-Level Morphology	Beesley and Karttunen, Section 1 - Introduction to twolc (p. 1‑13) Beesley and Karttunen, Section 2 - Basic twolc Syntax (p. 14-28) Beesley and Karttunen, Section 3 - Full twolc Syntax (p. 28-38) Schwartz, Video lecture: Introduction to Two Level Morphology (00:00-24:40) Schwartz, Video lecture: Two Level Morphology with a toy grammar (00:00-32:11) Schwartz, Video lecture: Exporting transducers from twolc to foma (00:00-14:17) Karttunen, The Proper Treatment of Optimality in Computational Phonology (p. 1‑11)	38 pages of readings 71 minutes of video 11 pages of optional readings
Week 13	Thursday, Apr 16	Two-Level Morphology	Beesley and Karttunen, Section 4 - The Art and Craft of Writing twolc Grammars (p. 38-44) Beesley and Karttunen, Section 5 - Debugging twolc Rules (p. 44-62) Beesley and Karttunen, Section 6 - Final Reflections on Two-Level Rules (p. 62-65) Antworth, Appendix B - "Two-level Phonology Revisited" (~17 pages)	27 pages of readings 17 pages of optional readings
Week 14	Tuesday, Apr 21		Goldsmith, Segmentation and Morphology (p. 3‑35)	33 pages of readings
Week 14	Thursday, Apr 23	Unsupervised learning	Hammarström and Borin, Unsupervised Learning of Morphology (p. 309-336) Roark and Sproat, Chapter 5 - "Machine Learning of Morphology" (p. 116‑136)	49 pages of readings
Week 15	Tuesday, Apr 28		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 15	Thursday, Apr 30		Xu et al, Unsupervised Morphology Learning with Statistical Paradigms (p. 44‑54) 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)	23 pages of readings
Week 16	Tuesday, May 05		Final exam, Estimated approximate date

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