{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:09:42Z","timestamp":1648537782429},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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 Processing & Management"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0306-4573(89)90003-4","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T10:27:06Z","timestamp":1041244026000},"page":"151-160","source":"Crossref","is-referenced-by-count":2,"title":["Predictive encoding in text compression"],"prefix":"10.1016","volume":"25","author":[{"given":"Timo","family":"Raita","sequence":"first","affiliation":[]},{"given":"Jukka","family":"Teuhola","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4573(89)90003-4_BIB1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","article-title":"Prediction and entropy of printed English","volume":"30","author":"Shannon","year":"1951","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"10.1016\/0306-4573(89)90003-4_BIB2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1967.1053960","article-title":"Compact encoding of stationary Markov sources","volume":"IT-13","author":"Ott","year":"1967","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/0306-4573(89)90003-4_BIB3","series-title":"IBM Research Report RC5150","article-title":"Coding for data compaction","author":"Mommens","year":"1974"},{"key":"10.1016\/0306-4573(89)90003-4_BIB4","series-title":"ACM 1986 international conference on research and development in information retrieval","first-page":"97","article-title":"Text compression using prediction","author":"Teuhola","year":"1986"},{"key":"10.1016\/0306-4573(89)90003-4_BIB5","first-page":"223","article-title":"Predictive text compression by hashing","author":"Raita","year":"1987","journal-title":"ACM 1987 international conference on research and development in information retrieval"},{"issue":"4","key":"10.1016\/0306-4573(89)90003-4_BIB6","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string matching","volume":"COM-32","author":"Cleary","year":"1984","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/0306-4573(89)90003-4_BIB7","series-title":"Research report CS86-18","article-title":"Data compression using dynamic Markov modelling","author":"Cormack","year":"1986"},{"key":"10.1016\/0306-4573(89)90003-4_BIB8","series-title":"Information theory with applications","author":"Guiasu","year":"1977"},{"issue":"1","key":"10.1016\/0306-4573(89)90003-4_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"IT-22","author":"Lempel","year":"1976","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"10.1016\/0306-4573(89)90003-4_BIB10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"IT-23","author":"Ziv","year":"1977","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/0306-4573(89)90003-4_BIB11","series-title":"Ph.D. Thesis","article-title":"Data compression: Methods and complexity issues","author":"Storer","year":"1978"},{"issue":"1","key":"10.1016\/0306-4573(89)90003-4_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","article-title":"Universal modeling and coding","volume":"IT-27","author":"Rissanen","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"10.1016\/0306-4573(89)90003-4_BIB13","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1984.1056889","article-title":"A comparison of enumerative and adaptive codes","volume":"IT-30","author":"Cleary","year":"1984","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/0306-4573(89)90003-4_BIB14","series-title":"Combinatorial algorithms on words","first-page":"111","article-title":"Textual substitution techniques for data compression","author":"Storer","year":"1984"},{"issue":"3","key":"10.1016\/0306-4573(89)90003-4_BIB15","first-page":"16","article-title":"Foretelling the future by adaptive modeling","volume":"3","author":"Witten","year":"1986","journal-title":"ABACUS"},{"issue":"12","key":"10.1016\/0306-4573(89)90003-4_BIB16","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/362919.362934","article-title":"Implementation of the substring test by hashing","volume":"14","author":"Harrison","year":"1971","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/0306-4573(89)90003-4_BIB17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/2275.357411","article-title":"Signature files: An access method for documents and its analytical performance evaluation","volume":"2","author":"Faloutsos","year":"1984","journal-title":"ACM Transactions OIS"},{"issue":"6","key":"10.1016\/0306-4573(89)90003-4_BIB18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0020-0190(78)90024-8","article-title":"A compression method for clustered bit-vectors","volume":"7","author":"Teuhola","year":"1978","journal-title":"Information Processing Letters"},{"issue":"3","key":"10.1016\/0306-4573(89)90003-4_BIB19","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","article-title":"Self-organizing linear search","volume":"17","author":"Hester","year":"1985","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"10.1016\/0306-4573(89)90003-4_BIB20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communications of the ACM"},{"key":"10.1016\/0306-4573(89)90003-4_BIB21","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","article-title":"Run-length encoding","volume":"IT-12","author":"Golomb","year":"1966","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"10.1016\/0306-4573(89)90003-4_BIB22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1147\/rd.232.0149","article-title":"Arithmetic coding","volume":"23","author":"Rissanen","year":"1979","journal-title":"IBM Journal of Research and Development"},{"issue":"6","key":"10.1016\/0306-4573(89)90003-4_BIB23","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Communications of the ACM"},{"key":"10.1016\/0306-4573(89)90003-4_BIB24","series-title":"The art of computer programming, vol. 3: Sorting and searching","author":"Knuth","year":"1973"},{"issue":"1","key":"10.1016\/0306-4573(89)90003-4_BIB25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356643.356645","article-title":"Hash table methods","volume":"7","author":"Maurer","year":"1975","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0306-4573(89)90003-4_BIB26","author":"Raita","year":"1988","journal-title":"Generalized coding algorithms for predictive text compression"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457389900034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457389900034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T05:22:41Z","timestamp":1554873761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306457389900034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0306457389900034"],"URL":"https:\/\/doi.org\/10.1016\/0306-4573(89)90003-4","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}