Weakly deterministic transformations are subregular

Andrew Lamont, Charlie O’Hara, Caitlin Smith


Abstract
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.
Anthology ID:
W19-4223
Volume:
Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology
Month:
August
Year:
2019
Address:
Florence, Italy
Venues:
ACL | WS
SIG:
SIGMORPHON
Publisher:
Association for Computational Linguistics
Note:
Pages:
196–205
Language:
URL:
https://aclanthology.org/W19-4223
DOI:
10.18653/v1/W19-4223
Bibkey:
Cite (ACL):
Andrew Lamont, Charlie O’Hara, and Caitlin Smith. 2019. Weakly deterministic transformations are subregular. In Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology, pages 196–205, Florence, Italy. Association for Computational Linguistics.
Cite (Informal):
Weakly deterministic transformations are subregular (Lamont et al., 2019)
Copy Citation:
PDF:
https://aclanthology.org/W19-4223.pdf