Speaker: Eric Bakovi? (UC San Diego)
Title: Representation as computation
When: Wednesday, September 10th, 1pm-2:30pm (Day 1) + Thursday, September 11th, 12:30-2pm (Day 2)
Location: 32-D461
Abstract:
This minicourse introduces Boolean Monadic Recursive Schemes (BMRS; Bhaskar et al. 2020, Chandlee & Jardine 2021) as a computational framework for phonological analysis. We will learn to apply BMRS to the analysis of some classic problems for which either restrictions on input representations or specific representational structures have traditionally been assumed. BMRS offer a structured computational solution for these problems without such representational assumptions.
On day one, we will introduce BMRS and apply them to complementary distribution patterns for which input restrictions and other representational assumptions have traditionally been made. Day two will focus on applying BMRS to patterns where featural underspecification has been used to explain the behavior of certain classes of segments within the overall pattern. Participants will gain hands-on experience implementing BMRS analyses and comparing them with traditional representational solutions.