N. Chomsky, On certain formal properties of grammars, Inform. Cont. 2 (1959) 137.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of a logic designed for program analysis. 1 The borderline between natural languages and programming languages One of the earliest examples of work on the borderline of natural language analysis and computer science is the mathematical theory of languages proposed by Noam Chomsky in the 1950s [7, 8]. Chomsky proposed to use context free rules as a grammar formalism: S NP VP is an example of a rule saying that a sentence S consists of a nominal phrase NP followed by a verb phrase VP. Further rules of the same form then describe the internal structure of NP and VP. The context free rules ....

N. Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-- 167, 1959.

....: 65 1. Introduction This chapter is devoted to context free languages. Context free languages and grammars were designed initially to formalize grammatical properties of natural languages [9]. They subsequently appeared to be well adapted to the formal description of the syntax of programming languages. This led to a considerable development of the theory. The presentation focuses on two basic tools: context free grammars and pushdown automata. These are indeed the standard tools to ....

....) over the terminal alphabet A is in weak Chomsky normal form if each nonterminal rule has a right member in V each terminal rule has a right member in A [ f g. It is in Chomsky normal form if it is in Chomsky normal form and each right member of a nonterminal rule has length 2. Theorem 3.1. [28, 9] Given a context free grammar, an equivalent contextfree grammar in Chomsky normal form can effectively be constructed. Proof. The construction is divided into three steps. In the first step, the original grammar is transformed into a new equivalent grammar in weak Chomsky normal form. In the ....

N. Chomsky. On certain formal properties of grammars. Inform. and Control, 2:137--167, 1959.

....point where it meets the final node e of the spine determines the suffLx after that point, in a way that an unbounded quantity of symbols from the prefix need to be taken into account. A formal explanation for why the grammar may not generate a regular language relies on the following definition [4]: 14 S a6a S bSb 6 6 Ss a 6 a a 6s b 6 b b 65 6s a 6s ,i 4 . Ss Ss b Ss Ss 65 . SsSs b Sf Ss Ss b (a) b) Figure 1. Parse rees for a pafindrome: a) original grammar, b) transformed grunmar (Sec tion 6) Definition 1 A grammar is serf embedding if there is some A N ....

N. Chomsky. 1959. On certain formal properties of grammars. Information and Control, 2:137-167.

