1531 search results - page 82 / 307 » Learning probabilistic models of the Web |
142
click to vote
ACL
2008
2008
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
15 years 7 months ago
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
249
click to vote
CAISE
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. Flexibility and automatic learning are key aspects to support users in dynamic business environments such as value chains across SMEs or when organizing a large event. Pr...
171
Voted
IJDAR
2010
15 years 4 months ago
2010
Inthispaper,weproposeadescriptorcombination method, which enables to improve significantly the recognition rate compared to the recognition rates obtained by each descriptor. This ...
173
click to vote
AROBOTS
1999
15 years 5 months ago
1999
We use reinforcement learning (RL) to compute strategies for multiagent soccer teams. RL may pro t signi cantly from world models (WMs) estimating state transition probabilities an...
301
click to vote
ACL
1998
15 years 7 months ago
1998
This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. ...