Skip to Main content Skip to Navigation
Conference papers

Relevant Representations for the Inference of Rational Stochastic Tree Languages

Abstract : Recently, an algorithm, DEES, was proposed for learning rational stochastic tree languages. Given an independantly and identically distributed sample of trees, drawn according to a rational stochastic language, DEES outputs a linear representation of a rational series which converges to the target. DEES can then be used to identify in the limit with probability one rational stochastic tree languages. However, when DEES deals with finite samples, it often outputs a rational tree series which does not define a stochastic language. Moreover, the linear representation can not be directly used as a generative model. In this paper, we show that any representation of a rational stochastic tree language can be transformed in a reduced normalised representation that can be used to generate trees from the underlying distribution. We also study some properties of consistency for rational stochastic tree languages and discuss their implication for the inference. We finally consider the applicability of DEES to trees built over an unranked alphabet.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Marc Tommasi <>
Submitted on : Wednesday, September 10, 2008 - 1:47:49 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: : Saturday, November 26, 2016 - 1:29:24 AM


Files produced by the author(s)


  • HAL Id : hal-00293511, version 3



François Denis, Edouard Gilbert, Amaury Habrard, Faïssal Ouardi, Marc Tommasi. Relevant Representations for the Inference of Rational Stochastic Tree Languages. International Colloquium on Grammatical Inference, 2008, St Malo, France. pp.57-70. ⟨hal-00293511v3⟩



Record views


Files downloads