Informatics 2A: Course Schedule and Lecture Slides 2011

WkLecturesTutorialsPracticalsAssignments outAssignments dueReadings
1Sep 20: Lecture 1: Introduction and Course Administration (JL)
Sep 22: Lecture 2: Course Roadmap (ML,JL)
Sep 23: Lecture 3: Finite State Machines (revision) (JL)
-- -- -- -- Kozen chapter 1, 2; J&M[2nd Ed] chapter 1, 16 (intro and sec 16.1); Wikipedia: Chomsky (see Note 1)
2Sep 27: Lecture 4: Equivalence of DFAs and NFAs (JL)
Sep 29: Lecture 5: Regular Expressions and Kleene's Theorem (JL)
Sep 30: Lecture 6: Applications to Pattern Matching and Lexing (JL)
-- -- -- -- Kozen chapter 3, 4, 11, 12, 2
3Oct 04: Lecture 7: Applications to Morphological Parsing (JL)
Oct 06: Lecture 8: The Pumping Lemma (JL)
Oct 07: Lecture 9: Context-free Languages (JL)
Tutorial 1 Lab 1: Introduction to Python I -- -- Kozen chapter 5, 9; J&M[2nd Ed.] chapter 2; chapter 16.2; Vidal et al. 2005
4Oct 11: Lecture 10: Pushdown Automata (JL)
Oct 13: Lecture 11: LL(1) Predictive Parsing (JL)
Oct 14: Lecture 12: Automatic Generation of LL(1) Parsers (JL)
Tutorial 2 Lab 2: Introduction to Python II -- -- Previous year's lecture notes relevant lectures 11 and 12: Note 9, Note 10, Note 12. Previous year's tutorial sheet.
5Oct 18: Lecture 13: Fixing Problems with Grammars (JL)
Oct 20: Lecture 14: Ambiguity and the Lexicon in Natural Language (ML)
Oct 21: Lecture 15: Part of Speech Tagging (ML)
Tutorial 3 Lab 3: Introduction to NLTK -- -- Kozen chapters 26 and 27; J&M[2nd Ed.] Chapter 5.2--5.2
6Oct 25: Lecture 16: Phrase Structure and Parsing as Search (ML)
Oct 27: Lecture 17: Chart Parsing: The CYK Algorithm (ML)
Oct 28: Lecture 18: Chart Parsing: The Early Algorithm (ML)
Tutorial 4 Lab 4: Introduction to NLTK (cont) Oct 24: A1: Words, Sentences, Parts of Speech, Grammar -- J&M[2nd Ed.] Chapter 5 (intro through 5.7); Chapter 12 (intro through 12.3); Chapter 13 (intro through 13.3); NLTK: Chapters 3 and 5
7Nov 01: Lecture 19: Probabilistic Context-Free Grammars (ML)
Nov 03: Lecture 20: Parameter Estimation and Lexicalization for PCFGs (ML)
Nov 04: Lecture 21: Complexity and Character of Human Languages (ML)
Erasmus presentation (TK)
Tutorial 5 -- -- -- J&M[2nd Ed.] Chapters 13.4, 14 (intro through 14.5), 16.3--16.4; NLTK: Chapter 8; Rosenberg, The Hardest Natural Languages
8Nov 08: Lecture 22: Models of Human Parsing (ML)
Nov 10: Lecture 23: Probabilistic Models of Human Parsing (ML)
Nov 11: Lecture 24: Types (ML)
Tutorial 6 -- -- Nov 07: A1: Words, Sentences, Parts of Speech, Grammar J&M[2nd Ed.] Chapters 12.9, 14.10, 17--18; NLTK: Chapter 10
9Nov 15: Lecture 25: Semantics for Natural Languages (ML)
Nov 16: Lecture 26: Computing Natural Language Semantics (ML)
Nov 18: NO LECTURE
Tutorial 7 -- Nov 14: A2: A Lexer, Parser and Typechecker -- Lecture Notes: Semantics;
10Nov 22: Lecture 27: Semantics of Programming Languages (JL)
Nov 24: Lecture 28: Context Sensitivity in PLs and NLs (JL)
Nov 25: Lecture 29: Turing Machines and Linear Bounded Automata (JL)
Tutorial 8 -- -- -- Kozen chapter 28, 29, 31, 32; Wikipedia: CSG, Turing
11Nov 29: Lecture 30: Undecidability (JL)
Dec 01: Lecture 31: Further Courses in Informatics: The way ahead (ML)
Tutorial 9 -- -- Nov 28: A2: A Lexer, Parser and Typechecker Hauser et al. (2002)

Note 1.To allow for your getting the required texts during Week 1, Chapter 1 from Jurafsky and Martin (2nd Edition) is available here.


Home : Teaching : Courses : Inf2a 

Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: school-office@inf.ed.ac.uk
Please contact our webadmin with any comments or corrections.
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh