Computational Models of Language Universals: Expressiveness, Learnability, and Consequences

Language Universals

Volumn , Issue , 2009, Pages

  Stabler, Edward P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compositionality; Formal language learning theory; Language complexity; Learnable syntactic patterns; Linguistic universals; Vapnik Chervonenkis dimension

Indexed keywords

EID: 84922269038     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780195305432.003.0010     Document Type: Chapter

References (101)

1. Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997). Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the Association for Computing Machinery, 44(4), 615-631.
2. Alpaydin, E. (2004). Introduction to machine learning. Cambridge, MA: MIT Press.
3. Angluin, D. (1980). Inductive inference of formal languages from positive data. Information and Control, 45, 117-135.
4. Angluin, D. (1982). Inference of reversible languages. Journal of the Association for Computing Machinery, 29, 741-765.
5. Anthony, M., & Biggs, N. (1992). Computational learning theory. New York: Cambridge University Press.
6. Augustine. 398. Confessions. Reprinted with commentary by J. J. O'Donnell. New York: Oxford University Press, (1992).
7. Bernardi, R. (2002). Reasoning with polarity in categorial type logic. Utrecht: Ph.D. thesis, University of Utrecht.
8. Berwick, R. C. (1981). Computational complexity of lexical functional grammar. Proceedings of the 19th Annual Meeting of the Association for Computational Linguistics, ACL'81, 7-12.
9. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36, 929-965.
10. Bobaljik, J. D. 2002. Syncretism without paradigms: Remarks on Williams 1981, 1994. In G. Booij & J. van Marle (Eds.), Yearbook of morphology 2001 (pp. 53-85). Dordrecht: Kluwer.
11. Bowerman, M. (1988). The "no negative evidence" problem: How do children avoid constructing an overly general grammar? In J. A. Hawkins (Ed.), Explaining language universals. Oxford: Blackwell.
12. Braine, M. (1971). On two types of models of the internalization of grammars. In D. I. Slobin (Ed.), The ontogenesis of grammar: A theoretical symposium. New York: Academic Press.
13. Brent, M. R. (1999). An efficient, probabilistically sound algorithm for segmentation and word discovery. Machine Learning, 34, 71-105.
14. Chomsky, N. (1956). Three models for the description of language. IRE Transactions on Information Theory, IT-2, 113-124.
15. Chomsky, N. (1981). Lectures on government and binding. Dordrecht: Foris.
16. Cinque, G. (1999). Adverbs and functional heads: A cross-linguistic perspective. Oxford: Oxford University Press.
17. Cinque, G. (2001). The status of "mobile" suffixes. In W. Bisang, (Ed.), Aspects of typology and universals (pp. 13-19). Berlin: Akademie Verlag.
18. Di Sciullo, A. M., & Williams, E. (1987). On the definition of word. Cambridge, MA: MIT Press.
19. Duda, R. O., Hart, P. E., & Stork, D. G. (2001). Pattern classification. New York: Wiley.
20. Dummett, M. (1981). Frege: Philosophy of language (2nd ed.). London: Duckworth.
21. Dummett, M. (1991). The logical basis of metaphysics (p. 23). London: Duckworth.
22. Fodor, J. A. (1966). How to learn to talk: Some simple ways. In F. Smith & G. A. Miller (Ed.), The genesis of language: A psycholinguistic approach (pp. 105-122). Cambridge, MA: MIT Press.
23. Frege, G. (1884). Die grundlagen der arithmetik. Koebner, Breslau. J. L. Austin's translation available as The foundations of arithmetic. Evanston, IL: Northwestern University Press, (1980).
24. Freund, Y., Kearns, M., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1997). Efficient learning of typical finite automata from random walks. Information and Computation, 138, 23-48.
25. Gärtner, H-M., & Michaelis, J. (2005). A note on the complexity of constraint interaction. In Logical Aspects of Computational Linguistics, LACL'05, Lecture Notes in Artificial Intelligence LNCS-3492 (pp. 114-130). New York: Springer.
26. Gibbs, R. W. (1991). Semantic analyzability in children's understanding of idioms. Journal of Speech and Hearing Research, 35, 613-620.
27. Gibbs, R. W. (1994). The poetics of mind. New York: Cambridge University Press.
28. Gold, E. M. (1967). Language identification in the limit. Information and Control, 10, 447-474.
29. Goldsmith, J. (2006). An algorithm for the unsupervised learning of morphology. Natural Language Engineering, 12(4), 353-371.
30. Greenberg, J. (1963). Universals of language: Report of a conference held at Dobbs Ferry, New York, April 13-15, 1961. Cambridge, MA: MIT Press.
31. Greenberg, J. (1966). Some universals of language with particular attention to the order of meaningful elements. In J. Greenberg (Ed.), Universals of human language. Cambridge, MA: MIT Press.
32. Grimshaw, J. 1981. Form, function and the language-acquisition device. In C. L. Baker & J. J. McCarthy (Eds.), The logical problem of language acquisition. Cambridge, MA: MIT Press.
33. Harkema, H. 2001. A characterization of minimalist languages. In P. de Groote, G. Morrill, & C. Retor'e (Eds.), Logical aspects of computational linguistics, Lecture Notes in Artificial Intelligence, No. 2099 (pp. 193-211). New York: Springer.
34. Harris, Z. S. (1957). Cooccurrence and transformations in linguistic structure. Language, 33, 283-340. Reprinted in H. Hiz (Ed.), Papers on syntax. Reidel: Boston, 1981.
35. Hastie, T., Tibshirani, R., & Friedman, J. H. (2001). The elements of statistical learning: Data mining, inference, and prediction. Springer Series in Statistics. New York: Springer.
36. Hawkins, J. A. (2005). Efficiency and complexity in grammars. New York: Oxford University Press.
37. Heinz, J. (2006). Learning quantity insensitive stress systems via local inference. In Proceedings of the Eighth Meeting of the ACL Special Interest Group in Computational Phonology at HLT-NAACL (pp. 21-30). New York: The Association for Computational Linguistics.
38. Hirsh-Pasek, K., & Golinkoff, R. M. (1996). The origins of grammar: Evidence from early language comprehension. Cambridge, MA: MIT Press.
39. Hodges, W. (2001). Formal features of compositionality. Journal of Logic, Language and Information, 10, 7-28.
40. Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2000). Introduction to automata theory, languages and computation (2nd ed.). Addison-Wesley, Reading, Massachusetts.
41. Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages and computation. Addison-Wesley, Reading, Massachusetts.
42. Jackendoff, R. S. (1997). The architecture of the language faculty. Cambridge, MA: MIT Press.
43. Jain, S., Osherson, D., Royer, J. S., & Sharma, A. (1999). Systems that learn: An introduction to learning theory (2nd ed.). Cambridge, MA: MIT Press.
44. Jakobson, R. (1963). Implications of language universals for linguistics. In J. Greenberg (Ed.), Universals of language: Report of a conference held at Dobbs Ferry, New York, April 13-15 (1961). Cambridge, MA: MIT Press..
45. Johnson, M. (1988). Attribute Value Logic and The Theory of Grammar. Number 16 in CSLI Lecture Notes Series. Chicago: CSLI Publications.
46. Joshi, A. 1985. How much context-sensitivity is necessary for characterizing structural descriptions. In D. Dowty, L. Karttunen, & A. Zwicky (Eds.), Natural language processing: Theoretical, computational and psychological perspectives (pp. 206-250). New York: Cambridge University Press.
47. Joshi, A. K., Vijay-Shanker, K., & Weir, D. 1991. The convergence of mildly context sensitive grammar formalisms. In P. Sells, S. Shieber, & T. Wasow (Eds.), Foundational issues in natural language processing (pp. 31-81). Cambridge, MA: MIT Press.
48. Kanazawa, M. (1996). Identification in the limit of categorical grammars. Journal of Logic, Language, and Information, 5, 115-155.
49. Kanazawa, M. (1998). Learnable classes of categorial grammars. Stanford, CA: CSLI Publications.
50. Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press.
51. Keenan, E. L., & Stabler, E. P. (2003). Bare grammar. Stanford, CA: CSLI Publications.
52. Klein, F. (1893). A comparative review of recent researches in geometry: Programme on entering the philosophical faculty and the senate of the university of Erlangen in 1872. Bulletin of the New York Mathematical Society, 2, 215-249. Translation by M. W. Haskell of the original October 1872 publication, with a prefatory note by the author.
53. Kobele, G. M. (2005). Features moving madly: A note on the complexity of an extension to MGs. Research on Language and Computation, 3(4), 391-410.
54. Kobele, G. M. (2006). Generating copies: An investigation into structural identity in language and grammar. Ph.D. thesis, University of California, Los Angeles.
55. Kobele, G. M., & Michaelis, J. (2005). Two type 0 variants of minimalist grammars. In J. Rogers (Ed.), Proceedings of the 10th Conference on Formal Grammar and the 9th Meeting on Mathematics of Language, FGMOL05. The European Summer School in Logic, Language and Information.
56. Kracht, M. (1998). Strict compositionality and literal movement grammars. In Proceedings, Logical Aspects of Computational Linguistics, LACL'98 (pp. 126-142). New York: Springer.
57. Levin, B., & Hovav, M. R. (1995). Unaccusativity: At the syntax-lexical semantics interface. Cambridge, MA: MIT Press.
58. Lewis, H. R., & Papadimitriou, C. H. (1981). Elements of the theory of computation. Englewood Cliffs, NJ: Prentice-Hall.
59. Lidz, J., Gleitman, H., & Gleitman, L. R. 2004. Kidz in the 'hood: Syntactic bootstrapping and the mental lexicon. In D. G. Hall & S. R. Waxman (Eds.), Weaving a lexicon (pp. 603-636). Cambridge, MA: MIT Press.
60. McGinnis, M. (2002). On the systematic aspect of idioms. Linguistic Inquiry, 33(4), 665-672.
61. Mendelson, S. 2004. Geometric parameters in learning theory. In V. D. Milman & G. Schechtman (Eds.), Geometric aspects of functional analysis, Lecture notes in mathematics. Berlin: Springer..
62. Michaelis, J. (1998). Derivational minimalism is mildly context-sensitive. In Proceedings, Logical Aspects of Computational Linguistics, LACL'98, New York: Springer..
63. Michaelis, J. 2001. Transforming linear context free rewriting systems into minimalist grammars. In P. de Groote, G. Morrill, & C. Retor'e (Eds.), Logical aspects of computational linguistics, lecture notes in Artificial Intelligence (Vol. 2099, pp. 228-244), New York: Springer.
64. Michaelis, J., & Kracht, M. (1997). Semilinearity as a syntactic invariant. In C. Retoré (Ed.), Logical aspects of computational linguistics (pp. 37-40). New York: Springer-Verlag. (Lecture Notes in Computer Science [1328].)
65. Mukherjee, S., Niyogi, P., Poggio, T., & Rifkin, R. (2004). Learning theory: Stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Advances in Computational Mathematics, 25(1-3), 161-193.
66. Niyogi, P. (2006). The computational nature of language learning and evolution. Cambridge, MA: MIT Press.
67. Nunberg, G., Wasow, T., & Sag, I. A. (1994). Idioms. Language, 70(3), 491-538.
68. Osherson, D., Weinstein, S., & Stob, M. (1984). Learning theory and natural language. Cognition, 17, 1-28.
69. Osherson, D., Weinstein, S., & Stob, M. 1986. An analysis of a l earning paradigm. In W. Demopoulos & A., Marras (Eds.), Language learning and concept acquisition (pp. 103-116.). Norwood, NJ: Ablex.
70. Pagin, P. (1998). Bivalence: Meaning theory vs. metaphysics. Theoria; a Swedish Journal of Philosophy and Psychology, 64, 157-186.
71. Pertsova, K. (2006). Lexical meanings of morphemes. 80th Annual Meeting of the LSA, Albuquerque, New Mexico.
72. Peters, P. S., & Ritchie, R. W. (1973). On the generative power of transformational grammar. Information Sciences, 6, 49-83.
73. Pinker, S. (1982). A theory of the acquisition of lexical interpretive grammars. In J. Bresnan, (Ed.), The mental representation of grammatical relations. Cambridge, MA: MIT Press.
74. Pinker, S. (1984). Language learnability and language development. Cambridge, MA: Harvard University Press.
75. Pitt, L. (1989). Inductive inference, DFAs, and computational complexity. In K. P. Jantke (Ed.), Workshop on analogical and inductive inference, Volume 397 of Lecture Notes in Artificial Intelligence (pp. 18-44). Berlin: Springer Verlag.
76. Poggio, T., Rifkin, R., Niyogi, P., & Mukherjee, S. (2004). General conditions for predictivity in learning theory. Nature, 428, 419-422.
77. Prawitz, D. (1971). Ideas and results in proof theory. In Fenstad, J. E. (Ed.), Proceedings of the Second Scandinavian Logic Symposium. North-Holland, Amsterdam, pages 235-307. Partially reprinted as "Gentzen's analysis of first order proofs," In R. I. G. Hughes, A philosophical companion to first order logic. Hackett: Indianapolis, (1993).
78. Prawitz, D. (1998). Comment on Peter Pagin's paper. Theoria; a Swedish Journal of Philosophy and Psychology, 64, 304-318.
79. Prawitz, D. (2005). Meaning approached via proofs. Synthese, 148(3), 507-524.
80. Pullum, G. K. (2006). On syntactically mandated phrase reduplication. Cambridge, MA: Unpublished handout, Linguistics Colloquium, Massachusetts Institute of Technology.
81. Rozenberg, G., & Salomaa, A. (Ed.). (1997). Handbook of formal languages, volume 2: Linear modeling: Background and application. New York: Springer.
82. Seki, H., Matsumura, T., Fujii, M., & Kasami, T. (1991). On multiple context-free grammars. Theoretical Computer Science, 88, 191-229.
83. Snedeker, J., & Gleitman, L. R. 2004. Why it is hard to label our concepts. In D. G. Hall & S. R. Waxman (Eds.), Weaving a lexicon (pp. 257-293). Cambridge, MA: MIT Press.
84. Stabler, E. P. (1997). Derivational minimalism. In C. Retoré (Ed.), Logical aspects of computational linguistics (pp. 68-95). New York: Springer-Verlag. (Lecture Notes in Computer Science [1328].)
85. Stabler, E. P. (2004). Varieties of crossing dependencies: Structure dependence and mild context sensitivity. Cognitive Science, 93(5), 699-720.
86. Szabolcsi, A. (1996a). Strategies for scope-taking. In A. Szabolcsi (Ed.), Ways of scope taking. Boston: Kluwer.
87. Szabolcsi, A. (Ed.). (1996b). Ways of scope taking. Kluwer, Boston.
88. Szabolcsi, A. (2004). Positive polarity-negative polarity. Natural Language and Linguistic Theory, 22(2), 409-452.
89. Szabolcsi, A., & Brody, M. (2003). Overt scope in Hungarian. Syntax, 6, 19-51.
90. Tarski, A. (1986). What are logical notions? History and Philosophy of Logic, 7, 143-154.
91. Torenvliet, L., & Trautwein, M. (1995). A note on the complexity of restricted attributevalue grammars. In M. Moll & A. Nijholt (Ed.), Proceedings of Computational Linguistics in the Netherlands, CLIN5 (ISBN 90-75296-03-7 pp. 145-164). Twente, The Netherlands: Department of Computer Science, University of Twente.
92. Trautwein, M. (1995). The complexity of structure-sharing in unification-based grammars. In Proceedings of Computational Linguistics in the Netherlands, CLIN5 (pp. 165-180).
93. Valiant, L. (1984). A theory of the learnable. Communications of the Association for Computing Machinery, 27(11), 1134-1142.
94. van Benthem, J. (1986). Essays in logical semantics. Dordrecht: Reidel.
95. Vapnik, V. N., & Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16, 264-280.
96. Vijay-Shanker, K., & Weir, D. (1994). The equivalence of four extensions of context free grammar formalisms. Mathematical Systems Theory, 27, 511-545.
97. Westerståhl, D. (2004). On the compositional extension problem. Journal of Philosophical Logic, 33(6), 549-582.
98. Wexler, K., & Culicover, P. W. (1980). Formal principles of language acquisition. Cambridge, MA: MIT Press.
99. Williams, E. (1994). Remarks on lexical knowledge. Lingua, 92, 7-34. Reprinted in L. Gleitman & B. Landau (Eds.), The acquisition of the lexicon, MIT Press, (1994)..
100. Wittgenstein, L. (1958). Philosophical investigations. New York: MacMillan. This edition published in 1970.
101. Yokomori, T. (2003). Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science, 298, 179-206.