FRIDAY
Nov. 1

12:30 - 13:00

Coffee / Registration

13:00 - 13:15

Opening Remarks

13:15 - 14:45

Session 1
Chair: Canaan Breiss

• 13:15 - 13:45
  Claire MOORE-CANTWELL
  University of California, Los Angeles
  Balancing type and token frequency matching with lexically indexed constraints
  
  

• 13:45 - 14:15
  Sora Heng YIN, Kathleen McCARTHY, Adam J. CHONG
  Queen Mary University of London
  Capturing divergent learning trajectories of neutralization: Interaction of lexical competition and phonological learning (abstract)
  
  

• 14:15 - 14:45
  Elango KUMARAN
  Gang effects are not categorical (abstract)

14:45 - 15:00

Break

15:00 - 16:30

Session 2
Chair: Jarry Chuang

• 15:00 - 15:30
  Gloria MELLESMOEN
  University of British Columbia
  Limited by Number of Morphemes, not Copied Segments: Multiple Reduplication and Triplication in St’át’imcets (abstract)
  
  

• 15:30 - 16:00
  Jian-Leat SIAH¹, Sam ZUKOFF¹, Feng-fan HSIEH²
  ¹ University of California, Los Angeles, ² National Tsing Hua University
  Reduplicative Opacity in Malay Revisited: Preliminary Phonetic Evidence for Variable “Recopying” and BRCT (abstract)
  
  

• 16:00 - 16:30
  Alma FRISCHOFF¹ & Ezer RASIN²
  ¹ MIT, ² Tel-Aviv University
  Unattested opaque interactions are Input Strictly Local (abstract)

16:30 - 16:45

Break

16:45 - 17:45

Plenary Session
Chair: Adam Jardine

Andrew LAMONT
University College London

Optimality Theory with lexical insertion is not computable

This talk examines the computational consequences of introducing lexical insertion, i.e., the ability to copy morphemes or insert them from the lexicon, as an operation into Optimality Theory. I demonstrate that this operation makes OT not computable: in other words, it is impossible to determine the output of a given input in a finite amount of time. This result is derived by modeling the Post Correspondence Problem in an OT grammar that uses only representations and mechanisms attested in the literature.