Sciweavers

3653 search results - page 264 / 731
» Learning of Partial Languages
Sort
View
134
Voted
ECTEL
2007
Springer
15 years 9 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
PEPM
1993
ACM
15 years 9 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
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