Course pages 2019–20
Formal Models of Language
Lecture Notes
Slides
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- All slides combined Please think twice before printing slides! If you really need to, use pdfnup or similar.
Supervision Worksheets
Background Reading
- Jurafsky, D. and Martin, J. Speech and language processing
- Manning, C. and Schutze, H. Foundations of Statistical Natural Language Pro\ cessing
- Ruslan M. The Oxford Handbook of Computational Linguistics
- Clark, A., Fox, C, and Lappin, S. The handbook of Computational Linguistics and Natural Language Processing
- Kozen, D. Automata and Computability
Errata
- Lecture 1 slide 15, {Q} -> Q (corrected on online slides but not in video) thanks to Harrison
- Lecture 2 slide 15 18:47, I've missed out the "Pron" between the NP and "him" in the tree. thanks to Huikai
- Lecture 2 slide 17 21:25, when I say "regular grammar" and "context-free grammar" I mean the language generated by the grammars as indicated on the slide
- Lecture 5 slide 12 and 13, updated wording to be less ambiguous. Slides on video not updated
- Grammar notes page 7 example on RHS, \Gamma = {S, A, B, X} should read \Gamma = {A, B, X, z_0} (corrected) thanks to Aaron
- Grammar notes mid page 8, |v| \ge 1 should read |yz| \ge 1 (corrected) thanks to Simonas