Charlie O’Hara

Fixing paper assignments

  1. Please select all papers that belong to the same person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here

2022

pdf bib
MaxEnt Learners are Biased Against Giving Probability to Harmonically Bounded Candidates
Charlie O’Hara
Proceedings of the Society for Computation in Linguistics 2022

2021

pdf bib
Emergent Gestural Scores in a Recurrent Neural Network Model of Vowel Harmony
Caitlin Smith | Charlie O’Hara | Eric Rosen | Paul Smolensky
Proceedings of the Society for Computation in Linguistics 2021

pdf bib
Learnability of derivationally opaque processes in the Gestural Harmony Model
Caitlin Smith | Charlie O’Hara
Proceedings of the Society for Computation in Linguistics 2021

2020

pdf bib
Frequency Matching Behavior in On-line MaxEnt Learners
Charlie O’Hara
Proceedings of the Society for Computation in Linguistics 2020

2019

pdf bib
Weakly deterministic transformations are subregular
Andrew Lamont | Charlie O’Hara | Caitlin Smith
Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology

Whether phonological transformations in general are subregular is an open question. This is the case for most transformations, which have been shown to be subsequential, but it is not known whether weakly deterministic mappings form a proper subset of the regular functions. This paper demonstrates that there are regular functions that are not weakly deterministic, and, because all attested processes are weakly deterministic, supports the subregular hypothesis.
Search
Co-authors
Venues
Fix data