On compression of parse trees

Proceedings - 8th Symposium on String Processing and Information Retrieval, SPIRE 2001

Volumn , Issue , 2001, Pages 205-211

  Tarhio, Jorma ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

PARSE TREES; STATISTICAL MODELING; TEXT COMPRESSIONS;

FORESTRY;

EID: 33846516669     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.2001.989759     Document Type: Conference Paper

References (21)

1. A. Aho and J. Ullman. The Theory of Parsing, Translation and Compiling, Vol. I: Parsing. Prentice-Hall, Englewood Cliffs, N.J., 1972.
2. R. op den Akker and H. ter Doest. Weakly restricted stochastic grammars. In Proceedings of COLING '94, 15th International Conference on Computational Linguistics (ed. M. Nagao), Kyoto, Japan, pages 929-934, 1994.
3. T. Bell, J. Cleary, and I. Witten. Text Compression. Prentice Hall, Englewood Cliffs, N.J., 1990.
4. C. Bloom. Solving the problems of context modeling. http://www.cco.caltech.edu/~bloom/papers/ppmz.zip.
5. S. Bunton. Semantically motivated improvements for PPM variants. Computer Journal, 40(2/3):76-93, 1997.
6. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
7. R. Cameron. Source encoding using syntactic information source models. IEEE Transactions on Information Theory, 34(4):843-850, 1988.
8. J. Cheney. Compressing XML with multiplexed hierarchical PPM models. In Proceedings of DCC '01, Data Compression Conference, IEEE Computer Society Press, pages 163-172, 2001.
9. J. Cleary and W. Teahan. Unbounded length contexts for PPM. Computer Journal, 40(2/3):67-75, 1997
10. P. Howard and J. Vitter. Practical implementations of arithmetic coding. In Image and text compression (ed. J. Storer), Kluwer, pages 85-112, 1992.
11. S. Johnson. Yacc - yet another compiler compiler. Computing Science Technical Report 32, AT&T Bell Laboratories, 1975.
12. J. Katajainen and E. Mäkinen. Tree compression and optimization with applications, of program files. International Journal of Foundations of Computer Science, 4(1):425-447, 1990.
13. J. Katajainen, M. Penttonen, and J. Teuhola. Syntax-directed compression of program files. Software-Practice & Experience, 16(3):269-276, 1986.
14. K. Koskimies, O. Nurmi, J. Paakki, and S. Sippu. The design of a language processor generator. Software-Practice & Experience, 18(2):107-135, 1988.
15. J. M. Lake. Prediction by grammatical match. In Proceedings of DCC '00, Data Compression Conference, IEEE Computer Society Press, pages 153-162, 2000.
16. C. Nevill-Manning, I. Witten, and D. Maulsby. Compression by induction on hierarchical grammars. In Proceedings of DCC '94, Data Compression Conference (ed. J. Storer and M. Cohn), IEEE Computer Society Press, pages 244-253, 1994.
17. H. Peltola and J. Tarhio. On syntactical data compression. In Proceedings of the Second Symposium on Programming Languages and Software Tools (ed. K. Koskimies and K.-J. Räihä), Report A-1991-5, Department of Computer Science, University of Tampere, pages 205-214, 1991.
18. R. Stone. On the choice of grammar and parser for the compact analytical encoding of programs. Computer Journal, 29(4):307-314, 1986.
19. H. Stork, V. Haldar, and M. Franz. Generic adaptive syntax-directed compression for mobile code. Technical Report 00-42 (Revised version), Department of Information and Computer Science, University of California, Irvine, 2001.
20. J. Tarhio. Context coding of parse trees. In Proceedings of DCC '95, Data Compression Conference (ed. J. Storer and M. Cohn), IEEE Computer Society Press, page 442, 1995.
21. I. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Commun. ACM, 30(6):520-540, 1987.