A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative
The logical problem of language acquisition has been at the forefront of psycholinguistics and behavioral neuroscience for decades. One of the most influential answers to the problem of how successful acquisition occurs on the basis of noisy input suggests that the child is aided by innate principle...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carnegie Mellon University Library Publishing Service
2022-05-01
|
| Series: | Language Development Research |
| Subjects: | |
| Online Access: | https://lps.library.cmu.edu/LDR/article/id/585/ |
| _version_ | 1797302995694649344 |
|---|---|
| author | Elliot Murphy Evelina Leivada |
| author_facet | Elliot Murphy Evelina Leivada |
| author_sort | Elliot Murphy |
| collection | DOAJ |
| description | The logical problem of language acquisition has been at the forefront of psycholinguistics and behavioral neuroscience for decades. One of the most influential answers to the problem of how successful acquisition occurs on the basis of noisy input suggests that the child is aided by innate principles and parameters (P&P). These are conceived aspart of our biological endowment for language. Previous work on the computability of parametric models has focused on the process of parameter-setting,leaving settability unaddressed. Settability is a key notion in parametric models since it provides an answer to the logical problem of language acquisition: the setting of one parameter carries implications for the settability of others, minimizing the child’s task. However, a mathematical analysis of the expected probability of successful computation of settability relations has not been carried out. We report results from a novel program developed to calculate the probability of successful computation of a network of 62 linguistic parameters as attested in 28 languages, spanning across 5 language families. The results reveal that some parameters have an extremely low probability of successful computation, such that trillions of unsuccessful computations are expected before a successful setting occurs. Using the same program, we performed an additional second analysis to a different network, covering 94 parameters from58 languages and 15 language families. In this case, the estimated number of expected unsuccessful computations rose from trillions to quadrillions. These results raise concerns about the computational feasibility of the highly influential P&P approach to language development. Merging insights from various acquisition models, including some developed within P&P, a biologically plausible alternative is offered for the process of deciphering a target grammar in the acquisition of both spoken and signed languages. Overall, our analysis of the P&P approach to language acquisition centers learnability and computability constraints as the major factors for determining the psychological plausibility of grammar development. |
| first_indexed | 2024-03-07T23:46:34Z |
| format | Article |
| id | doaj.art-ce282be7dcbc437685f762aa4ed88164 |
| institution | Directory Open Access Journal |
| issn | 2771-7976 |
| language | English |
| last_indexed | 2024-03-07T23:46:34Z |
| publishDate | 2022-05-01 |
| publisher | Carnegie Mellon University Library Publishing Service |
| record_format | Article |
| series | Language Development Research |
| spelling | doaj.art-ce282be7dcbc437685f762aa4ed881642024-02-19T12:27:13ZengCarnegie Mellon University Library Publishing ServiceLanguage Development Research2771-79762022-05-012110.34842/2022-585A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternativeElliot Murphy0https://orcid.org/0000-0003-1456-0343Evelina Leivada1https://orcid.org/0000-0003-3181-1917University of Texas Health Science Center at HoustonUniversitat Rovira i VirgiliThe logical problem of language acquisition has been at the forefront of psycholinguistics and behavioral neuroscience for decades. One of the most influential answers to the problem of how successful acquisition occurs on the basis of noisy input suggests that the child is aided by innate principles and parameters (P&P). These are conceived aspart of our biological endowment for language. Previous work on the computability of parametric models has focused on the process of parameter-setting,leaving settability unaddressed. Settability is a key notion in parametric models since it provides an answer to the logical problem of language acquisition: the setting of one parameter carries implications for the settability of others, minimizing the child’s task. However, a mathematical analysis of the expected probability of successful computation of settability relations has not been carried out. We report results from a novel program developed to calculate the probability of successful computation of a network of 62 linguistic parameters as attested in 28 languages, spanning across 5 language families. The results reveal that some parameters have an extremely low probability of successful computation, such that trillions of unsuccessful computations are expected before a successful setting occurs. Using the same program, we performed an additional second analysis to a different network, covering 94 parameters from58 languages and 15 language families. In this case, the estimated number of expected unsuccessful computations rose from trillions to quadrillions. These results raise concerns about the computational feasibility of the highly influential P&P approach to language development. Merging insights from various acquisition models, including some developed within P&P, a biologically plausible alternative is offered for the process of deciphering a target grammar in the acquisition of both spoken and signed languages. Overall, our analysis of the P&P approach to language acquisition centers learnability and computability constraints as the major factors for determining the psychological plausibility of grammar development.https://lps.library.cmu.edu/LDR/article/id/585/acquisitionlanguagelearnabilityUniversal Grammarcomputability |
| spellingShingle | Elliot Murphy Evelina Leivada A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative Language Development Research acquisition language learnability Universal Grammar computability |
| title | A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| title_full | A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| title_fullStr | A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| title_full_unstemmed | A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| title_short | A demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| title_sort | demonstration of the uncomputability of parametric models of language acquisition and a biologically plausible alternative |
| topic | acquisition language learnability Universal Grammar computability |
| url | https://lps.library.cmu.edu/LDR/article/id/585/ |
| work_keys_str_mv | AT elliotmurphy ademonstrationoftheuncomputabilityofparametricmodelsoflanguageacquisitionandabiologicallyplausiblealternative AT evelinaleivada ademonstrationoftheuncomputabilityofparametricmodelsoflanguageacquisitionandabiologicallyplausiblealternative AT elliotmurphy demonstrationoftheuncomputabilityofparametricmodelsoflanguageacquisitionandabiologicallyplausiblealternative AT evelinaleivada demonstrationoftheuncomputabilityofparametricmodelsoflanguageacquisitionandabiologicallyplausiblealternative |