7342 search results - page 344 / 1469 » Optimal Language Learning |
174
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
193
click to vote
CICLING
2004
Springer
16 years 20 days ago
2004
Springer
When text categorization is applied to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. In this paper, we...
198
click to vote
ICGI
1998
Springer
15 years 11 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
193
Voted
NGITS
1995
Springer
15 years 10 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
159
click to vote
CICLING
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a machine learning approach to the study of translationese. The goal is to train a computer system to distinguish between translated and non-translated text, in...