252-2300-00L  Neural Networks and Computational Complexity

SemesterAutumn Semester 2024
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.



Courses

NumberTitleHoursLecturers
252-2300-00 SNeural Networks and Computational Complexity2 hrs
Fri14:15-16:00CHN D 44 »
R. Cotterell

Catalogue data

AbstractDependency parsing is a fundamental task in natural language processing. This seminar explores a variety of algorithms for efficient dependency parsing and their derivatioin in a unified algebraic framework.
Learning objectiveThe core ideas behind the mathematics of dependency parsing are explored.
ContentDependency Structures and Lexicalized Grammars: An Algebraic Approach

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

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

Offered in

ProgrammeSectionType
Computer Science BachelorSeminarWInformation