Sciweavers

1099 search results - page 96 / 220
» String Transformation Learning
Sort
View
LATA
2010
Springer
14 years 5 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
ICML
2009
IEEE
14 years 5 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
ICML
2010
IEEE
13 years 11 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
COGSCI
2004
70views more  COGSCI 2004»
13 years 10 months ago
Artificial syntactic violations activate Broca's region
In the present study, using event-related functional magnetic resonance imaging, we investigated a group of participants on a grammaticality classification task after they had bee...
Karl Magnus Petersson, Christian Forkstam, Martin ...
ICDAR
2011
IEEE
12 years 10 months ago
Objective Function Design for MCE-Based Combination of On-line and Off-line Character Recognizers for On-line Handwritten Japane
—This paper describes effective object function design for combining on-line and off-line character recognizers for on-line handwritten Japanese text recognition. We combine on-l...
Bilan Zhu, Jinfeng Gao, Masaki Nakagawa