{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T01:06:48Z","timestamp":1759972008360,"version":"build-2065373602"},"reference-count":4,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2007,9,6]],"date-time":"2007-09-06T00:00:00Z","timestamp":1189036800000},"content-version":"vor","delay-in-days":9136,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Am. Soc. Inf. Sci."],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article offers a personal look back at the origins and early use of associative search techniques, and also a look forward at more theoretical approaches to the document retrieval problems. The purpose is to contrast the following two different ways of improving system performance: (1) appending associative search techniques to more or less standard (conventional) document retrieval systems, and (2) designing document retrieval systems based on more fundamental and appropriate principles namely probabilistic design principles. Very recent work on probabilistic approaches to the document retrieval problem has provided a new (and rare) unification of two previously competing models. In light of this, I argue that if we had to choose the best way to improve performance of a document retrieval system, it would be wiser to implement, test, and evaluate this new unified model, rather than to continue to use associative techniques which are coupled to conventionally designed retrieval systems.<\/jats:p>","DOI":"10.1002\/asi.4630330510","type":"journal-article","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T11:41:21Z","timestamp":1278502881000},"page":"308-310","source":"Crossref","is-referenced-by-count":5,"title":["Associative Search Techniques versus Probabilistic Retrieval Models"],"prefix":"10.1002","volume":"33","author":[{"given":"M. E.","family":"Maron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,9,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321035"},{"volume-title":"Statistical Association Methods for Mechanized Documentation. Symposium Proceedings.","year":"1965","author":"Stevens","key":"e_1_2_1_3_2"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630270302"},{"issue":"1","key":"e_1_2_1_5_2","first-page":"1","article-title":"Probability of Relevance: A Unification of Two Competing Models for Document Retrieval.","volume":"1","author":"Robertson S. E","year":"1982","journal-title":"Information Technology: Research und Development"}],"container-title":["Journal of the American Society for Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fasi.4630330510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/asi.4630330510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T18:22:29Z","timestamp":1759947749000},"score":1,"resource":{"primary":{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/10.1002\/asi.4630330510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1002\/asi.4630330510"],"URL":"https:\/\/doi.org\/10.1002\/asi.4630330510","archive":["Portico"],"relation":{},"ISSN":["0002-8231","1097-4571"],"issn-type":[{"type":"print","value":"0002-8231"},{"type":"electronic","value":"1097-4571"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}