{"id":12912,"date":"2019-10-28T06:04:00","date_gmt":"2019-10-28T10:04:00","guid":{"rendered":"http:\/\/whamit.mit.edu\/?p=12912"},"modified":"2019-10-27T19:44:35","modified_gmt":"2019-10-27T23:44:35","slug":"morphun-10-30-patrick-niedzielski-mit-2","status":"publish","type":"post","link":"https:\/\/ling-phil.mit.edu\/whamit\/2019\/10\/28\/morphun-10-30-patrick-niedzielski-mit-2\/","title":{"rendered":"MorPhun 10\/30 - Patrick Niedzielski (MIT)"},"content":{"rendered":"<p><strong>Speaker: <\/strong> Patrick Niedzielski (MIT)<br class=\"\" \/><br clear='none'\/>\n<strong>Title: <\/strong>Aksenova, Graf &amp; Moradi (2016): Morphotactics as tier-based strictly local dependencies<br class=\"\" \/><br clear='none'\/>\n<strong>Time: <\/strong>Wednesday, October 30th, 5pm - 6:30pm<br class=\"\" \/><br clear='none'\/>\n<strong>Location: <\/strong>32-D831<br class=\"\" \/><br clear='none'\/>\n<br class=\"\" \/><br clear='none'\/>\n<strong>Abstract: <\/strong>It is commonly accepted that morphological dependencies are finite-state in nature. Aksenova, Graf &amp; Moradi (2016) argue that the upper bound on morphological expressivity is much lower. Drawing on technical results from computational phonology, they show that a variety of morphotactic phenomena are tier-based strictly local and do not fall into weaker subclasses such as the strictly local or strictly piecewise languages. Since the tier-based strictly local languages are learnable in the limit from positive texts, this marks a first important step towards general machine learning algorithms for morphology. Furthermore, the limitation to tier-based strictly local languages explains typological gaps that are puzzling from a purely linguistic perspective.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Patrick Niedzielski (MIT) Title: Aksenova, Graf &amp; Moradi (2016): Morphotactics as tier-based strictly local dependencies Time: Wednesday, October 30th, 5pm - 6:30pm Location: 32-D831 Abstract: It is commonly accepted that morphological dependencies are finite-state in nature. Aksenova, Graf &amp; Moradi (2016) argue that the upper bound on morphological expressivity is much lower. Drawing on [&hellip;]<\/p>\n","protected":false},"author":26,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-12912","post","type-post","status-publish","format-standard","hentry","category-announcements"],"_links":{"self":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/12912","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\/26"}],"replies":[{"embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/comments?post=12912"}],"version-history":[{"count":1,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/12912\/revisions"}],"predecessor-version":[{"id":12920,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/posts\/12912\/revisions\/12920"}],"wp:attachment":[{"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/media?parent=12912"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/categories?post=12912"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ling-phil.mit.edu\/whamit\/wp-json\/wp\/v2\/tags?post=12912"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}