17 search results - page 1 / 4 » On the Rademacher Complexity of Weighted Automata |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
NIPS
2008
13 years 5 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
COLT
2003
Springer
13 years 9 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
FSMNLP
2005
Springer
13 years 9 months ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...