On-line and off-line heuristics of for inferring hierarchies of repetitions in sequences

Proceedings of the IEEE

Volumn 88, Issue 11, 2000, Pages 1745-1755

  Nevill Manning, Craig G ^a   Witten, Ian H ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Dictionary compression; Grammar inference; Hierarchical compression

Indexed keywords

EID: 10644257127     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.892710     Document Type: Article

References (16)

1. H. Abelson and A. diSessa, Turtle Geometry. Cambridge, MA: MIT Press, 1980.
2. J. Bentley and D. Mcllroy, "Data compression using ions common strings," in froc. Data Compression Conf. Los Alamitos, CA: IEEE Press, 1999, pp. 287-295.
3. [3j R. D. Cameron, "Source encoding using syntactic information source models," IEEE Trans. Inform. Theory, vol. 34, pp. 843-850, July 1988.
4. D. Gusfield, Algorithms on Strings, Trees, and Sequences. Cambridge, U.K.: Cambridge Univ. Press, 1997.
5. [51 J. C. Kieffer and E.-H. Yang, "Grammar based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, vol. 46, pp. 737-754, 2000.
6. N. J. Larsson and A. Moffat, "Offline dictionary-based compression," in Proc. Data Compression Conf. Los Aiamitos, CA: IEEE Press, 1999, pp. 296-305.
7. A. R. Martin, "Intelligent speech synthesis using the sequitur algorithm and graphical training: Server software," M.S. thesis, Dept. Eng. Sei., Univ. Toronto, Toronto, Canada, 1999.
8. V. S. Miller and M. N. Wegman, "Variations on a theme by Ziv and Lempel." in Combinatorial Algorithm; on Words, ser. NATO ASI, A. Apostolico and Z. Galil, Eds. Berlin, Germany: Springer-Verlag, 1985. vol. F12, pp. 131-140.
9. C. G. Nevill-Manning and l. H. Witten, "Identifying hierarchical structure in sequences: A linear-time algorithm," J. Artif. Intell. Res., vol. 7, pp. 67-82, 1997.
10. C. G. Nevill-Manning, I. H. Willen, and G. W. Paynter, "Lexically-generated subject hierarchies for browsing large collections," Int. J. Dig. Lib., vol. 2, no. 2/3. pp. 111-123, 1999.
11. C. G, Nevill-Manning and L. H. Witter, "Phrase hierarchy inference and compression in bounded space," in Proc. Data Compression Conf.. J. A. Sforer and .VI. Conn, Eds. Los Aiamitos. CA: IEEE Press, 1998, pp. 179-188.
12. P. Prusinkiewicz and J. Hanan, Lindenmayer Systems, Fractals, and Plants. New York: Springer-Verlag. 1989.
13. J. G. Wolff. "An algorithm for the segmentation of an artificial language analogue," Brit. J. Psych., vol. 66. pp. 79-90, 1975.
14. J- Ziv and A. Lempel. "A universal algorithm for sequential data compression," IEEE 'Irans. Inform. Theory, vol. IT-23, pp. 337-343, May 1977.
15. _, ''Compression of individual sequences via variable-rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
16. J. R. Larus, "Whole Program Paths," in Proc. ACM Conf. Programming Language Design and Implementation, 1999, pp. 259-269.