....1914 [8] Given a xed alphabet X , they consist of rules u v with u 2 X and v 2 X , allowing the transformation of words, and consequently of languages. Noam Chomsky, with linguistic goals in mind, in the late 1950 s modi ed these into tools for language generation called grammars, [1, 2, 3], see also [4] By the mid 60 s the classi cation had settled down to the four classical types of grammars, enumerated from 0 to 3. Some variations on these are worth considering as well. Here are the formal de nitions: 0.2.00 De nition. cf. 6] and [5] A phrase structure grammar (or grammar ....

Chomsky, N. On certain formal properties of grammars. Information and Control 2 (1959), 137167.

.... section we can state that a graph grammar is a nite structure G = fG; r 1 ; r n g whereby the start graph G is the axiom and the graph replacement patterns r 1 ; r n are the rules of the calculus which is a generalization of the well known 1 dimensional (textual) Chomsky systems [4]. The di erent possible semantics i.e. the di erent possible ways of how to perform an application of a graph replacement rule r i in detail are described in the literature [23] and do not belong to the scope of this paper. Central Station T1 T1 U2 U2 B12 Air Port Music Hall Main ....

N. Chomsky, On certain Formal Properties of Grammars. Inform. & Ctrl. 2/2, pp.137-167, 1959

....concerns of Computational Linguistics and Natural Language Processing (NLP) Formal clarity, descriptive adequacy, declarativity, modularity, re usability, and related concepts have been desiderata for NLP theories and systems from the very beginning. Context free) Phrase structure grammar (Chomsky, 1959), augmented transition networks (Woods, 1970) de nite clause grammars (Pereira Warren, 1980) chart parsing (Younger, 1967; Kay, 1973) feature structures and uni cation (Kay, 1979) taxonomic logics (Brachman Schmolze, 1985) and constraint based approaches to grammar and processing (Sells, ....

Chomsky, N. (1959). On certain formal properties of grammars. Information and Control, 2, 173 - 167.

....store partial constituents of the sentence (e.g. in (1a) so for example the NP The salmon must be stored while the embedded constituent is processed. Miller [Mil62] and Miller and Chomsky [MC63] were the first to investigate the difficulty of comprehending English CECs like (1) and Chomsky [Cho59] proved that natural languages in general are not context free because they have the property of arbitrary center embedding (also see [HU79] Clearly some kind of constrained parsing comes into play in human sentence processing. The exact nature of this parsing mechanism has been hard to pin ....

Noam Chomsky. On certain formal properties of grammar. Information and Control, 2:137--167, 1959. 129

....it provides means to run programs on the internet web browser and because of an immense marketing effort of the Sun company. Development of Computer Science Knowledge Simultaneously with the developments of programming languages, a theoretical basis for these was developed by Noam Chomsky [Chomsky 59] Chomsky 65] and others in the form of generative grammar models (Solution Domain Knowledge) Knuth presented a comprehensive overview of a wide variety of algorithms and the analysis of them [Knuth 67] Wirth introduced the concept of stepwise refinement [Wirth 71a] of program construction and ....

Chomsky, N., On certain formal properties of grammars, Information and Control 2,2(1959), 137-167, 1959.

....5 we explain how we combined SDF with Haskell data type definitions into the syntax definition formalism HASDF. We present the HASDF tool, and make some remarks about its implementation. Section 6 summarizes our work and lists possible directions of future work. 2 Generating parsers Chomsky [2] classified languages into a hierarchy of four types. The largest class of languages for which efficient parsing methods are known is the class of context free grammars. In this section we will discuss why common technology for generating parsers from context free grammars does not satisfy the ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2:137--167, 1959.

....or, equivalently, whether another class is closed under inverse homomorphism. Noam Chomsky has already observed in his famous work that CSL is 1 3 characterized by monotone grammars, that is, grammars in which in every rule a string is replaced by a string that is at least as long as the rst one [Cho59]. We will use this characterization as a denition. By replacing iat least as long asj in the denition of the class CSG of 1 4 context sensitive grammars by ilonger than,j we obtain growing contextsensitive grammars (GCSG) which dene the class of growing context sensitive languages (GCSL) Elias ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2:137167, 1959.

....a fan out (or Post Summit) occurs, involving passing the relevant evaluation results to each team, possibly affecting their (local) state. At a later point, when both teams are ready for a second test, a second Summit activity is initiated. 3.5. 3 Grammar Based PMLs The grammar hierarchy [22] and the corresponding automata provide another powerful formalism for modeling a wide variety of systems, although they may have been less frequently applied to software process modeling than the other paradigms mentioned. There is a spectrum of approaches to employing grammars in process ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2), 1959.

....a fan out (or post Summit) occurs, involving passing the relevant evaluation results to each team, possibly affecting their (local) state. At a later point, when both teams are ready for a second test, a second Summit activity is initiated. 4. 2 Grammar Based PMLs The grammar hierarchy [13] and the corresponding automata provide another powerful set of formalisms for modeling a wide variety of systems, although they may have been less frequently applied to software process modeling than the other paradigms mentioned. There is a spectrum of approaches to employing grammars in process ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2), 1959.

....9.3.1 Analysis and Compilation Context free grammars may generate languages that are not regular. We describe a subclass of grammars, strongly regular grammars, that are guaranteed to generate regular languages. This class of grammars coincides with that of grammars without self embedding [Chomsky 1959]. Furthermore, strongly regular grammars can be mapped into equivalent finite automata using an efficient algorithm. We then present our approximation algorithm, which transforms any grammar into one that is strongly regular. Note that a mapping from an arbitrary CFG generating a regular language ....

