{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T18:52:13Z","timestamp":1723575133811},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0020-0255(91)90061-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"135-158","source":"Crossref","is-referenced-by-count":5,"title":["Fault-tolerant database using distributed associative memories"],"prefix":"10.1016","volume":"53","author":[{"given":"Vladimir","family":"Cherkassky","sequence":"first","affiliation":[]},{"given":"Malathi","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Harry","family":"Wechsler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(91)90061-X_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0031-3203(78)90027-4","article-title":"The use of context in pattern recognition","volume":"10","author":"Toussaint","year":"1978","journal-title":"Pattern Recognition"},{"issue":"12","key":"10.1016\/0020-0255(91)90061-X_BIB2","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1145\/359038.359041","article-title":"Computer programs for detecting and correcting spelling errors","volume":"23","author":"Peterson","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(91)90061-X_BIB3","first-page":"434","article-title":"Five spelling-correction programs for cp\/m-based systems","volume":"11","author":"Lemmons","year":"1981","journal-title":"Byte"},{"key":"10.1016\/0020-0255(91)90061-X_BIB4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TPC.1975.6593963","article-title":"Computer detection of typographical errors","volume":"PC-18","author":"Morris","year":"1975","journal-title":"IEEE Trans. Professional Comm."},{"key":"10.1016\/0020-0255(91)90061-X_BIB5","series-title":"Content Addressable Memories","author":"Kohonen","year":"1980"},{"key":"10.1016\/0020-0255(91)90061-X_BIB6","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/321239.321247","article-title":"Can a priori probabilities help in character recognition?","volume":"11","author":"Ehrich","year":"1964","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(91)90061-X_BIB7","first-page":"268","article-title":"The Vitterbi algorithm","volume":"61","author":"Forney","year":"1973"},{"issue":"4","key":"10.1016\/0020-0255(91)90061-X_BIB8","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TPAMI.1983.4767408","article-title":"An integrated algorithm for text recognition: Comparison with a cascaded algorithm","volume":"5","author":"Hull","year":"1983","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/0020-0255(91)90061-X_BIB9","series-title":"Self-Organization and Associative Memories","author":"Kohonen","year":"1984"},{"key":"10.1016\/0020-0255(91)90061-X_BIB10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MASSP.1987.1165576","article-title":"An introduction to computing with neural nets","author":"Lippmann","year":"1987","journal-title":"IEEE ASSP Mag."},{"key":"10.1016\/0020-0255(91)90061-X_BIB11","volume":"Vol. 1, 2","year":"1986"},{"key":"10.1016\/0020-0255(91)90061-X_BIB12","series-title":"Principles of Neurodynamics","author":"Rosenblatt","year":"1962"},{"key":"10.1016\/0020-0255(91)90061-X_BIB13","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/0020-0255(91)90061-X_BIB14","article-title":"NETtalk: A Parallel Network That Learns to Read Aloud","author":"Sejnowski","year":"1986"},{"key":"10.1016\/0020-0255(91)90061-X_BIB15","series-title":"The Connection Machine","author":"Hillis","year":"1985"},{"key":"10.1016\/0020-0255(91)90061-X_BIB16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/MC.1987.1663364","article-title":"Connectionist architecture for artificial intelligence","author":"Fahlman","year":"1987","journal-title":"Computer"},{"issue":"12","key":"10.1016\/0020-0255(91)90061-X_BIB17","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1145\/7902.7906","article-title":"Toward memory-based reasoning","volume":"29","author":"Stanfill","year":"1986","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/0020-0255(91)90061-X_BIB18","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1987.1676898","article-title":"A quantitative comparison of the performance of the three discrete distributed associative memory models","volume":"C-36","author":"Stiles","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(91)90061-X_BIB19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/355592.365659","article-title":"A simple algorithm for computing the generalized inverse of a matrix","author":"Rust","year":"1966","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0255(91)90061-X_BIB20","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TPAMI.1985.4767667","article-title":"On the effect of noise in the Moore-Penrose generalized inverse associative memory","volume":"7","author":"Stiles","year":"1985","journal-title":"IEEE Trans. PAMI"},{"issue":"4","key":"10.1016\/0020-0255(91)90061-X_BIB21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/12.2196","article-title":"Distributed and fault-tolerant computations for retrieval tasks","volume":"37","author":"Char","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(91)90061-X_BIB22","series-title":"An Introduction to Database Systems","author":"Date","year":"1986"},{"key":"10.1016\/0020-0255(91)90061-X_BIB23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00127846","article-title":"Efficient mapping and implementation of matrix algorithms on a hypercube","volume":"2","author":"Cherkassky","year":"1988","journal-title":"J. Supercomputing"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190061X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190061X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:23:15Z","timestamp":1552915395000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559190061X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["002002559190061X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(91)90061-x","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}