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

再论约束语法的威力

The Power of Constraint Grammars Revisited

University of Helsinki(赫尔辛基大学)

Anssi Yli-Jyrä

摘要:

序列约束语法(SCG)(Karlsson,1990)及其扩展与形式语言理论缺乏明确的联系。本文的目的是通过简化由语法处理的字符串的定义,并通过表明非单调SCG是不可判定的,并存在类似于生成音系学的派生,为这些连接奠定基础。目前的研究提出了资源界限,限制生成能力的SCG的一个子集的上下文敏感的语言,并提出了一个强大的有限状态条件的语法作为整体。我们表明,一个语法是等价于一个有限状态转换器,如果它是用一个图灵机,运行在O(n log n)的时间。这种情况下,打开了新的有限状态的假设和途径,更深入地分析SCG实例的方式启发的有限状态音系学。

英文摘要:

Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have lacked clear connections to formal language theory. The purpose of this article is to lay a foundation for these connections by simplifying the definition of strings processed by the grammar and by showing that Nonmonotonic SCG is undecidable and that derivations similar to the Generative Phonology exist. The current investigations propose resource bounds that restrict the generative power of SCG to a subset of context sensitive languages and present a strong finite-state condition for grammars as wholes. We show that a grammar is equivalent to a finite-state transducer if it is implemented with a Turing machine that runs in o(n log n) time. This condition opens new finite-state hypotheses and avenues for deeper analysis of SCG instances in the way inspired by Finite-State Phonology.

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

↑