7 search results - page 1 / 2 » Languages as Hyperplanes: Grammatical Inference with String ... |
ECML
2006
Springer
13 years 8 months ago
2006
Springer
ICML
2009
IEEE
13 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...
TCS
2008
13 years 4 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
ALT
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
MLG
2007
Springer
13 years 11 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...