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.



Courses

NumberTitleHoursLecturers
252-2310-00 SUnderstanding Context-Free Parsing Algorithms2 hrs
Wed12:15-14:00CAB G 52 »
R. Cotterell

Catalogue data

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

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits2 credits
ExaminersR. Cotterell
Typegraded semester performance
Language of examinationEnglish
RepetitionRepetition only possible after re-enrolling for the course unit.

Learning materials

 
Main linkInformation
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

Places24 at the most
PriorityRegistration for the course unit is only possible for the primary target group
Primary target groupComputer Science BSc (252000)
Waiting listuntil 06.03.2022

Offered in

ProgrammeSectionType
Computer Science BachelorSeminarWInformation