{"id":397,"date":"2008-12-08T05:00:44","date_gmt":"2008-12-08T10:00:44","guid":{"rendered":"http:\/\/whamit.mit.edu\/?p=397"},"modified":"2008-12-07T20:20:00","modified_gmt":"2008-12-08T01:20:00","slug":"phonology-circle-1210-giorgio-magri","status":"publish","type":"post","link":"https:\/\/ling-phil.mit.edu\/whamit\/2008\/12\/08\/phonology-circle-1210-giorgio-magri\/","title":{"rendered":"Phonology circle 12\/10 - Giorgio Magri"},"content":{"rendered":"<p>Come join us for the last Phonology Circle of the semester, featuring a talk by Giorgio Magri.<\/p>\n<p>Title: The Ranking Problem in Optimality Theory<BR><br clear='none'\/>\nTime: Wed 12\/10, 5pm, <a href=\"http:\/\/whereis.mit.edu\/map-jpg?mapterms=32-D831\">32-D831<\/a><\/p>\n<p>> Every learning problem can be formulated as an optimization problem: within a<br clear='none'\/>\ngiven typology, pick the grammar that is best given the data. Very little work<br clear='none'\/>\nhas been done within Generative Grammar on how to actually solve the<br clear='none'\/>\noptimization problem itself. Recently, a small but growing body of literature<br clear='none'\/>\nwithin the framework of Optimality Theory (OT) has started to study the<br clear='none'\/>\noptimization problem itself. I will introduce the main ideas of this enterprise<br clear='none'\/>\nand I will illustrate it by focusing on a problem currently open in<br clear='none'\/>\ncomputational OT, namely that of devising incremental ranking algorithms that<br clear='none'\/>\nperform both promotion and demotion. I will explain why the problem is<br clear='none'\/>\ninteresting. I will review one such algorithm, namely Boersma&#8217;s (1994) GLA. I<br clear='none'\/>\nwill discuss why the algorithm does not work, by explaining in detail what goes<br clear='none'\/>\nwrong in the case of a counterexample discovered by Pater (2007). I will then<br clear='none'\/>\nnote that the ranking problem within OT can be described as a linear<br clear='none'\/>\nfeasibility problem. This very simple observation has far reaching consquences.<br clear='none'\/>\nIn particular, it offers a straightforward way do device the desired incremental<br clear='none'\/>\nalgorithm.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Come join us for the last Phonology Circle of the semester, featuring a talk by Giorgio Magri. Title: The Ranking Problem in Optimality Theory Time: Wed 12\/10, 5pm, 32-D831 > Every learning problem can be formulated as an optimization problem: within a given typology, pick the grammar that is best given the data. Very little [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-397","post","type-post","status-publish","format-standard","hentry","category-talks"],"_links":{"self":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/397","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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/comments?post=397"}],"version-history":[{"count":4,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/397\/revisions"}],"predecessor-version":[{"id":403,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/397\/revisions\/403"}],"wp:attachment":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/media?parent=397"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/categories?post=397"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/tags?post=397"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}