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

树邻接语言的限制

Restrictions on Tree Adjoining Languages

Giorgio Satta, William Schuler

摘要:

已知有几种方法可以在O(n^6)的最坏情况下运行时间内解析树邻接文法(TAG)生成的语言。在本文中,我们研究需要对TAG和TAG推导进行哪些限制,以降低O(n^6)的时间复杂度,而不引入大的运行时常数,并且不会失去任何生成能力,这些生成能力是捕获自然语言中可以由不受限制的TAG处理的句法结构所需的。特别是,我们描述了一个算法,用于在O(n^5)中解析TAG的严格子类,并试图表明这个子类保留了足够的生成能力,使其在一般情况下有用。

英文摘要:

Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate which restrictions on TAGs and TAG derivations are needed in order to lower this O(n^6) time complexity, without introducing large runtime constants, and without losing any of the generative power needed to capture the syntactic constructions in natural language that can be handled by unrestricted TAGs. In particular, we describe an algorithm for parsing a strict subclass of TAG in O(n^5), and attempt to show that this subclass retains enough generative power to make it useful in the general case.

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

↑