Login / Signup
On families of categorial grammars of bounded value, their learnability and related complexity questions.
Christophe Costa Florêncio
Henning Fernau
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
computational complexity
closely related
grammatical inference
vapnik chervonenkis dimension
boolean functions
uniform distribution
complexity analysis
context free
learning algorithm
natural language
computational cost
context sensitive