252-2310-00L  Understanding Context-Free Parsing Algorithms

SemesterSpring Semester 2022
LecturersR. Cotterell
Periodicityyearly recurring course
Language of instructionEnglish
CommentThe deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.

Number of participants limited to 24.


AbstractParsing context-free grammars is a fundamental problem in natural language processing and computer science more broadly. This seminar will explore a classic text that unifies many algorithms for parsing in one framework.
Learning objectiveSikkel's notion of parsing schemata is explored in depth. The students should take away an understanding and fluency with these ideas.
ContentParsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms