13
views
0
recommends
+1 Recommend
1 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Long-distance consonant agreement and subsequentiality

      Glossa: a journal of general linguistics
      Ubiquity Press, Ltd.

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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).

          Related collections

          Author and article information

          Journal
          Glossa: a journal of general linguistics
          Glossa
          Ubiquity Press, Ltd.
          2397-1835
          January 20 2017
          May 31 2017
          : 2
          : 1
          : 52
          Article
          10.5334/gjgl.42
          e4821cc8-c634-44b0-9ddf-7ed0c2057436
          © 2017

          Comments

          Comment on this article