arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.0052cs.FLcs.CL
收藏

学习原则和参数语法的复杂性

The Complexity of Learning Principles and Parameters Grammars

Jacob Andreas

摘要:

我们调查模型学习类上下文无关和上下文敏感的语言(CFL和CSL)。我们首先简要讨论了一些早期的硬度结果表明,不受限制的语言学习是不可能的,不受限制的CFL学习是计算上不可行的,然后我们简要调查的文献学习限制的CFL子类的算法。最后,我们引入了一个新的子类,原则参数上下文无关文法(和相应的原则参数上下文相关文法),它大致模拟了心理语言学中的“原则和参数”框架。我们提出了三个硬度的结果:第一,PPCFG是没有有效地学习等价和成员的神谕,第二,PPCFG是没有有效地学习积极的介绍,除非P = NP,第三,PPCSG是没有有效地学习积极的介绍,除非整数分解是在P。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