{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:42:09Z","timestamp":1759963329692},"reference-count":24,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1973,12,1]],"date-time":"1973-12-01T00:00:00Z","timestamp":123552000000},"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 Storage and Retrieval"],"published-print":{"date-parts":[[1973,12]]},"DOI":"10.1016\/0020-0271(73)90011-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"697-711","source":"Crossref","is-referenced-by-count":26,"title":["Selection of equifrequent word fragments for information retrieval"],"prefix":"10.1016","volume":"9","author":[{"given":"E.J.","family":"Schuegraf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.S.","family":"Heaps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0271(73)90011-9_BIB1","series-title":"Survey of Commercially Available Computer-Readable Bibliographic Data Bases","year":"1973"},{"key":"10.1016\/0020-0271(73)90011-9_BIB2","first-page":"39","article-title":"The Chemical Society research unit in information dissemination and retrieval","volume":"80","author":"Kent","year":"1968","journal-title":"Svensk Kemisk Tidskrift"},{"key":"10.1016\/0020-0271(73)90011-9_BIB3","article-title":"Term Fragment Analysis for Inversion of Large Files","author":"Schipma","year":"1971","journal-title":"Paper presented at meeting of Association of Scientific Information Dissemination Centers, Washington, D.C."},{"key":"10.1016\/0020-0271(73)90011-9_BIB4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0271(70)90057-4","article-title":"Optimum procedures for economic information retrieval","volume":"6","author":"Heaps","year":"1970","journal-title":"Inform. Star. Retr."},{"key":"10.1016\/0020-0271(73)90011-9_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0271(72)90024-1","article-title":"Program design for retrospective searches on large data bases","volume":"8","author":"Thiel","year":"1972","journal-title":"Inform. Stor. Retr."},{"key":"10.1016\/0020-0271(73)90011-9_BIB6","first-page":"47","article-title":"Storage analysis of a compression coding for document data bases","volume":"10","author":"Heaps","year":"1972","journal-title":"INFOR"},{"key":"10.1016\/0020-0271(73)90011-9_BIB7","unstructured":"J.J. Dimsdale and H.S. Heaps: File structure for an online catalog of one million titles. J. Lib. Automat, (in press)."},{"key":"10.1016\/0020-0271(73)90011-9_BIB8","first-page":"148","article-title":"Common phrases and minimum text storage","volume":"16","author":"Wagner","year":"1973","journal-title":"Commun. Assoc. Comp. Mach."},{"key":"10.1016\/0020-0271(73)90011-9_BIB9","first-page":"183","article-title":"An algorithm for extracting phrases in a space-optimal fashion","volume":"76","author":"Wagner","year":"1973","journal-title":"Commun. Assoc. Comp. Mach."},{"key":"10.1016\/0020-0271(73)90011-9_BIB10","first-page":"190","article-title":"On the theory of word frequencies and on related Markovian models of discourse","volume":"72","author":"Mandelbrot","year":"1960","journal-title":"Am. Math. Soc. Symp. appl. Math."},{"key":"10.1016\/0020-0271(73)90011-9_BIB11","series-title":"Human Behaviour and the Principle of Least Effort","author":"Zipf","year":"1949"},{"key":"10.1016\/0020-0271(73)90011-9_BIB12","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/S0019-9958(67)90201-X","article-title":"A \u201claw\u201d of occurrences for words of low frequency","volume":"70","author":"Booth","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0020-0271(73)90011-9_BIB13","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1145\/321479.321482","article-title":"The influence of data base characteristics and usage on direct access file organizations","volume":"75","author":"Lowe","year":"1968","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0020-0271(73)90011-9_BIB14_1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0271(73)90011-9_BIB14_2","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0271(73)90011-9_BIB15","series-title":"Einf\u00fchrung in die Allgemeine Informations Theorie","author":"Peters","year":"1967"},{"key":"10.1016\/0020-0271(73)90011-9_BIB16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0019-9958(67)90314-2","article-title":"A language element for compression coding","volume":"10","author":"Schwartz","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0020-0271(73)90011-9_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1021\/c160032a011","article-title":"Use of word fragments in computer based retrieval systems","volume":"3","author":"Colombo","year":"1969","journal-title":"J. Chem. Docum."},{"key":"10.1016\/0020-0271(73)90011-9_BIB18","first-page":"129","article-title":"Compaction of names by X-grams","volume":"6","author":"Walker","year":"1969","journal-title":"Proc. Am. Soc. Inform. Sci."},{"key":"10.1016\/0020-0271(73)90011-9_BIB19","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/15.3.259","article-title":"The identification of variable length equifrequent character strings in a natural language data base","volume":"15","author":"Clare","year":"1972","journal-title":"Comp. J."},{"key":"10.1016\/0020-0271(73)90011-9_BIB20","series-title":"Switching and Finite Automata Theory","author":"Kohavi","year":"1970"},{"key":"10.1016\/0020-0271(73)90011-9_BIB21","first-page":"28","article-title":"Storage and search properties of a tree organized memory system","volume":"6","author":"Scidmore","year":"1963","journal-title":"Commun. Assoc. Comp. Mach."},{"key":"10.1016\/0020-0271(73)90011-9_BIB22","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0271(73)90089-2","article-title":"Compression of bibliographic files using an adaption of run-length coding","volume":"3","author":"Lynch","year":"1973","journal-title":"Inform. Stor. Retr."},{"key":"10.1016\/0020-0271(73)90011-9_BIB23","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0020-0271(73)90072-7","article-title":"Analysis of the microstructure of titles in the INSPEC data-base","volume":"9","author":"Lynch","year":"1973","journal-title":"Inform. Stor. Retr."}],"container-title":["Information Storage and Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020027173900119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020027173900119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T04:56:22Z","timestamp":1554872182000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020027173900119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,12]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1973,12]]}},"alternative-id":["0020027173900119"],"URL":"https:\/\/doi.org\/10.1016\/0020-0271(73)90011-9","relation":{},"ISSN":["0020-0271"],"issn-type":[{"value":"0020-0271","type":"print"}],"subject":[],"published":{"date-parts":[[1973,12]]}}}