Informatics 2A: Course Schedule and Lecture Slides, Autumn 2018

Lectures will take place at the following times and places:

Links to the lecture slides will become live at the time of the lecture in question. Should you wish to look at the material in advance of the lecture, feel free to look at last year's slides. These are not guaranteed to be identical to this year's slides, but in practice the content will be mostly the same.

WeekLecturesTutorialsPracticalsAssignmentsReadings
1Sep 17: Lecture 1: Introduction and Course Administration (MC+SC)
Sep 19: Lecture 2: Course Roadmap (MC+SC).
Sep 21: Lecture 3: Finite Automata (MC).
-- -- -- Kozen chapters 2,3,5,6; J&M[2nd Ed] chapters 1, 2 (sec 2.2), 16 (intro and sec 16.1); Wikipedia: Chomsky (see Note 1)
2Sep 24: Lecture 4: Constructions on Finite Automata (MC).
Sep 26: Lecture 5: Regular Expressions and Kleene's Theorem (MC).
Sep 28: Lecture 6: Applications to String and Pattern Matching (MC).
-- -- -- Kozen chapter 3, 4, 11, 12, 2
3Oct 01: Lecture 7: Lexing and Other Applications (MC).
Oct 03: Lecture 8: The Pumping Lemma: limitations of regular languages (MC).
Oct 05: Lecture 9: Context-free Languages (MC).
Tutorial 1 Lab 1: Introduction to Python/NLTK, Part I -- Kozen chapter 5, 9; J&M chapter 2; chapter 16.2; Vidal et al. 2005
4Oct 08: Lecture 10: Pushdown Automata (MC).
Oct 10: Lecture 11: LL(1) Predictive Parsing (MC).
Oct 12: Lecture 12: Automatic Generation of LL(1) Parsers (MC).
Tutorial 2 Lab 2: Introduction to Python/NLTK, Part II -- Earlier year's lecture notes relevant lectures 10 and 11: Note 9, Note 10, Note 12. Earlier year's tutorial sheet.
5Oct 15: Lecture 13: Fixing Problems with Grammars (MC).
Oct 17: Lecture 14: Types and Static Type Checking (MC).
Oct 19: Lecture 15: Natural language processing, morphology, and finite-state transducers (SC)
Tutorial 3   Oct 17: Assignment 1 issued Kozen chapters 26 and 27; J&M sections 3.1--3.7
6Oct 22: Lecture 16: Parts of speech in natural language (SC).
Oct 24: Lecture 17: Part-of-speech Tagging (SC).
Oct 26: Lecture 18: Fun with weighted FSTs (SC)
Tutorial 4 Lab 3: Support for Assignment 1 -- J&M sections 5.1--5.5, 6.1--6.4; NLTK: Chapters 3 and 5. Penn Treebank tagging guide
7Oct 29: Lecture 19: Phrase Structure and Parsing as Search (SC)
Oct 31: Lecture 20: The CYK Algorithm (SC)
Nov 02: Lecture 21: The Earley Algorithm; Earley parsing example (SC)
Tutorial 5 -- Oct 31: Assignment 1 deadline (4pm) J&M Chapters 13.4, 14 (up to 14.5), 16.3--16.4. NLTK: Chapter 8. Rosenberg, The Hardest Natural Languages
8Nov 05: Lecture 22: Probabilistic Context-free Grammars (SC)
Nov 07: Lecture 23: Parameter Estimation and Lexicalisation of PCFGs (SC)
Nov 09: Lecture 24: Grammar Writing Exercise (SC)
Tutorial 6 -- Nov 09: Assignment 2 issued J&M Chapters 12.9, 14.10, 17--18; NLTK: Chapter 10
9Nov 12: Lecture 25: Agreement, Types and Natural Language Semantics (SC)
Nov 14: Lecture 26: Computing Semantics (SC)
Nov 16: Lecture 27: Complexity of Human Languages (SC)
Tutorial 7 -- Lecture Notes: Semantics;
10Nov 19: Lecture 28: Semantics of Programming Languages (MC).
Nov 21: Lecture 29: Context-sensitive languages (MC).
Nov 23: Lecture 30: Turing Machines and Linear Bounded Automata (MC).
Tutorial 8 Lab 5: Support for Assignment 2 -- Kozen chapter 28, 29, 31, 32; Wikipedia: CSG, Turing
11Nov 26: Lecture 31: Undecidability (MC)
Nov 28: Lecture 32: Revision Lecture (MC+SC)
Tutorial 9 Extra labs for Assignment 2 support Nov 30: Assignment 2 deadline (4pm) 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. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh