2002
DOI: 10.1515/tlir.19.1-2.185
|View full text |Cite
|
Sign up to set email alerts
|

Searching for arguments to support linguistic nativism

Abstract: Few arguments are more dangerous than the ones that "feel" right but can't be justiÞed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 107 publications
(17 citation statements)
references
References 28 publications
0
17
0
Order By: Relevance
“…It should be noted that these prior constraints on the class of possible (or accessible) languages are of a general type and not 'language specific' per se (e.g., restrictions on the maximal number of rules employed by the languages in the class). As noted by Scholz and Pullum (2002), there exists classes of formal languages rich enough to encompass the 'string-sets' of human languages and at the same time being identifiable from a finite sequence of positive examples. Furthermore, the acquisition task becomes potentially more tractable if there are additional structure in the input or if only 'probable approximate' identification is required (cf.…”
Section: Learning Artificial Grammars the Question Of Knowledge Reprmentioning
confidence: 99%
See 1 more Smart Citation
“…It should be noted that these prior constraints on the class of possible (or accessible) languages are of a general type and not 'language specific' per se (e.g., restrictions on the maximal number of rules employed by the languages in the class). As noted by Scholz and Pullum (2002), there exists classes of formal languages rich enough to encompass the 'string-sets' of human languages and at the same time being identifiable from a finite sequence of positive examples. Furthermore, the acquisition task becomes potentially more tractable if there are additional structure in the input or if only 'probable approximate' identification is required (cf.…”
Section: Learning Artificial Grammars the Question Of Knowledge Reprmentioning
confidence: 99%
“…It should be noted that simulations of a simple recurrent neural network, using finite precision numbers, effectively becomes a simulation of a finite state architecture. In summary, as noted by Scholz and Pullum (2002), formal learning theory (Jain et al, 1999) holds open the possibility that language classes of interest, at least in principle, can be acquired from weak environmental input consisting of a finite sequence of un-interpreted positive example .…”
Section: Learning Artificial Grammars the Question Of Knowledge Reprmentioning
confidence: 99%
“…Chomsky (1965Chomsky ( , 1972Chomsky ( , 1981; O'Grady (1997); Lightfoot (1999); Anderson and Lightfoot (2002) ;Fitch, Hauser and Chomsky (2005) and by the observation that all normal children (1) invariably acquire successfully a remarkably complex grammatical system, and do so (2) at roughly the same pace, (3) following roughly the same developmental process, (4) unconsciously without explicit instruction, (5) despite the fact that the speech input they receive is very often imperfect, in that the speech input they receive is often imperfect, containing false starts, unfinished sentences, and the like, and (6) "do not provide adequate information about complex structures in the language for the child to acquire these on the basis of the input alone'' (Lakshmanan, 1994, p. 3). This acquisition phenomenon, where there is a mismatch between the speech input which children are exposed to and their linguistic competence which goes far beyond the impoverished input they receive, is known as the logical problem of language acquisition or the poverty of the stimulus (for further discussion, see Thomas (2002);Sampson (2002); Lasnik and Uriagereka (2002); Scholz and Pullum (2002);Fodor and Crowther (2002) Schwartz and Sprouse 2013).…”
Section: Ug and Child Language Acquisitionmentioning
confidence: 99%
“…It should be noted that these prior constraints on the class of possible (or accessible) languages are of a general type and not “language‐specific” per se (e.g., restrictions on the maximal number of rules employed by the languages in the class). As noted by Scholz and Pullum (2002), there exists classes of formal languages rich enough to encompass the “string‐sets” of human languages and at the same time identifiable from a finite sequence of positive examples. Clearly, the acquisition task becomes potentially more tractable if there is additional structure in the input or if only “probable approximate” identification is required.…”
Section: Implications For Formal Learning Theorymentioning
confidence: 99%