{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:33:04Z","timestamp":1773325984321,"version":"3.50.1"},"reference-count":17,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":6480,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1989,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The development of efficient algorithms to support arithmetic coding has meant that powerful models of text can now be used for data compression. Here the implementation of models based on recognizing and recording words is considered. Move\u2010to\u2010the\u2010front and several variable\u2010order Markov models have been tested with a number of different data structures, and first the decisions that went into the implementations are discussed and then experimental results are given that show English text being represented in under 2\u20102 bits per character. Moreover the programs run at speeds comparable to other compression techniques, and are suited for practical use.<\/jats:p>","DOI":"10.1002\/spe.4380190207","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T20:56:43Z","timestamp":1163797003000},"page":"185-198","source":"Crossref","is-referenced-by-count":108,"title":["Word\u2010based text compression"],"prefix":"10.1002","volume":"19","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096090"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5688"},{"key":"e_1_2_1_5_2","first-page":"792","article-title":"Technical correspondence on \u201cA locally adaptive data compression scheme\u201d","volume":"30","author":"Ryabko B.","year":"1987","journal-title":"Comm. ACM"},{"key":"e_1_2_1_6_2","first-page":"792","article-title":"Technical correspondence on \u201cA locally adaptive data compression scheme\u201d","volume":"30","author":"Horspool R.","year":"1987","journal-title":"Comm. ACM"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_2_1_8_2","unstructured":"A.Moffat \u2018A data structure for arithmetic coding on large alphabets\u2019 Proceedings of the 11th Australian Computer Science Conference Brisbane 1988 pp.309\u2013317."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_2_1_10_2","unstructured":"R.Neal private communication 1987."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90036-7"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high performance data compression","volume":"17","author":"Welch T.","year":"1984","journal-title":"IEEE Computer"},{"key":"e_1_2_1_14_2","unstructured":"S.ThomasandJ.Orost Compress (version 4.0) Program and Documentation available frompetsd!joe@RUTGERS.EDU 1985."},{"key":"e_1_2_1_15_2","volume":"2","author":"Orost J.","year":"1987","journal-title":"Compress. digest"},{"key":"e_1_2_1_16_2","unstructured":"T.Bell \u2018A unifying theory and improvements for existing approaches to text compression\u2019 Ph.D. dissertation University of Canterbury Christchurch New Zealand 1986."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.6.541"},{"key":"e_1_2_1_18_2","volume-title":"A note on the PPM data compression scheme","author":"Moffat A.","year":"1988"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380190207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380190207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T23:46:12Z","timestamp":1697931972000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380190207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["10.1002\/spe.4380190207"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380190207","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}