{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:20Z","timestamp":1725664580272},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609254"},{"type":"electronic","value":"9783540497387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60925-3_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:05:51Z","timestamp":1330290351000},"page":"33-47","source":"Crossref","is-referenced-by-count":6,"title":["Natural language grammatical inference: A comparison of recurrent neural networks and machine learning methods"],"prefix":"10.1007","author":[{"given":"Steve","family":"Lawrence","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandiway","family":"Fong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Lee","family":"Giles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","unstructured":"Allen, R. B. (1983). Sequential connectionist networks for answering simple questions about a microworld. In 5th Annual Proceedings of the Cognitive Science Society, pages 489\u2013495."},{"issue":"3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1162\/neco.1991.3.3.375","volume":"3","author":"A. Back","year":"1991","unstructured":"Back, A. and Tsoi, A. (1991). FIR and IIR synapses, a new neural network architecture for time series modeling. Neural Computation, 3(3):375\u2013385.","journal-title":"Neural Computation"},{"key":"3_CR3","unstructured":"Berg, G. (1992). A connectionist parser with recursive sentence structure and lexical disambiguation. In Proceedings AAAI, pages 32\u201337."},{"key":"3_CR4","unstructured":"Chomsky, N. (1981). Lectures on Government and Binding. Foris Publications."},{"key":"3_CR5","unstructured":"Chomsky, N. (1986). Knowledge of Language: Its Nature, Origin, and Use. Prager."},{"key":"3_CR6","volume-title":"Technical Report CS94-398","author":"D. Clouse","year":"1994","unstructured":"Clouse, D., Giles, C., Horne, B., and Cottrell, G. (1994). Learning large DeBruijn automata with feed-forward neural networks. Technical Report CS94-398, Computer Science and Engineering, University of California at San Diego, La Jolla, CA."},{"key":"3_CR7","volume-title":"Complexity, Entropy and the Physics of Information","author":"J. P. Crutchfield","year":"1989","unstructured":"Crutchfield, J. P. and Young, K. (1989). Computation at the onset of chaos. In Zurek, W., editor, Complexity, Entropy and the Physics of Information. Addison-Wesley, Reading, MA."},{"key":"3_CR8","unstructured":"Darken, C. and Moody, J. (1991). Note on learning rate schedules for stochastic optimization. In Neural Information Processing Systems 3, pages 832\u2013838. Morgan Kaufmann."},{"key":"3_CR9","first-page":"791","volume-title":"Proceedings of The Fourteenth Annual Conference of the Cognitive Science Society","author":"S. Das","year":"1992","unstructured":"Das, S., Giles, C., and Sun, G. (1992). Learning context-free grammars: Limitations of a recurrent neural network with an external stack memory. In Proceedings of The Fourteenth Annual Conference of the Cognitive Science Society, pages 791\u2013795, San Mateo, CA. Morgan Kaufmann Publishers."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","volume":"14","author":"J. Elman","year":"1990","unstructured":"Elman, J. (1990). Finding structure in time. Cognitive Science, 14:179\u2013211.","journal-title":"Cognitive Science"},{"issue":"2\/3","key":"3_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1022699029236","volume":"7","author":"J. Elman","year":"1991","unstructured":"Elman, J. (1991). Distributed representations, simple recurrent networks, and grammatical structure. Machine Learning, 7(2\/3):195\u2013226.","journal-title":"Machine Learning"},{"key":"3_CR12","unstructured":"Elman, J. L. (1984). Structured representations and connectionist models. In 6th Annual Proceedings of the Cognitive Science Society, pages 17\u201325."},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1162\/neco.1992.4.1.120","volume":"4","author":"P. Frasconi","year":"1992","unstructured":"Frasconi, P., Gori, M., and Soda, G. (1992). Local feedback multilayered networks. Neural Computation, 4(1):120\u2013130.","journal-title":"Neural Computation"},{"key":"3_CR14","unstructured":"Gasser, M. and Lee, C. (1990). Networks that learn phonology. Technical report, Computer Science Department, Indiana University."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Giles, C., Horne, B., and Lin, T. (1995). Learning a class of large finite state machines with a recurrent neural network. Neural Networks. In press.","DOI":"10.1016\/0893-6080(95)00041-0"},{"issue":"3","key":"3_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","volume":"4","author":"C. Giles","year":"1992","unstructured":"Giles, C., Miller, C., Chen, D., Chen, H., Sun, G., and Lee, Y. (1992). Learning and extracting finite state automata with second-order recurrent neural networks. Neural Computation, 4(3):393\u2013405.","journal-title":"Neural Computation"},{"key":"3_CR17","volume-title":"Technical Report CRL Tech report 9004","author":"M. Hare","year":"1990","unstructured":"Hare, M. (1990). The role of similarity in hungarian vowel harmony: A connectionist account. Technical Report CRL Tech report 9004, Centre for Research in Language, University of California, San Diego."},{"key":"3_CR18","volume-title":"Technical Report CRL Newsletter Volume 3 Number 2","author":"M. Hare","year":"1989","unstructured":"Hare, M., Corina, D., and Cottrell, G. (1989). Connectionist perspective on prosodic structure. Technical Report CRL Newsletter Volume 3 Number 2, Centre for Research in Language, University of California, San Diego."},{"key":"3_CR19","unstructured":"Harris, C. L. and Elman, J. L. (1984). Representing variable information with simple recurrent networks. In 6th Annual Proceedings of the Cognitive Science Society, pages 635\u2013642."},{"key":"3_CR20","volume-title":"Neural Networks, A Comprehensive Foundation","author":"S. Haykin","year":"1994","unstructured":"Haykin, S. (1994). Neural Networks, A Comprehensive Foundation. Macmillan, New York, NY."},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0004-3702(90)90003-I","volume":"46","author":"M. F. S. S. John","year":"1990","unstructured":"John, M. F. S. and McLelland, J. L. (1990). Learning and applying contextual constraints in sentence comprehension. Artificial Intelligence, 46:5\u201346.","journal-title":"Artificial Intelligence"},{"key":"3_CR22","volume-title":"Natural Language Parsing","author":"A. K. Joshi","year":"1985","unstructured":"Joshi, A. K. (1985). Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In D. R. Dowty, L. K. and Zwicky, A. M., editors, Natural Language Parsing. Cambridge University Press, Cambridge."},{"key":"3_CR23","volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","author":"J. B. Kruskal","year":"1983","unstructured":"Kruskal, J. B. (1983). An overview of sequence comparison. In Sankoff, D. and Kruskal, J. B., editors, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, Massachusetts."},{"key":"3_CR24","volume-title":"Information Theory and Statistics","author":"S. Kullback","year":"1959","unstructured":"Kullback, S. (1959). Information Theory and Statistics. Wiley, New York."},{"key":"3_CR25","volume-title":"A Course in GB Syntax: Lectures on Binding and Empty Categories","author":"H. Lasnik","year":"1988","unstructured":"Lasnik, H. and Uriagereka, J. (1988). A Course in GB Syntax: Lectures on Binding and Empty Categories. MIT Press, Cambridge, MA."},{"key":"3_CR26","volume-title":"Technical Report UMIACS-TR-95-64 and CS-TR-3479","author":"S. Lawrence","year":"1995","unstructured":"Lawrence, S., Giles, C. L., and Fong, S. (1995). On the applicability of neural network and machine learning methodologies to natural language processing. Technical Report UMIACS-TR-95-64 and CS-TR-3479, Institute for Advanced Computer Studies, University of Maryland, College Park MD 20742."},{"key":"3_CR27","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0749-596X(89)90033-8","volume":"28","author":"B. MacWhinney","year":"1989","unstructured":"MacWhinney, B., Leinbach, J., Taraban, R., and McDonald, J. (1989). Language learning: cues or rules? Journal of Memory and Language, 28:255\u2013277.","journal-title":"Journal of Memory and Language"},{"key":"3_CR28","first-page":"188","volume-title":"Proceedings of the 1988 Connectionist Models Summer School","author":"R. Miikkulainen","year":"1989","unstructured":"Miikkulainen, R. and Dyer, M. (1989). Encoding input\/output representations in connectionist cognitive systems. In Touretzky, D. S., Hinton, G. E., and Sejnowski, T. J., editors, Proceedings of the 1988 Connectionist Models Summer School, pages 188\u2013195, Los Altos, CA. Morgan Kaufmann."},{"key":"3_CR29","unstructured":"Pereira, F. (1992). Inside-outside reestimation from partially bracketed corpora. In Association for Computational Linguistics, ACL 92."},{"key":"3_CR30","unstructured":"Pesetsky, D. M. (1982). Paths and Categories. PhD thesis, MIT."},{"key":"3_CR31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"J. Pollack","year":"1990","unstructured":"Pollack, J. (1990). Recursive distributed representations. Artificial Intelligence, 46:77\u2013105.","journal-title":"Artificial Intelligence"},{"key":"3_CR32","first-page":"227","volume":"7","author":"J. Pollack","year":"1991","unstructured":"Pollack, J. (1991). The induction of dynamical recognizers. Machine Learning, 7:227\u2013252.","journal-title":"Machine Learning"},{"key":"3_CR33","volume-title":"PhD thesis","author":"C. Pollard","year":"1984","unstructured":"Pollard, C. (1984). Generalised context-free grammars, head grammars and natural language. PhD thesis, Department of Linguistics, Stanford University, Palo Alto, CA."},{"key":"3_CR34","volume-title":"C4.5: Programs for Machine Learning","author":"R. Quinlan","year":"1993","unstructured":"Quinlan, R. (1993). C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California."},{"issue":"1","key":"3_CR35","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jcss.1995.1013","volume":"50","author":"H. Siegelmann","year":"1995","unstructured":"Siegelmann, H. and Sontag, E. (1995). On the computational power of neural nets. Journal of Computer and System Sciences, 50(1):132\u2013150.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR36","unstructured":"Sperduti, A., Starita, A., and Goller, C. (1995). Learning distributed representations for the classification of terms. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 509\u2013515."},{"key":"3_CR37","volume-title":"Technical Report TR-90-015","author":"A. Stolcke","year":"1990","unstructured":"Stolcke, A. (1990). Learning feature-based semantics with simple recurrent networks. Technical Report TR-90-015, International Computer Science Institute, Berkeley, California."},{"key":"3_CR38","volume-title":"Technical Report UMIACS-TR-93-77","author":"G. Sun","year":"1993","unstructured":"Sun, G., Giles, C., Chen, H., and Lee, Y. (1993). The neural network push-down automaton: Model, stack and learning simulations. Technical Report UMIACS-TR-93-77, Institute for Advanced Computer Studies, University of Maryland, College Park, MD."},{"key":"3_CR39","volume-title":"Technical Report CMU-CS-89-158","author":"D. S. Touretzky","year":"1989","unstructured":"Touretzky, D. S. (1989a). Rules and maps in connectionist symbol processing. Technical Report CMU-CS-89-158, Carnegie Mellon University: Department of Computer Science, Pittsburgh, PA."},{"key":"3_CR40","unstructured":"Touretzky, D. S. (1989b). Towards a connectionist phonology: The\u2019 many maps\u2019 approach to sequence manipulation. In Proceedings of the 11th Annual Conference of the Cognitive Science Society, pages 188\u2013195."},{"issue":"3","key":"3_CR41","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1162\/neco.1992.4.3.406","volume":"4","author":"R. Watrous","year":"1992","unstructured":"Watrous, R. and Kuhn, G. (1992). Induction of finite-state languages using second-order recurrent networks. Neural Computation, 4(3):406.","journal-title":"Neural Computation"},{"issue":"2","key":"3_CR42","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1162\/neco.1989.1.2.270","volume":"1","author":"R. Williams","year":"1989","unstructured":"Williams, R. and Zipser, D. (1989). A learning algorithm for continually running fully recurrent neural networks. Neural Computation, 1(2):270\u2013280.","journal-title":"Neural Computation"},{"key":"3_CR43","volume-title":"Backpropagation: Theory, Architectures, and Applications","author":"R. Williams","year":"1990","unstructured":"Williams, R. and Zipser, D. (1990). Gradient-based learning algorithms for recurrent connectionist networks. In Chauvin, Y. and Rumelhart, D., editors, Backpropagation: Theory, Architectures, and Applications. Erlbaum, Hillsdale, NJ."},{"issue":"2","key":"3_CR44","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/72.279194","volume":"5","author":"Z. Zeng","year":"1994","unstructured":"Zeng, Z., Goodman, R., and Smyth, P. (1994). Discrete recurrent neural networks for grammatical inference. IEEE Transactions on Neural Networks, 5(2):320\u2013330.","journal-title":"IEEE Transactions on Neural Networks"}],"container-title":["Lecture Notes in Computer Science","Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60925-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:17Z","timestamp":1619573297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60925-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609254","9783540497387"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-60925-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}