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

      The Credit Problem in parametric stress: A probabilistic approach

      1 , 2
      Glossa: a journal of general linguistics
      Open Library of the Humanities

      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

          In this paper, we introduce a novel domain-general, statistical learning model for P&P grammars: the Expectation Driven Parameter Learner (EDPL). We show that the EDPL provides a mathematically principled solution to the Credit Problem (Dresher 1999). We present the first systematic tests of the EDPL and an existing and closely related model, the Naïve Parameter Learner (NPL), on a full stress typology, the one generated by Dresher & Kaye’s (1990) stress parameter framework. This framework has figured prominently in the debate about the necessity of domain-specific mechanisms for learning of parametric stress. The essential difference between the two learning models is that the EDPL incorporates a mechanism that directly tackles the Credit Problem, while the NPL does not. We find that the NPL fails to cope with the ambiguity of this stress system both in terms of learning success and data complexity, while the EDPL performs well on both metrics. Based on these results, we argue that probabilistic inference provides a viable domain-general approach to parametric stress learning, but only when learning involves an inferential process that directly addresses the Credit Problem. We also present in-depth analyses of the learning outcomes, showing how learning outcomes depend crucially on the structural ambiguities posited by a particular phonological theory, and how these learning difficulties correspond to typological gaps.

          Related collections

          Most cited references58

          • Record: found
          • Abstract: not found
          • Article: not found

          Maximum Likelihood from Incomplete Data Via the EM Algorithm

            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Lectures on Government and Binding

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A mathematical model for simple learning.

                Bookmark

                Author and article information

                Journal
                Glossa: a journal of general linguistics
                Open Library of the Humanities
                2397-1835
                January 4 2021
                November 18 2021
                : 6
                : 1
                Affiliations
                [1 ]Utrecht University
                [2 ]University of Massachusetts Amherst
                Article
                10.16995/glossa.5884
                ccfdfd1d-49c1-4c77-8cee-aea13a8bb847
                © 2021

                https://creativecommons.org/licenses/by/4.0

                Product
                Self URI (article page): https://www.glossa-journal.org/article/id/5884/

                Comments

                Comment on this article