Stochastic k-testable tree languages and applications

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2484, Issue , 2002, Pages 199-212

  Rico Juan, Juan Ramon ^a   Calera Rubio, Jorge ^a   Carrasco, Rafael C ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Backing off; Data compression; Stochastic models; Tree grammars

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; DATA COMPRESSION; FORESTRY; INFERENCE ENGINES; STOCHASTIC SYSTEMS; TREES (MATHEMATICS);

BACKING-OFF; BACKING-OFF SCHEMES; GRAM MODELS; PROBABILISTIC MODELING; TREE AUTOMATA; TREE DATA; TREE GRAMMARS; TREE LANGUAGES;

STOCHASTIC MODELS;

EID: 84886929718     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_16     Document Type: Conference Paper

References (24)

1. Peter F. Brown, Vincent J. Della Pietra, Peter V. deSouza, Jenifer C. Lai, and Robert L. Mercer. Class-based n-gram models of natural language. Computational Linguistics, 18(4):467-479, 1992.
2. Rafael C. Carrasco, Mikel L. Forcada, M. ángeles Valdés-Muñoz, and Ramón P. ñeco. Stable encoding of finite-state machines in discrete-time recurrent neural nets with sigmoid units. Neural Computation, 12(9):2129-2174, 2000.
3. Eugene Charniak. Statistical Language Learning. MIT Press, 1993.
4. R. Chaudhuri, S. Pham, and O. N. Garcia. Solution of an open problem on probabilistic grammars. IEEE Transactions on Computers, 32(8):758-750, 1983.
5. K. L. Chung. Markov Chains with Stationary Transition Probabilities. Springer, Berlin, 2 edition, 1967.
6. John G. Cleary and Ian H. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Communicaton, 32(4):396-402, 1984.
7. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA, 1991.
8. Pedro Garciá. Learning k-testable tree sets from positive data. Technical Report DSIC-ii-1993-46, DSIC, Universidad Politécnica de Valencia, 1993.
9. Pedro Garciá and Enrique Vidal. Inference of k-testable languages in the strict sense and application to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(9):920-925, sep 1990.
10. Frederick Jelinek. Statistical Methods for Speech Recognition. The MIT Press, Cambridge, Massachusetts, 1998.
11. T. Knuutila and M. Steinby. The inference of tree languages from finite samples: An algebraic approach. Theoretical Computer Science, 129:337-367, 1994.
12. Timo Knuutila. Inference of k-testable tree languages. In H. Bunke, editor, Advances in Structural and Syntactic Pattern Recognition (Proc. Intl. Workshop on Structural and Syntactic Pattern Recognition, Bern, Switzerland). World Scientific, aug 1993.
13. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. Building a large annotated corpus of english: The penn treebank. Computational Linguistics, 19:313-330, 1993.
14. H. Ney, U. Essen, and R. Kneser. On the estimation of small probabilities by leaving-one-out. IEEE Trans. on Pattern Analysis and Machine Intelligence, 17(12):1202-1212, 1995.
15. Maurice Nivat and Andreas Podelski. Minimal ascending and descending tree automata. SIAM Journal on Computing, 26(1):39-58, 1997.
16. J. R. Rico-Juan, J. Calera-Rubio, and R. C. Carrasco. Stochastic k-testable tree languages and applications. http://www. dlsi. ua. es/calera/fulltext02. ps. gz, 2002.
17. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages. Springer, 1997.
18. Frank Rubin. Experiments in text file compression. Communications of the ACM, 19(11):617-623, 1976.
19. Yasubumi Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 97(1):23-60, March 1992.
20. J. A. Sánchez and J. M. Benedí. Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(9):1052-1055, 1997.
21. Andreas Stolcke. An efficient context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201, 1995.
22. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kauffman Publishing, San Francisco, 2nd edition, 1999.
23. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, 1987.
24. Takashi Yokomori. On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning, 19(2):153-179, 1995.