Chomsky, N.: 1959, On certain formal properties of grammars, Information and Control 2, 137-- 167.

....vs. Dependency Grammars Two predominant syntactic approaches used in NLP are phrase structure (constituency) grammar and dependency grammar [4] Phrase structure grammar is often used for modeling English syntax and was formulated by Leonard Bloomfield [5] for just that purpose. Noam Chomsky [6, 7, 8, 9, 10, 11] later introduced his transformational generative approach, which has since become widely accepted (as demonstrated by such texts as [12, 13, 14] On the other hand, dependency grammar [15, 16] which was popularized by Lucien Tesni ere [17] has traditionally been studied for modeling flexible ....

....types of conservative learners. Perhaps the most difficult aspect of grammar induction lies in how to bound the search space while still retaining the expressive power of English. Although a grammar for English requires a formalism with the generative capacity at least as powerful as a CFG [8], grammar induction efforts have often focused on regular languages [74, 77, 78] and, to make the procedures efficient, have often made additional restricting assumptions [74, 78] To learn a CFG, a learning algorithm must not only learn the grammar rules, but it must also determine the ....

Noam Chomsky. On certain formal properties of grammar. Information and Control, 2:137--167, 1959.

....to output O(n 2 ) structural relationships. This suspicion is confirmed when we consider some specific characteristics of our domain, natural language sentences. It has long been known that constraints on people s ability to process language put a bound on constructions such as centre embedding [4], which are the only constructions which would actually require allowing for O(n 2 ) structural relationships. For example, the rat that the cat that the dog chased bit died is almost impossible to understand without pencil and paper, but the dog chased the cat that bit the rat that died is ....

N. Chomsky. On certain formal properties of grammars. Information and Control, 2:137--167, 1959.

....which must adopt models that deal with long distance pairwise correlations between residues. Computational linguistics is a rich source of ideas for how to model strings with correlated symbols (Searls, 1992) A central concept is the Chomsky hierarchy of formal transformational grammars (Chomsky, 1959). The assumptions of most biological sequence algorithms correspond to those of the regular grammars, the lowest level in the Chomsky hierarchy. In order of increasing power to describe higher order correlations, the other levels of the Chomsky hierarchy are the context free, the ....

Chomsky, D. (1959). On certain formal properties of grammars. Information and Control, 2, 137-76.

....: 65 2 Jean Michel Autebert, Jean Berstel, and Luc Boasson 1. Introduction This chapter is devoted to context free languages. Context free languages and grammars were designed initially to formalize grammatical properties of natural languages [9]. They subsequently appeared to be well adapted to the formal description of the syntax of programming languages. This led to a considerable development of the theory. The presentation focuses on two basic tools: context free grammars and pushdown automata. These are indeed the standard tools to ....

....the terminal alphabet A is in weak Chomsky normal form if each nonterminal rule has a right member in V and each terminal rule has a right member in A [ f g. It is in Chomsky normal form if it is in Chomsky normal form and each right member of a nonterminal rule has length 2. Theorem 3.1. [28, 9] Given a context free grammar, an equivalent contextfree grammar in Chomsky normal form can effectively be constructed. Proof. The construction is divided into three steps. In the first step, the original grammar is transformed into a new equivalent grammar in weak Chomsky normal form. In the ....

N. Chomsky. On certain formal properties of grammars. Inform. and Control, 2:137--167, 1959.

....of bounded order or whether another class is closed under inverse homomorphisms. Noam Chomsky already has observed in his famous work that CSL is characterized by monotone grammars, that are grammars in which in every rule a string is replaced by a string that is at least as long as the first one ([Cho59]. We will use this characterization for definition. Dahlhaus and Warmuth investigated the complexity of growing context sensitive languages (GCSL) and found out that GCSL is contained in LOGCFL ( DW86] the class of such languages that can be transformed into a context free language (CFL) using ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2:137--167, 1959.

....grammar rules. They are sometimes numbered from type 0 (the most general class) to type 3 (the most limited class) A good treatment of the four classes of the Chomsky hierarchy occurs in [Hopc 79] a shorter treatment occurs in [Clea 76] Primary sources for the Chomsky hierarchy are [Chom 56, Chom 59] 1.1 Introduction Formally, a Chomsky grammar has four parts: 1) a set of symbols called terminals, 2) a set of symbols called nonterminals, 3) a start symbol, which is one of the nonterminals, and (4) a set of rewrite rules. Terminals are the vocabulary of the language defined by the ....

