{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:46:36Z","timestamp":1725475596765},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673057"},{"type":"electronic","value":"9783540464174"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719871_21","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T13:29:09Z","timestamp":1167398949000},"page":"298-312","source":"Crossref","is-referenced-by-count":1,"title":["Holistic Symbol Processing and the Sequential RAAM: An Evaluation"],"prefix":"10.1007","author":[{"given":"James A.","family":"Hammerton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry L.","family":"Kalman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Balogh, I.L.: An analysis of a connectionist internal representation: Do RAAM networks produce truly distributed representations? PhD thesis, New Mexico State University (1994)"},{"key":"21_CR2","first-page":"113","volume-title":"Symbolic and Connectionist Paradigms: Closing the Gap","author":"D.S. Blank","year":"1992","unstructured":"Blank, D.S., Meeden, L.A., Marshall, J.B.: Exploring the symbolic\/subsymbolic continuum: A case study of RAAM. In: Dinsmore, J. (ed.) Symbolic and Connectionist Paradigms: Closing the Gap, pp. 113\u2013148. Lawrence Erlbaum Associates, Hillsdale (1992)"},{"issue":"2","key":"21_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/095400997116667","volume":"9","author":"R.E. Callan","year":"1997","unstructured":"Callan, R.E., Palmer-Brown, D.: (S)RAAM: An analytical technique for fast and reliable derivation of connectionist symbol structure representations. Connection Science\u00a09(2), 139\u2013159 (1997)","journal-title":"Connection Science"},{"issue":"1\u20132","key":"21_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/09540099008915662","volume":"2","author":"D.J. Chalmers","year":"1990","unstructured":"Chalmers, D.J.: Syntactic transformations on distributed representations. Connection Science\u00a02(1\u20132), 53\u201362 (1990); Reprinted in [16], pp. 46\u201355","journal-title":"Connection Science"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1080\/09540099108946592","volume":"3","author":"L. Chrisman","year":"1991","unstructured":"Chrisman, L.: Learning recursive distributed representations for holistic computation. Connection Science\u00a03(4), 345\u2013366 (1991)","journal-title":"Connection Science"},{"key":"21_CR6","first-page":"335","volume-title":"Proceedings of the Sixteenth Annual Conference of the Cognitive Science Society","author":"R.M. French","year":"1994","unstructured":"French, R.M.: Dynamically constraining connectionist networks to produce distributed, orthogonal representations to reduce catastrophic interference. In: Proceedings of the Sixteenth Annual Conference of the Cognitive Science Society, Atlanta, GA, pp. 335\u2013340. Lawrence Erlbaum Associates, Hillsdale (1994)"},{"key":"21_CR7","unstructured":"Hammerton, J.A.: Exploiting Holistic Computation: An evaluation of the Sequential RAAM. PhD thesis, School of Computer Science, The University of Birmingham, UK (1998)"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/095400998116558","volume":"10","author":"J.A. Hammerton","year":"1998","unstructured":"Hammerton, J.A.: Holistic computation: Reconstructing a muddled concept. Connection Science\u00a010(1), 3\u201319 (1998)","journal-title":"Connection Science"},{"key":"21_CR9","first-page":"899","volume-title":"Proceedings of International Conference on Artificial Neural Networks ICANN 1996","author":"E.K.S. Ho","year":"1996","unstructured":"Ho, E.K.S., Chan, L.W.: Confluent preorder parser as a finite state automata. In: Proceedings of International Conference on Artificial Neural Networks ICANN 1996, Bochum, Germany, pp. 899\u2013904. Springer, Berlin (1996)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0925-2312(95)00132-8","volume":"14","author":"B.L. Kalman","year":"1997","unstructured":"Kalman, B.L., Kwasny, S.C.: High performance training of feedforward and simple recurrent networks. Neurocomputing\u00a014, 63\u201383 (1997)","journal-title":"Neurocomputing"},{"issue":"9","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1109\/5.58325","volume":"78","author":"T. Kohonen","year":"1990","unstructured":"Kohonen, T.: The self-organising map. Proceedings of the IEEE\u00a078(9), 1464\u20131480 (1990)","journal-title":"Proceedings of the IEEE"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1080\/09540099508915657","volume":"7","author":"S.C. Kwasny","year":"1995","unstructured":"Kwasny, S.C., Kalman, B.L.: Tail-recursive distributed representations and simple recurrent networks. Connection Science\u00a07(1), 61\u201380 (1995)","journal-title":"Connection Science"},{"key":"21_CR13","first-page":"217","volume-title":"Neural Networks and a New Artificial Intelligence","author":"L. Niklasson","year":"1997","unstructured":"Niklasson, L., Sharkey, N.E.: Systematicity and generalization in compositional connectionist representations. In: Dorffner, G. (ed.) Neural Networks and a New Artificial Intelligence, pp. 217\u2013232. Thomson Computer Press, London (1997)"},{"key":"21_CR14","unstructured":"Plate, T.A.: Distributed Representations and Nested Compositional Structure. PhD thesis, University of Toronto (1994)"},{"issue":"1-2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"J.B. Pollack","year":"1990","unstructured":"Pollack, J.B.: Recursive distributed representations. Artificial Intelligence\u00a046(1-2), 77\u2013105 (1990)","journal-title":"Artificial Intelligence"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Sharkey, N.E. (ed.): Connectionist Natural Language Processing: Readings from Connection Science. Intellect, Oxford (1992)","DOI":"10.1007\/978-94-011-2624-3"},{"key":"21_CR17","unstructured":"Sperduti, A.: Labeling RAAM. Technical Report TR-93-029, International Computer Science Institute, Berkeley, California (1993)"},{"key":"21_CR18","unstructured":"Sperduti, A.: On Some Stability Properties of the LRAAM Model. Technical Report TR-93-031, International Computer Science Institute, Berkeley, California (1993)"},{"key":"21_CR19","first-page":"555","volume-title":"Proceedings of the International Joint Conference on Neural Networks\u2013 IJCNN 1992","author":"V. Weber","year":"1992","unstructured":"Weber, V.: Connectionist unification with a distributed representation. In: Proceedings of the International Joint Conference on Neural Networks\u2013 IJCNN 1992, Beijing, China, pp. 555\u2013560. IEEE, Piscataway (1992)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Neural Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719871_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T01:54:48Z","timestamp":1552874088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719871_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673057","9783540464174"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10719871_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}