Formal language theory: Refining the Chomsky hierarchy

Philosophical Transactions of the Royal Society B: Biological Sciences

Volumn 367, Issue 1598, 2012, Pages 1956-1970

  Jäger, Gerhard ^a   Rogers, James ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b EARLHAM COLLEGE   (United States)

Author keywords

Artificial grammar learning; Complexity; Formal language theory

Indexed keywords

COMPLEXITY; HIERARCHICAL SYSTEM; LANGUAGE;

EID: 84862125613     PISSN: 09628436     EISSN: 14712970     Source Type: Journal    
DOI: 10.1098/rstb.2012.0077     Document Type: Review

References (35)

1. Hopcroft, J. E., Motwani, R. & Ullman, J. D. 2000 Introduction to automata theory, languages and computation. Reading, MA: Addison-Wesley.
2. Sipser, M. 1997 Introduction to the theory of computation. Boston, MA: PWS Publishing.
3. Chomsky, N. 1956 Three models for the description of language. IRE Trans. Inform. Theory 2, 113-124. (doi:10.1109/TIT.1956.1056813)
4. Chomsky, N. 1957 Syntactic structures. The Hague, The Netherlands: Mouton.
5. Huybregts, R. 1984 The weak inadequacy of context-free phrase structure grammars. In Van periferie naar kern (eds. G. J. de Haan, M. Trommelen & W. Zonneveld), ppp. 81-99. Dordrecht, The Netherlands: Foris.
6. Shieber, S. 1985 Evidence against the context-freeness of natural language. Linguist. Phil. 8, 333-343. (doi:10. 1007/BF00630917)
7. Culy, C. 1985 The complexity of the vocabulary of Bambara. Linguist. Philos. 8, 345-351. (doi:10.1007/ BF00630918)
8. Joshi, A. 1985 How much context-sensitivity is necessary for characterizing structural descriptions-tree adjoining grammars. In Natural language processing. Theoretical, computational and psychological perspectives (eds. D. Dowty, L. Karttunen & A. Zwicky). Cambridge, UK: Cambridge University Press.
9. Ades, A. E. & Steedman, M. J. 1982 On the order of words. Linguist. Philos. 4, 517-558. (doi:10.1007/ BF00360804)
10. Steedman, M. 2000 The syntactic process. Cambridge, MA: MIT Press.
11. Joshi, A., Vijay-Shanker, K. & Weir, D. 1991 The convergence of mildly context-sensitive grammar formalisms. In Processing of linguistic structure (eds. P. Sells, S. Shieber & T. Wasow), pp. 31-81. Cambridge, MA: MIT Press.
12. Gazdar, G. 1988 Applicability of indexed grammars to natural languages. Technical Report 85-34, Center for the Study of Language and Information, Stanford, CA.
13. Pollard, C. J. 1984 Generalized phrase structure grammars, head grammars and natural language. PhD thesis, Stanford, CA.
14. Weir, D. J. 1988 Characterizing mildly context-sensitive grammar formalisms. PhD thesis, University of Pennsylvania.
15. Stabler, E. P. 1997 Derivational minimalism. In Logical aspects of computational linguistics (ed. C. Retoré), pp. 68-95. Berlin, Germany: Springer.
16. Chomsky, N. 1995 The minimalist program. Cambridge, MA: MIT Press.
17. Stabler, E. P. 2004 Varieties of crossing dependencies: structure dependence and mild context sensitivity. Cogn. Sci. 28, 699-720. (doi:10.1207/s15516709cog2805_4)
18. Becker, T., Joshi, A. & Rambow, O. 1991 Long-distance scrambling and tree adjoining grammars. In Proc. 5th Conf. of European Chapter of the Association for Computational Linguistics, Berlin, Germany, 9-11 April 1991, pp. 21-26. Association for Computational Linguistics.
19. Michaelis, J. & Kracht, M. 1997 Semilinearity as a syntactic invariant. In Logical aspects of computational linguistics (ed. C. Retoré), pp. 329-345. Berlin, Germany: Springer.
20. Tesnière, L. 1959 Elèments de syntaxe structurale. Paris, France: Klincksiek.
21. Rogers, J. 2003 wMSO theories as grammar formalisms. Theoret. Comput. Sci. 293, 291-320. (doi:10.1016/ S0304-3975(01)00349-8)
22. McNaughton, R. & Papert, S. A. 1971 Counter-free automata. Cambridge, MA: MIT Press.
23. Rogers, J., Heinz, J., Bailey, G., Edlefsen, M., Visscher, M., Wellcome, D. & Wibel, S. 2010 On languages piecewise testable in the strict sense. In The mathematics of language: revised selected papers from the 10th and 11th Biennial Conference on the Mathematics of Language (eds. C. Ebert, G. Jäger & J. Michaelis), Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence, vol. 6149, pp. 255-265. Berlin, Germany: FoLLI/Springer.
24. Rogers, J. & Pullum, G. 2007 Aural pattern recognition experiments and the subregular hierarchy. In Proc. 10th Mathematics of Language Conference (ed. M. Kracht), pp. 1-7. Los Angeles, CA: University of California.
25. Christiansen, M. H. & Chater, N. (ed.) 2001 Connectionist psycholinguistics. New York, NY: Ablex.
26. Saffran, J. R., Aslin, R. N. & Newport, E. L. 1996 Statistial learning by 8-month-old infants. Science 274, 1926-1928. (doi:10.1126/science.274.5294.1926)
27. Saffran, J. R. 2001 The use of predictive dependencies in language learning. J. Mem. Lang. 44, 493-515. (doi:10. 1006/jmla.2000.2759)
28. Manning, C. & Schütze, H. 1999 Foundations of statistical natural language processing. Cambridge, MA: MIT Press.
29. Heinz, J. & Rogers, J. 2010 Estimating strictly piecewise distributions. In Proc. 48th Annual Meeting of the Association for Computational Linguistics, Uppsala, Sweden, 11-16 July 2010, pp. 886-896. Association for Computational Linguistics.
30. Reber, A. S. 1967 Implicit learning of artificial grammars. J. Verb. Learn. Verb. Behav. 6, 855-863. (doi:10. 1016/S0022-5371(67)80149-X)
31. Marcus, G. G., Vijayan, S., Bandi Rao, S. & Vishton, P. M. 1999 Rule learning by seven-month-old infants. Science 283, 77-79. (doi:10.1126/science.283.5398.77)
32. Gomez, R. L. & Gerken, L. 1999 Artificial grammar learning by 1-year-olds leads to specific and abstract knowledge. Cognition 70, 109-135. (doi:10.1016/ S0010-0277(99)00003-7)
33. Minsky, M. L. 1961 Recursive unsolvability of Post's problem of 'tag' and other topics in the theory of Turing machines. Ann. Math. 74, 437-455. (doi:10. 2307/1970290)
34. Pullum, G. K. & Gazdar, G. 1982 Natural languages and context-free languages. Linguist. Phil. 4, 471-504. (doi:10.1007/BF00360802)
35. Pullum, G. K. 1985 On two recent attempts to show that English is not a CFL. Comput. Linguist. 10, 182-186.