D. Lightfoot, How to Set Parameters, MIT Press, Cambridge MA,1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Formal Theory of Language Development - Yang (Correct)
....rewarded, and those that fail are punished. There is neurological evidence (Hebb 1954; Hubel Wiesel 1962; Changeux 1983; Edelman 1987; inter alia) that the development of neural substrate is guided by the exposure to specific stimulus in the environment in a Darwinian selectionist fashion (cf. Lightfoot 1991). 2.3 The asymptotic behavior of the learner For simplicity, assume that there are two grammars (N = 2) the target grammar T 1 and a pretender T 2 . The results presented here generalize to the N grammar case; see Narendra Thathachar (1989) Definition: The penalty probability of grammar T i ....
....#p 1 : E[#p 1 ] 1 #)p 1 (p 2 c 2 p 1 c 1 ) 2) Since p 2 = 1 p 1 , #p 1 [2] is obviously a quadratic function of p 1 (t) Therefore, the growth of p 1 will produce the familiar S shape curve. There is evidence for an S shape pattern in child language development (Clahsen Smolka 1986; Lightfoot 1991; Wijnen 1999; inter alia) which, if true, suggests that an error driven learner might indeed be what the child learner employs. 2.4 Unambiguous evidence is not necessary In the present model, the course and outcome of language development are determined by the relative (un)fitness of the ....
Lightfoot, D. (1991). How to set parameters . Cambridge, MA: MIT Press.
Advances in the Computational Study of Language Acquisition - Brent (1996) (9 citations) (Correct)
....of a large but finite number of possible grammars is not necessarily a problem for consistent algorithms, because they can permanently eliminate many possible grammars at a stroke. For example, a single trigger sentence could lead a consistent algorithm to set a parameter permanently (e.g. Lightfoot, 1991). Once one parameter has been set, only n Gamma 1 parameters remain to be set. This yields only 2 n Gamma1 = 1 2 (2 n ) possible grammars half of the possible grammars have been eliminated by the setting of a single parameter on the basis of a single input sentence. Whether trigger ....
Lightfoot, D. W. (1991). How to Set Parameters. Cambridge, MA: MIT Press.
Surface Cues and Robust Inference as a Basis for the Early.. - Brent (1993) (2 citations) (Correct)
....malformed lexicons. Further, no parsing strategy is likely to be foolproof, so the problem of ungrammatical input is compounded by that of misconstrued input. 1. 3 Context and Methodology From one perspective, the current approach resembles parameter setting models (Chomsky, 1981; Chomsky, 1986; Lightfoot, 1991); it assumes a fixed, finite menu of subcategorization frames from which a lexical entry is selected for each verb. For each verb V and each subcategorization S, the presence or absence of S in V s lexical entry can be seen as a binary valued lexical parameter. The function morpheme cues proposed ....
....of saliency and frequency. One can be sure that parameters are not always set by single events; that would make the child too trigger happy and inclined to draw long term conclusions (a metaphor) from insufficient data. However, some parameters may require more triggering experience than others. (Lightfoot, 1991, p. 19) A precise algorithm for determining the amount of data required to set each parameter is presented in Section 3 (and Appendix A) This appears to be the first explicit proposal in this domain. This work suggests that weighing linguistic evidence is by no means a trivial problem; indeed, ....
Lightfoot, D. W. (1991). How to Set Parameters. MIT Press, Cambridge, MA.
Kolmogorov Complexity and the Information Content of Parameters - Clark (1994) (Correct)
....that is possible across languages. The constant U is of some linguistic interest. The problem now is to determine the value for U since doing so would greatly constrain the linguistic theory. Clark (1992) does not attempt to assign a specific value to U . Recent proposals by Morgan (1986) Lightfoot (1989;1991) and Rizzi (1989) can be taken as specific empirical proposals for the value of this constant. For any proposed value for U , we can ask whether some smaller value might not be adequate. The best theory is one which establishes a firm lower bound on the value of U such that a minimal text ....
Lightfoot, D. (1991). How to Set Parameters. The MIT Press. Cambridge, MA.
Characterising Innateness in Artificial and Natural Learning - Dessalles (Correct)
....learned by the child. Face recognition could be one such module, but the archetypal example is certainly language processing. Chomsky (1968, 1988) asserts that humans are innately biased to learn a small number of language structures. The corresponding learning mechanism, the setting of parameters (Lightfoot, 1991, Crain, 1991) is by no means indifferent: it relies on a matching with preexisting structures. Imagine that in a remote area, natives speak a strange language: it is like English, except that some words are systematically permuted in each sentence, for instance the first and the fourth. Correct ....
Lightfoot, D. (1991). How to set parameters. MIT Press.
Uncertainty in the Common Ground - Nilsenova (2000) (Correct)
No context found.
D. Lightfoot, How to Set Parameters, MIT Press, Cambridge MA,1991.
The Informational Complexity of Learning from Examples - Niyogi (1996) (2 citations) (Correct)
No context found.
D. Lightfoot. How to Set Parameters. MIT Press, Cambridge, MA, 1991.
A Dynamical Systems Model for Language Change - Partha Niyogi (Correct)
No context found.
D. Lightfoot. How to Set Parameters. MIT Press, Cambridge, MA, 1991.
The Logical Problem of Language Change - Niyogi (1995) (4 citations) (Correct)
No context found.
D. Lightfoot. How to Set Parameters. MIT Press, Cambridge, MA, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC