Sciweavers

425 search results - page 5 / 85
» Using Stochastic Grammars to Learn Robotic Tasks
Sort
View
EACL
2006
ACL Anthology
13 years 10 months ago
Edit Machines for Robust Multimodal Language Processing
Multimodal grammars provide an expressive formalism for multimodal integration and understanding. However, handcrafted multimodal grammars can be brittle with respect to unexpecte...
Srinivas Bangalore, Michael Johnston
EMNLP
2010
13 years 6 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 12 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
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...
Sara Cohen, Benny Kimelfeld
EPIA
2007
Springer
14 years 2 months ago
Generalization and Transfer Learning in Noise-Affected Robot Navigation Tasks
Abstract. When a robot learns to solve a goal-directed navigation task with reinforcement learning, the acquired strategy can usually exclusively be applied to the task that has be...
Lutz Frommberger
JMLR
2010
192views more  JMLR 2010»
13 years 3 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater