Abstract
This paper focuses on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006). It develops necessary and sufficient constraint characterizations of T-orders within Harmonic Grammar and Optimality Theory. These conditions rest on the rich convex geometry underlying these frameworks. They are phonologically intuitive and have significant algorithmic implications.- Anthology ID:
- W18-5801
- Volume:
- Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology
- Month:
- October
- Year:
- 2018
- Address:
- Brussels, Belgium
- Venue:
- EMNLP
- SIG:
- SIGMORPHON
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 1–10
- Language:
- URL:
- https://aclanthology.org/W18-5801
- DOI:
- 10.18653/v1/W18-5801
- Cite (ACL):
- Giorgio Magri. 2018. Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem. In Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology, pages 1–10, Brussels, Belgium. Association for Computational Linguistics.
- Cite (Informal):
- Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem (Magri, EMNLP 2018)
- PDF:
- https://preview.aclanthology.org/auto-file-uploads/W18-5801.pdf