1736 search results - page 69 / 348 » String Extension Learning |
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
129
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
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...
141
click to vote
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
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...
147
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
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 ...
120
click to vote
COGSCI
2004
15 years 4 months ago
2004
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...