2914 search results - page 65 / 583 » Learning and Inference with Constraints |
ECML
2003
Springer
14 years 27 days ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
COLT
1992
Springer
13 years 11 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
NIPS
2003
13 years 9 months ago
2003
When we learn a new motor skill, we have to contend with both the variability inherent in our sensors and the task. The sensory uncertainty can be reduced by using information abo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
EMNLP
2010
13 years 5 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...