Noam Chomsky, "On Certain Formal Properties of Grammars", Information and Computation 2 no. 2 (May 1958), pp. 137--167.

....structure. Notice that we are here still assuming the input to be a linear string. The increase in complexity is thus confined entirely to the space of considered position structures. 3. 2 An Algorithm for # #Revised# # Chomsky Normal Form Position Structure Grammars Chomsky Normal Form (Chomsky 1959) is an often studied canonical form for context free grammars. Intuitively, it enforces binary branching in the derivation tree. 33) A formal grammar is in Chomsky Normal Form (CNF) if every production has for its right side either two non terminals or one terminal. CNF is of interest to computer ....

Chomsky, Noam. 1959. On certain formal properties of grammars. Information and Control 2: 137-167.

....does not lend itself to modeling lexical context in a natural way. We will propose using a robust version of link grammar as our grammatical formalism and explain how it overcomes the shortcomings of contextfree grammars. 4.1. Probabilistic context free grammars Context free grammars [8] [9] [10] enjoy widespread use in the study of natural language. CFGs are able to model hierarchical data and the formalism has been used to create syntactic parsers for natural language. Given a CFG for a language, one can build a stochastic grammar that can be used to model that language. A PCFG is ....

N. Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-- 167, 1959.

....viable a language must also be learnable by subsequent generations. Those languages that match the innate learning biases of their users will have a distinct advantage over those that do not (Kirby, 1998a) The relationship between language classes and computational constraints was explored by Chomsky (1959) who proposed a hierarchy of formal languages and corresponding symbolic automata. While the inherently symbolic systems of the Chomsky hierarchy have proven useful for describing certain aspects of human languages, it has more recently been suggested that dynamical systems may provide a more ....

Chomsky, N. (1959). On certain formal properties of grammars. Information and Control, 2(2):113-124.

....of DPEs for modelling true concurrency. In this paper, the third subclass, safe DPEs, will be proved equivalent to k safe Petri nets. DPEs were originated for describing concurrent program behavior. In our DPE taxonomy, the 1 The PA hierarchy is orthogonal to the Chomsky hierarchy [Chomsky 56, Chomsky 59] since the PA hierarchy classifies languages according to concurrent complexity, while the Chomsky hierarchy classifies them according to sequential complexity. 3 Subclass Semantic Model Sequential DPEs Finite State Automata Multiple DPEs k Safe Nets (subset) Safe DPEs k Safe Nets General DPEs ....

....structurally isomorphic to M . U accepts the same language as U does. 11 Several other results of FSA theory can be applied to PAs, but are not discussed in this paper for lack of space. In particular, the authors are working on a hierarchy of PAs analogous to the Chomsky hierarchy [Chomsky 56, Chomsky 59] We believe the PA hierarchy is orthogonal to the Chomsky hierarchy. 2.7. The Equivalence of Safe PAs and finite k Safe Nets In this section, we prove that the class of languages accepted by safe PAs is equivalent to the class described by finite k safe nets. We do this in two steps, and we use ....

N. Chomsky. On Certain Formal Properties of Grammars. Information and Control 2(2):137-167, 1959.

