Long-distance consonant agreement and subsequentiality
Johnson (1972) and Kaplan & Kay (1994) showed that phonological processes belong to the computational class of regular relations. This paper provides a computational analysis of long-distance consonant agreement and shows that it belongs to a more restricted computational class called subsequent...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Library of Humanities
2017-05-01
|
| Series: | Glossa |
| Subjects: | |
| Online Access: | http://www.glossa-journal.org/articles/42 |