Hossep Dolatian


2020

pdf bib
Probing RNN Encoder-Decoder Generalization of Subregular Functions using Reduplication
Max Nelson | Hossep Dolatian | Jonathan Rawski | Brandon Prickett
Proceedings of the Society for Computation in Linguistics 2020

pdf bib
Multi-Input Strictly Local Functions for Templatic Morphology
Hossep Dolatian | Jonathan Rawski
Proceedings of the Society for Computation in Linguistics 2020

pdf bib
Multi-Input Strictly Local Functions for Tonal Phonology
Jonathan Rawski | Hossep Dolatian
Proceedings of the Society for Computation in Linguistics 2020

2019

pdf bib
RedTyp: A Database of Reduplication with Computational Models
Hossep Dolatian | Jeffrey Heinz
Proceedings of the Society for Computation in Linguistics (SCiL) 2019

2018

pdf bib
Modeling Reduplication with 2-way Finite-State Transducers
Hossep Dolatian | Jeffrey Heinz
Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology

This article describes a novel approach to the computational modeling of reduplication. Reduplication is a well-studied linguistic phenomenon. However, it is often treated as a stumbling block within finite-state treatments of morphology. Most finite-state implementations of computational morphology cannot adequately capture the productivity of unbounded copying in reduplication, nor can they adequately capture bounded copying. We show that an understudied type of finite-state machines, two-way finite-state transducers (2-way FSTs), captures virtually all reduplicative processes, including total reduplication. 2-way FSTs can model reduplicative typology in a way which is convenient, easy to design and debug in practice, and linguistically-motivated. By virtue of being finite-state, 2-way FSTs are likewise incorporable into existing finite-state systems and programs. A small but representative typology of reduplicative processes is described in this article, alongside their corresponding 2-way FST models.