10 search results - page 1 / 2 » Learning Rational Stochastic Tree Languages |
ALT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
ALT
2010
Springer
13 years 1 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
ICML
2009
IEEE
13 years 11 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
ICDT
2010
ACM
13 years 8 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...