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
- Editors:
- Garrett Nicolai, Ryan Cotterell
- Venue:
- ACL
- SIG:
- SIGMORPHON
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 196–205
- Language:
- URL:
- https://preview.aclanthology.org/build-pipeline-with-new-library/W19-4223/
- DOI:
- 10.18653/v1/W19-4223
- 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., ACL 2019)
- PDF:
- https://preview.aclanthology.org/build-pipeline-with-new-library/W19-4223.pdf