Learning rational stochastic languages

@inproceedings{Denis2006LearningRS,
  title={Learning rational stochastic languages},
  author={François Denis and Yann Esposito and Amaury Habrard},
  booktitle={COLT},
  year={2006}
}
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution lawP called astochastic language , an usual goal in Grammatical Inference is to infer an estimate of P in some class of probabilistic models, such as Probabilistic Automata(PA). Here, we study the class S R (Σ) of rational stochastic languages , which consists in stochastic languages that can be generated by Multiplicity Automata(MA) and which strictly includes the class of stochastic… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
21 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 21 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 13 references

Nonparametric Learning , chapter Pattern classification and learning theory, pages 1–56

  • G. Lugosi.Principles
  • 2002
1 Excerpt

Bshouty , EyalKushilevitz , and Stefano Varricchio . Learning functions represented as multiplicity automata

  • Amos Beimel, Francesco Bergadano, H. Nader
  • Journal of the ACM
  • 2000

Vapnik.Statistical Learning Theory

  • V N.
  • John Wiley,
  • 1998
1 Excerpt

Bshouty , EyalKushilevitz , and Stefano Varricchio . On the applications of multiplicity automata in learning

  • Amos Beimel, Francesco Bergadano, H. Nader
  • IEEE Symposium on Foundations of Computer Science
  • 1996

Similar Papers

Loading similar papers…