1099 search results - page 44 / 220 » String Transformation Learning |
ACL
2012
11 years 10 months ago
2012
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
NAACL
2003
13 years 9 months ago
2003
This paper describes an application of active learning methods to the classification of phone strings recognized using unsupervised phonotactic models. The only training data req...
RIA
2006
13 years 7 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...