Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Complexity of Learning Principles and Parameters Grammars   We investigate models for learning the class of context-free and
context-sensitive languages (CFLs and CSLs). We begin with a brief discussion
of some early hardness results which show that unrestricted language learning
is impossible, and unrestricted CFL learning is computationally infeasible; we
then briefly survey the literature on algorithms for learning restricted
subclasses of the CFLs. Finally, we introduce a new family of subclasses, the
principled parametric context-free grammars (and a corresponding family of
principled parametric context-sensitive grammars), which roughly model the
"Principles and Parameters" framework in psycholinguistics. We present three
hardness results: first, that the PPCFGs are not efficiently learnable given
equivalence and membership oracles, second, that the PPCFGs are not efficiently
learnable from positive presentations unless P = NP, and third, that the PPCSGs
are not efficiently learnable from positive presentations unless integer
factorization is in P.

7
The categories of this paper are: hep-th
2
The categories of this paper are: math
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
30
The categories of this paper are: q-alg
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph