Sciweavers

2917 search results - page 250 / 584
» Language Acquisition As Learning
Sort
View
ICML
2004
IEEE
16 years 5 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
134
Voted
ECTEL
2007
Springer
15 years 8 months ago
Curriculum Model Checking: Declarative Representation and Verification of Properties
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user's learning goals, that the curriculum i...
Matteo Baldoni, Elisa Marengo
ACL
2006
15 years 6 months ago
Unsupervised Analysis for Decipherment Problems
We study a number of natural language decipherment problems using unsupervised learning. These include letter substitution ciphers, character code conversion, phonetic deciphermen...
Kevin Knight, Anish Nair, Nishit Rathod, Kenji Yam...
151
Voted
COGSCI
2004
148views more  COGSCI 2004»
15 years 4 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
136
Voted
COLT
1999
Springer
15 years 9 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma