Relevant representations for the inference of rational stochastic tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5278 LNAI, Issue , 2008, Pages 57-70

  Denis, François ^a   Gilbert, Édouard ^b   Habrard, Amaury ^a   Ouardi, Faïssal ^a   Tommasi, Marc ^b  

^a AIX MARSEILLE UNIV   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FORESTRY; INFERENCE ENGINES; SAMPLING; TREES (MATHEMATICS);

FINITE SAMPLES; GENERATIVE MODEL; LINEAR REPRESENTATION; RATIONAL SERIES; RATIONAL TREES; TREE LANGUAGES; UNDERLYING DISTRIBUTION;

STOCHASTIC SYSTEMS;

EID: 56649103579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88009-7_5     Document Type: Conference Paper

References (13)

1. Denis. F., Habrard, A.: Learning rational stochastic tree languages. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 242-256. Springer, Heidelberg (2007)
2. Booth, T., Thompson, R.: Applying probabilistic measures to abstract languages. IEEE Transactions on Computers 22(5), 442-450 (1973)
3. Wetherell. C.S.: Probabilistic languages: A review and some open questions. ACM Comput. Surv. 12(4), 361-379 (1980)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007) (release October 12, 2007). http://tata.gforge.inria.fr/
5. Berstel, J., Reutenauer. C.: Recognizable formal power series on trees. Theoretical Computer Science 18. 115-148 (1982)
6. Ésik, Z., Kuich, W.: Formal tree series. Journal of Automata, Languages and Combinatorics 8(2), 219-285 (2003)
7. Denis, F., Esposito, Y.: Rational stochastic languages. Technical report. LIF -Universite de Provence (2006), http://hal.ccsd.cnrs.fr/ccsd-00019728
8. Denis, F., Gilbert, E., Habrard. A., Ouardi. F., Tommasi. M.: Relevant representations for the inference of rational stochastic tree languages. Technical report. LIF, LIFL, and INRIA (2008). http://hal.archives-ouvertes.fr/ hal-00293511/en/
9. Denis, F., Esposito, Y., Habrard. A.: Learning rational stochastic languages. In: Lugosi, G., Simon, H.U. (eds.) Learning theory. LNCS, pp. 274-288. Springer, Heidelberg (2006)
10. Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computional Linguistics 21(2), 165-201 (1995)
11. Briiggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical report, Hong Kong University Theoretical Computer Science Center, Version 1 (2001)
12. Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105-118. Springer, Heidelberg (2004)
13. Droste. M., Vogler. H.: Weighted logics for XML (manuscript, 2007), http://www.orchid.inf.tu-dresden.de/gdp/monographs/r20.ps