scispace - formally typeset
Search or ask a question
Topic

Chomsky hierarchy

About: Chomsky hierarchy is a research topic. Over the lifetime, 601 publications have been published within this topic receiving 31067 citations. The topic is also known as: Chomsky–Schützenberger hierarchy.


Papers
More filters
Book
01 Jan 1989
TL;DR: In this paper, the problem of semantics after Chomsky, Norbert Hornstein logical form and linguistic theory, Jaako Hintikka types and tokens in linguistics, Sylvian Bromberger how not to become so confused about linguistics and Alexander George when is a grammar psychologically real.
Abstract: Why should the mind be modular?, Jerry A. Fodor meaning and the mental - the problem of semantics after Chomsky, Norbert Hornstein logical form and linguistic theory, Jaako Hintikka types and tokens in linguistics, Sylvian Bromberger how not to become so confused about linguistics, Alexander George when is a grammar psychologically real?, Christopher Peacocke tacit knowledge and subdoxastic states, Martin Davies knowledge of reference, James Higginbotham wherein is language social?, Tyler Burge language and communication, Michael Dummett model theory and the "Factuality of Semantics", Hilary Putnam Wittgenstein's rule-following considerations and the central project of theoretical linguistics, Crispin Wright.

75 citations

Book
08 Nov 2012
TL;DR: This book discusses the history, purposes and limitations of formal languages, and how to do reason, and the need for counterbalance in science.
Abstract: Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more generally elsewhere) actually has. In this book, Catarina Dutilh Novaes adopts a much wider conception of formal languages so as to investigate more broadly what exactly is going on when theorists put these tools to use. She looks at the history and philosophy of formal languages and focuses on the cognitive impact of formal languages on human reasoning, drawing on their historical development, psychology, cognitive science and philosophy. Her wide-ranging study will be valuable for both students and researchers in philosophy, logic, psychology and cognitive and computer science.

73 citations

Journal ArticleDOI
01 Dec 1973
TL;DR: A new family of languages is introduced which originated from a study of some mathematical models for the development of biological organisms and it is proved that it forms a full abstractfamily of languages.
Abstract: This paper introduces a new family of languages which originated from a study of some mathematical models for the development of biological organisms. Various properties of this family are established and in particular it is proved that it forms a full abstract family of languages. It is compared with some other families of languages which have already been studied and which either originated from the study of models for biological development or belong to the now standard Chomsky hierarchy. A characterization theorem for context-free languages is also established.

73 citations

Book ChapterDOI
Hermann Ney1
01 Jan 1992
TL;DR: A unifying framework of syntactic and statistical pattern recognition for one-dimensional observations and signals like speech is presented and it will be shown how these techniques can be applied to the task of continuous speech recognition.
Abstract: This paper presents a unifying framework of syntactic and statistical pattern recognition for one-dimensional observations and signals like speech. The syntactic constraints will be based upon stochastic extensions of the grammars in the Chomsky hierarchy. These extended stochastic grammars can be applied to both discrete and continuous observations. Neglecting the mathematical details and complications, we can convert a grammar of the Chomsky hierarchy to a stochastic grammar by attaching probabilities to the grammar rules and, for continuous observations, attaching probability density functions to the terminals of the grammar. In such a framework, a consistent integration of syntactic pattern recognition and statistical pattern recognition, which is typically based upon Bayes’ decision rule for minimum error rate, can be achieved such that no error correction or postprocessing after the recognition phase is required. Efficient algorithms and closed-form solutions for the parsing and recognition problem will be presented for the following types of stochastic grammars: regular, linear and context-free. It will be shown how these techniques can be applied to the task of continuous speech recognition.

73 citations

Journal ArticleDOI
TL;DR: This paper applies the method to obtain simple demonstrations of Faa di Bruno's formula, and some identities concerning Bell polynomials, Stirling numbers and symmetric functions, and sees that Cayley's formula on labeled trees is equivalent to the Lagrange inversion formula.

72 citations


Network Information
Related Topics (5)
Rule-based machine translation
8.8K papers, 240.5K citations
72% related
Syntax
16.7K papers, 518.6K citations
71% related
Time complexity
36K papers, 879.5K citations
71% related
Type (model theory)
38.9K papers, 670.5K citations
70% related
Semantics
24.9K papers, 653K citations
70% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
20223
20219
20208
201912
201810