Sciweavers

432 search results - page 14 / 87
» On Notions of Regularity for Data Languages
Sort
View
ICMLC
2010
Springer
13 years 5 months ago
Data mining model in analyzing portuguese studies as the second language acquisition
: Portuguese is specifically a difficult language with luxuriant tenses, and second language acquisition (SLA) is regarded as highly variable. Many (Chinese) students who learn Por...
Sam Chao, Fai Wong, CustoDio Cavaco Martins
ICASSP
2009
IEEE
13 years 11 months ago
Neural network based language models for highly inflective languages
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
Tomas Mikolov, Jirí Kopecký, Lukas B...
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 7 months ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
ACS
2008
13 years 7 months ago
Epicompletion in Frames with Skeletal Maps, I: Compact Regular Frames
A frame homomorphism h : A - B is skeletal if x = 1 in A implies that h(x) = 1 in B. It is shown that, in KRegS, the category of compact regular frames with skeletal maps, the subc...
Jorge Martínez, Eric Richard Zenk
CSR
2008
Springer
13 years 9 months ago
Synchronization of Grammars
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
Didier Caucal, Stéphane Hassen