Start Submission Become a Reviewer

Reading: Long-distance consonant agreement and subsequentiality

Download

A- A+
dyslexia friendly

Research

Long-distance consonant agreement and subsequentiality

Author:

Huan Luo

Department of Linguistics and Cognitive Science, University of Delaware, Newark, DE 19716, US
X close

Abstract

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 subsequential. This paper further argues that subsequentiality is a desirable computational characterization of long-distance consonant agreement for the following reasons. First, it is sufficiently expressive. Second, it is restrictive as it accounts for the absence of pathological patterns like Majority Rules and Sour Grapes from the typology (Heinz & Lai 2013), standing in contrast to Agreement by Correspondence analysis in Optimality Theory (Rose & Walker 2004; Hansson 2007).

How to Cite: Luo, H., (2017). Long-distance consonant agreement and subsequentiality. Glossa: a journal of general linguistics. 2(1), p.52. DOI: http://doi.org/10.5334/gjgl.42
88
Views
54
Downloads
Published on 31 May 2017.
Peer Reviewed

Downloads

  • PDF (EN)

    comments powered by Disqus