759 search results - page 65 / 152 » Odometers on Regular Languages |
102
click to vote
JMLR
2010
14 years 4 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
LATA
2010
Springer
15 years 4 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...
ICMCS
1999
IEEE
15 years 2 months ago
1999
IEEE
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...
116
click to vote
EELC
2006
15 years 1 months ago
2006
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
NIPS
2004
14 years 11 months ago
2004
Statistical language models estimate the probability of a word occurring in a given context. The most common language models rely on a discrete enumeration of predictive contexts ...