The joys of minimizing description length

This week we will be treated to two presentations by Roni Katzir on compression-based learning.

In the LAVA lunch session on Thursday (high noon), he will discuss “an adequate simplicity metric for learning grammars,” going over three alternatives and arguing that compression-based simplicity (roughly, aiming for minimal description length) is the best for induction.

Then, in the colloquium slot (a quarter past two), he will present a talk entitled “Comparing theories of UG using compression-based learning,” in which he will go into more depth on the qualities of compression-based learning. He will discuss two case studies, one from phonology (concerning the Richness of the Base hypothesis) and one from semantics (concerning quantificational determiners).

For abstracts, location details, and more, see the CASTL events page.



This entry was posted in Uncategorized. Bookmark the permalink.