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.

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.

First 50 documents

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