{"id":9361,"date":"2017-02-13T06:02:36","date_gmt":"2017-02-13T10:02:36","guid":{"rendered":"http:\/\/whamit.mit.edu\/?p=9361"},"modified":"2017-02-13T09:24:31","modified_gmt":"2017-02-13T13:24:31","slug":"lrfg-215-roni-katzir","status":"publish","type":"post","link":"https:\/\/ling-phil.mit.edu\/whamit\/2017\/02\/13\/lrfg-215-roni-katzir\/","title":{"rendered":"LRFG 2\/15 - Roni Katzir"},"content":{"rendered":"<p><strong>Speaker:<\/strong> <a href=\"http:\/\/linguistics.mit.edu\/user\/trifilij\/\">Roni Katzir<\/a> (Tel-Aviv University & MIT)<br clear='none'\/>\n<strong>Title:<\/strong> Structure and learning of quantificational determiners<br clear='none'\/>\n<strong>Date and time:<\/strong> Wednesday, February 15, 1-2pm<br clear='none'\/>\n<strong>Location:<\/strong> 32-D461<br clear='none'\/>\n<strong>Abstract:<\/strong><br clear='none'\/>\nAcquiring semantic denotations &#8212; even the entry for a single, well-exemplified, low-type element &#8212; presents the child with a difficult inductive challenge. I start by illustrating this challenge using the notion of learning known as identification in the limit, before switching to a less complete notion of learning, compression-based learning, which offers a more constructive way to approach the inductive challenge. Focusing on the representation and learning of quantificational determiners, I show how compression-based learning maps representational choices &#8212; e.g., basic determiners and their combinations, in an intensional variant of Keenan & Stavi 1986 (following last week&#8217;s discussion), or semantic automata, as in van Benthem 1986 &#8212; onto learners. This mapping, in turn, makes empirical predictions that can help us choose between competing architectures.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Roni Katzir (Tel-Aviv University &#038; MIT) Title: Structure and learning of quantificational determiners Date and time: Wednesday, February 15, 1-2pm Location: 32-D461 Abstract: Acquiring semantic denotations &#8212; even the entry for a single, well-exemplified, low-type element &#8212; presents the child with a difficult inductive challenge. I start by illustrating this challenge using the notion [&hellip;]<\/p>\n","protected":false},"author":16,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-9361","post","type-post","status-publish","format-standard","hentry","category-talks"],"_links":{"self":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/9361","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/users\/16"}],"replies":[{"embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/comments?post=9361"}],"version-history":[{"count":7,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/9361\/revisions"}],"predecessor-version":[{"id":9407,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/9361\/revisions\/9407"}],"wp:attachment":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/media?parent=9361"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/categories?post=9361"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/tags?post=9361"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}