You are here

Computational Learning of Syntax

Courses

Computational Learning of Syntax

This course will look at the computational and mathematical theory of how grammars can be learned from strings.  
Any theory of language acquisition must at bottom rest on some solution to this problem.

In the last ten years there has been very rapid progress in this field using what is called distributional learning; we will cover a family of techniques for learning context free grammars and richer formalisms equivalent to Minimalist Grammars. We will review empirical work using naturally occurring corpora, but the primary goal is to understand the fundamental principles that underly this problem.

Course Status: Open

This course is currently open and available for registration. Login to sign up for the course.

Course Number:

310

Course Session:

Second two-week Session

Times:

Monday: 10:30 am-12:20 pm
Thursday: 10:30 am-12:20 pm

Instructor(s):

Prerequisites:

Some of the course will be technical so some facility with mathematical notation will be required, but we don't assume any expertise in learning theory at all. A first course in formal language theory would be helpful.