{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:57Z","timestamp":1759335837895,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"48","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGART Bull."],"published-print":{"date-parts":[[1974,10]]},"abstract":"<jats:p>Much of the Artificial Intelligence community is now aware of a computer simulation of paranoid processes developed by the Colby group at Stanford. The model (called PARRY) has been available for interviewing on the ARPA network and thousands of interviews have been conducted with several versions of the model. During the long period of development of the model, we have been aware of the limitations of various alternative programming approaches to designing an algorithm capable of conducting useful non-trivial dialogue in natural language. Colleagues, associates, and students have volunteered a number of criticisms of the model. Since criticisms can be endless, I shall restrict the discussion to only those which we consider serious, reasoned, and well-founded.<\/jats:p>","DOI":"10.1145\/1045200.1045202","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"5-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Ten criticisms of parry"],"prefix":"10.1145","author":[{"given":"Kenneth Mark","family":"Colby","sequence":"first","affiliation":[{"name":"Stanford University Stanford, Ca"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1974,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"ARTIFICIAL PARANOIA: a Computer Simulation of Paranoid Processes","author":"Colby K. M.","year":"1974","unstructured":"Colby , K. M. ( 1974 ). ARTIFICIAL PARANOIA: a Computer Simulation of Paranoid Processes . Pergamon, New York , (In Press) . Colby, K. M. (1974). ARTIFICIAL PARANOIA: a Computer Simulation of Paranoid Processes. Pergamon, New York, (In Press)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90002-6"},{"key":"e_1_2_1_3_1","article-title":"Pattern-matching rules for the recognition of natural language dialogue expressions","volume":"1","author":"Colby K. M.","year":"1974","unstructured":"Colby , K. M. , Parkison , R. C. , and Faught , B. ( 1974 ). \" Pattern-matching rules for the recognition of natural language dialogue expressions \". American Journal of Computational Linguistics. Vol. 1 , Microfiche 5. (Also appears as Stanford Artificial Intelligence Laboratory Memo AIM-234, Computer Science Department, Stanford University). Colby, K. M., Parkison, R. C., and Faught, B. (1974). \"Pattern-matching rules for the recognition of natural language dialogue expressions\". American Journal of Computational Linguistics. Vol. 1, Microfiche 5. (Also appears as Stanford Artificial Intelligence Laboratory Memo AIM-234, Computer Science Department, Stanford University).","journal-title":"American Journal of Computational Linguistics."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(72)90049-5"},{"key":"e_1_2_1_5_1","volume-title":"Multidimensional evaluation of a computer simulation of paranoid thought","author":"Colby K. M.","year":"1974","unstructured":"Colby , K. M. and Hilf , F. D . ( 1974 ). \" Multidimensional evaluation of a computer simulation of paranoid thought \". In Knowledge and Cognition, Gregg, L. (Ed.), Lawrence Ehrlbaum and Associates, Potomac, Maryland. (Also appears as Stanford Artificial Intelligence Laboratory Memo AIM-194, Computer Science Department, Stanford University) . Colby, K. M. and Hilf, F. D. (1974). \"Multidimensional evaluation of a computer simulation of paranoid thought\". In Knowledge and Cognition, Gregg, L. (Ed.), Lawrence Ehrlbaum and Associates, Potomac, Maryland. (Also appears as Stanford Artificial Intelligence Laboratory Memo AIM-194, Computer Science Department, Stanford University)."},{"key":"e_1_2_1_6_1","volume-title":"Measuring the improvement in linguistic comprehension in a model of paranoid processes.\" (Forthcoming)","author":"Colby K. M.","year":"1974","unstructured":"Colby , K. M. , Hilf , F. D. , Wittner , W. K. , Faught , B. , and Parkison , R. C . ( 1974 ). \" Measuring the improvement in linguistic comprehension in a model of paranoid processes.\" (Forthcoming) . Colby, K. M., Hilf, F. D., Wittner, W. K., Faught, B., and Parkison, R. C. (1974). \"Measuring the improvement in linguistic comprehension in a model of paranoid processes.\" (Forthcoming)."}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045200.1045202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1045200.1045202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:06Z","timestamp":1750264266000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045200.1045202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":6,"journal-issue":{"issue":"48","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["10.1145\/1045200.1045202"],"URL":"https:\/\/doi.org\/10.1145\/1045200.1045202","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1974,10]]},"assertion":[{"value":"1974-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}