....of Formal Language Theory and leading to the identification of hierarchies of language complexity classes. There was an expectation, in this early work, that such classes would play a significant role in defining the structure of natural languages. The initial definition of the Chomsky Hierarchy (Chomsky 1959) was motivated, in part, by the idea that the hierarchy might serve to characterize the class of natural languages, at least in the broad sense that some level might be shown to include the natural languages while excluding significant categories of non natural languages. The intent was that by ....

....transition can be found in the evolution of GPSG into HPSG, albeit accompanied, in that case, by a move from trees to a more general class of structures. 1. 1 From Rewriting Systems to Constraint Based Formalisms In one of the earliest applications of formal language theory to natural language Chomsky (1959, 1957) undertook to prove that English is not included in the regular languages, and consequently, that finitestate automata are inadequate to model the human language faculty. At the same time he argued informally that the context free grammars were also, if not inadequate, then at least ....

[Article contains additional citation context not shown here]

Chomsky, Noam. 1959. On Certain Formal Properties of Grammars. Information and Control 2:137--167.

....are equivalent to the classes of deterministic linear bounded automata, deterministic pushdown automata, and deterministic finite automata, respectively, in their language generating accepting ability. Thus, UPGs and these subclasses form a hierarchy parallel to the classical Chomsky hierarchy [2]. 2 Definitions and Basic Properties of UPG Definition 2.1 A uniquely parsable grammar (UPG) is a system G = N; T ; P; S; where N and T are sets of nonterminal and terminal symbols respectively (N T = S is a start symbol (S 2 N) and is a special end marker ( 2 (N [T ) P is ....

Chomsky, N.: On certain formal properties of grammars. Inf. Control 2, 137--167 (1959)

....space of possible set representations maps onto the space of grammars. Every computable set is the language of some grammar. Similarly, every computable set representation is equivalent to some class of grammars. These classes include, but are not limited to, the classes of the Chomsky hierarchy (Chomsky 1959) regular, context free, context sensitive, and recursively enumerable (r.e. The complexity of set operations generally increases with the expressiveness of the language class. Allowing H , C, and P to be recursively enumerable (i.e. arbitrary Turing machines) would certainly provide the most ....

Chomsky, N. 1959. On certain formal properties of grammars. Information and Control 2.

....and terminal symbols, respectively, S 2 N is the start symbol, and P is a finite set of productions of the form ff fi with ff; fi 2 (N [ T ) where ff contains at least one nonterminal symbol. The class of unrestricted grammars characterizes the class of recursively enumerable sets ([Cho59], see e.g. HU79] A grammar is context sensitive, if the start symbol S does not occur on the right hand side of any production and if, for each production (ff fi) 2 P , jffj jfij or (ff fi) S ) The corresponding language class is denoted by CSL. A grammar is called context free, if ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137--167, June 1959.

....the concepts of automaton and formal grammar see e.g. 83] for a survey. As firstly a logician, Chomsky himself helped to develop these concepts and we are indebted to him for a hierarchy of formal languages [30,31] and the relationship between linguistic theory and formal language theory [32,33,40]. Of course the notion of rule had no logical status by itself, even if it was possible to make a link with the notion of sequent in the Gentzen style presentation of logic, and grammatical symbols were conceived as atomic symbols. So, the link with traditional logic was rather poor. But some ....

....purely mathematical logical questions motivated by linguistic considerations, related to the articles in this volume. 3. 1 Formal language theory The best known connection is certainly Formal Language Theory 1 which as stated above was initiated in the late fifties with the works of Chomsky [31,32] for natural language syntax. Firstly this was considered as a part of logic, because of its relation to the theory of computability. Nevertheless it soon developed as an extended independent theory, with its own techniques, the major reason being its success for the study of programming languages ....

Noam Chomsky. On certain formal properties of grammars. Information and control, 2:137--167, 1959.

....) is a rewriting system, and S 2 N . We call N the nonterminal alphabet or the set of nonterminals. The set of tokens T is called the terminal alphabet or the set of terminals. The symbol S is the start symbol of G. Grammars are classified according to the Chomsky hierarchy into four groups [Cho59, Sal90] It can be shown that the hierarchy is a strictly decreasing hierarchy of language families. In the first group, we set no restrictions on the productions. In the second group, the productions are of type ffAfi ffffifi, where ff and fi are arbitrary strings over V , ffi is a nonempty ....

Noam Chomsky. On certain formal properties of grammars. Information and Control, 2:137 -- 167, June 1959.

....and this is where the cost benefit analysis of multimodality plays a major role. Theories of formal languages prove the correspondence between the expressive power of computable languages and the complexity of the abstract symbol processing machine that is able to compute their expressions [Chomsky 59, Aho and Ullmann 72] Thus, the more expressive the mode at the interface level, the more expensive the implementation of its processor. This simple rationale might work as a criterion to rule out optional multimodality in a number of cases. For instance, in case of inclusive multimodes, computer ....

.... recent research in Cognitive Science, and shown that this case is actually related to limiting abstractions for efficient processibility [Stenning and Oberlander 95] In it, authors have proposed a gradient of abstract representation systems parallel to Chomsky s hierarchy of formal languages [Chomsky 59] and proposed that specificity helps users reason when the level of the content s abstractions is high. So, we have applied their model to our framework and recast the issues about multimodality costs in terms of building one of Stenning and Oberlander s representation systems: MARS, LARS or ....

Chomsky, N. (1959). On certain formal properties of grammars. Information and Control, 2, pp. 137-167.

....isolated fact about two words. In general terms, languages display regularities in their ordering and selection of words which can be examined and described by linguists in formal, language and vocabulary independent, terms. Phrase structure grammars Modern formal syntax theory began with Chomsky[12]. Prior to this, grammatical sentences were generally analyzed by psychologists in terms of Markov chains. Linguists descriptions roughly resembled those in language textbooks, which are so informal as to be computationally useless. Determiners, for example, are generally followed either by ....

....with the number of the subject noun (box boxes) despite an indeterminate and possibly unlimited number of words, enough to exceed any possible (finite) context for a Markov chain. Chomsky demonstrated by a similar argument that human language could not be predicted by Markov chains and elaborated[12] a much more powerful formalism called phrase structure grammars that captures long distance dependency that is not permitted to Markov chains. A formal definition of these grammars and their properties can be found in [30, 31] the discussion here will be limited to the direct results applicable ....

Noam Chomsky. On certain formal properties of grammar. Information and Control, 2(2):137--67, 1959. 101

....the formalism, efficient parsing techniques cannot be used. For example, Carroll (1983) demonstrates that the automated analysis of dependencies is very complex, and shows that any parsing strategy apart from strictly left to right is impractical for large, general purpose ATN grammars. CF grammar (Chomsky, 1959) falls at the opposite extreme to ATNs. Efficient parsing techniques for it exist, but the formalism is not at all expressive, and for this reason in an unaugmented form it has been little used in practical NL processing systems. However, several systems have used variants of CF grammar (e.g. ....

....CNF. CNF forces natural language grammars to be written in an unnatural way, since rules introducing gaps and unary rules expanding non terminals are often convenient but are not allowed. It is possible to translate an arbitrary CF grammar into CNF with the help of additional, dummy nonterminals (Chomsky, 1959). However, there is no guarantee that for any particular grammar, the CNF version will not contain a great many more rules than the original grammar. When each rule has at most two daughters, the chart parsing algorithm presented here has the same time complexity with respect to input length as ....

Chomsky, N. (1959) "On certain formal properties of grammars." Information and Control, 2(2), 137--167.

....various types of conservative learners. Perhaps the most difficult aspect of grammar induction lies in how to bound the search space while still retaining the expressive power of English. Although a grammar for English requires a formalism with the generative capacity at least as powerful as a CFG [50], grammar induction efforts have often focused on regular languages [48, 51, 52] and, to make the procedures efficient, have often made additional restricting assumptions [48, 52] To learn a CFG, a learning algorithm must not only learn the grammar rules, but it must also determine the ....

N. Chomsky. On certain formal properties of grammar. Information and Control, 2:137--167, 1959.

....cognitive modeling, it does have some limitations. These limitations impose computational constraints on syntactic parsing in this architecture. Interestingly, most of these constraints have previously been proposed based on linguistic and psychological data. The parser must have a bounded memory (Chomsky, 1959), and in particular can only store information about a bounded number of things (Miller, 1956) The parser cannot explicitly represent disjunction, which in conjunction with the requirement that the parser s output be incrementally interpretable, means the parser must be deterministic in the sense ....

....Other levels of representation, such as predicate argument structure, may not be subject to the monotonicity constraint. The first constraint is an example of a bounded memory requirement. It has generally been assumed that at some level of abstraction the syntactic parser has a bounded memory (Chomsky, 1959). Church (Church, 1980) showed that this constraint applies at a level which takes into consideration performance constraints, such as restrictions on the depth of center embedding and on the availability of phrases for posthead modification. The particular form of the bounded memory constraint ....

Chomsky, N. (1959). On certain formal properties of grammars. Information and Control, 2:137-- 167.

....on language, it would be fair to say, I think, that principles based on evidence derived from informant judgment have proved to be deeper and more revealing than those based on evidence derived from experiments on processing and the like, although the future may be different in this regard. (Chomsky, 1980: p. 200) CHAPTER 2. GRAMMARS AND LANGUAGE PROCESSING 18 In this light, the strong C PD provides its proponents with a protective belt that surrounds their grammatical theories and makes them empirically impenetrable to psycholinguistic counter evidence. 2.2.1 The Chomskyan Competence Paradox ....

....since individuals with poorly adapted genotypes tend not to live to tell the tale) The exaptationists seek to abolish the term learning altogether, suggesting that we would gain in clarity if the scientific use of the term were simply discontinued (Piattelli Palmarini, 1989: p. 2; see also Chomsky, 1980, for a similar view) Given that learning generally plays a fundamental role in most connectionist theories, and in the work presented in the previous chapters in particular, such eschewal of the concept of (non trivial) learning CHAPTER 5. THE EVOLUTION AND ACQUISITION OF LANGUAGE 118 within ....

[Article contains additional citation context not shown here]

Chomsky, N. (1959a) On certain Formal Properties of Grammars. Information and Control, 2, 137--167.

No context found.

N. Chomsky, On certain formal properties of grammars, Inform. Cont. 2 (1959) 137.

No context found.

N. Chomsky, On certain formal properties of grammar, Inform. Control 2 (1959) 393--395.

No context found.

N. Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137--167, 1959.

No context found.

N. Chomsky, On certain formal properties of grammars, Information and Control 2 (3) (1959), 137-167.

No context found.

Noam Chomsky. On certain formal properties of grammar. Information and Control, 2:137--167, 1959. 129

No context found.

Noam Chomsky. On Certain Formal Properties of Grammars. Information and Control, 2, 1959.

No context found.

:393-395. Noam Chomsky. 1959b. On certain formal properties of grammars. Information and Control,

No context found.

Chomsky, D. (1959). On certain formal properties of grammars. Information and Control 2, 137--76.

No context found.

Chomsky, Noam. 1965. On certain formal properties of grammars. In R.D. Luce, R.R.Bush, and E.Galenter, eds., Readings in mathematical psychology, Vol. II, 323-418. New York: John Wiley and Sons.

No context found.

Chomsky, N., "On certain formal properties of grammars," Information and Control 2 (1959), 137-167.

No context found.

Cognition, 33, 63--109. Chomsky, N. (1959). On certain formal properties of grammar. Information and Control , 2, 137--167.

No context found.

Chomsky, D. (1959). On certain formal properties of grammars. Information and Control 2, 137--76.

No context found.

Chomsky , N., On Certain Formal Properties of Grammars, Information and Control, Vol. 2 No. 2, 1959, pp137-167.

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