Jon Rawski
Jon Rawski
Events
Projects
Contact
Light
Dark
Automatic
computational phonology
Probing RNN Encoder-Decoder Generalization of Subregular Functions using Reduplication
We analyze the expressivity of a variety of recurrent encoder-decoder networks, showing they are limited to learning subsequential functions, and connecting RNNs with attention mechanisms to a class of deterministic 2-way transducers.
Max Nelson
,
Hossep Dolatian
,
Jon Rawski
,
Brandon Prickett
PDF
Cite
Code
Slides
Official Pub
Multi-Input Strictly Local Functions for Templatic Morphology
We provide an automata-theoretic characterization of templatic morphology, extending strict locality to consider n-ary functions.
Hossep Dolatian
,
Jon Rawski
PDF
Cite
Slides
Official Pub
Multi-Input Strictly Local Functions for Tonal Phonology
We provide an automata-theoretic characterization of tonal phonology, extending strict locality to consider n-ary functions.
Jon Rawski
,
Hossep Dolatian
PDF
Cite
Poster
Official Pub
Tensor Product Representations of Subregular Formal Languages
I provide a vector space characterization of the Star-Free and Locally Threshold testable classes of formal languages, over arbitrary data structures.
Jon Rawski
PDF
Cite
IJCAI slides
NECPhon slides
Learning with Partially Ordered Representations
We describe a partial order on the space of model-theoretic constraints and a learning algorithm for constraint inference.
Jane Chandlee
,
Remi Eyraud
,
Jeffrey Heinz
,
Adam Jardine
,
Jon Rawski
PDF
Cite
Poster
Slides
DOI
Official Pub
Finite-State Locality in Semitic Root-and-Pattern Morphology
We describe the finite-state nature of root-and-pattern morphology using Semitic as a case study, and discuss issues of finiteness vs. infinity, and template emergence.
Hossep Dolatian
,
Jon Rawski
PDF
Cite
DOI
Phonological Complexity is Subregular: Evidence from Sign Language
I show the complexity of several signed processes is subregular across speech and sign using string representations.
Jon Rawski
PDF
Cite
Slides
«
Cite
×