VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
252-2300-00L
2
Credits
BSC
D-INFK
Neural Networks and Computational Complexity
Lecturers & Examiners:
Prof. Dr. Ryan Cotterell
The 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.
Last Updated: 2026-06-03 00:07:49
Abstract
Dependency 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.
Objective
The core ideas behind the mathematics of dependency parsing are explored.
Content
Dependency Structures and Lexicalized Grammars: An Algebraic Approach
General Information
- Language
- English
- Levels
- BSC
- Frequency
- Yearly recurring
Examination
- Type
- graded semester performance
Registration & Places
- Max Places
- 25
Priority: Registration for the course unit is only possible for the primary target group
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| seminar | Neural Networks and Computational Complexity | No time listed | 2 h weekly |