Welcome to the webpage of the Learnability theory course for the summer semester of 2024!
Grades
The grades for this module are based on a series of smallish projects (Portfolio), assigned and completed throughout the course of the semester.
Course description
The question of how languages are learned is at the heart of the generative enterprise. Whether called “Plato’s Problem” or “Explanatory Adequacy”, learnability is a fundamental goal of linguistic theory. In this course we approach learning from a computational perspective, exploring the literature on inductive inference of formal languages.
| Gold Learning |
|---|
| PAC Learning |
| Regular languages |
| CG/MGs from trees |
| Subregularity |
| Distributional Learning |