Constrained Systems for Efficient Natural Language Processing

本文研究了一种基于计算机的语言处理方法， 形式主义将侧重于促进 语言模型的实现。 它不仅应该是 可以在系统中嵌入这样的模型简洁，但 所得到的系统应该在计算上是高效的。 为了 以实现形式的限制所确定的 要求它适合表达自然语言 模型 在早期的工作中，研究人员发现了几个 一系列约束语法形式主义的共同特征， 尽管它们的符号非常不同。 这些特征涉及 限制的形式的推导过程，并出现 表明这些形式主义中每一个都适合于有效的 并行分析算法 这项研究现在将正式确定 这些系统及其处理的共同特征 影响，使用并行模型研究的结果 计算 这将导致更深入地了解 理论发展中固有的理想计算特性 通过计算语言学。

This investigation of a computer based language processing formalism will focus on characteristics that facilitate the implementation of linguistic models. It should not only be possible to embed such models in the system concisely, but the resulting system should be computationally efficient. In order to achieve the form of the restrictions determined by the requirement that it be suitable for expressing natural language models. In earlier work, the investigator identified several features common to a range of constrained grammar formalisms, despite their very different notations. These features concern restrictions of the form of the derivation process, and appear to indicate that each of these formalisms is amenable to efficient parallel parsing algorithms. The research will now formalize the common features of these systems and of their processing implications, using results from research on parallel models of computation. This should lead to a deeper understanding of the desirable computational properties inherent in theories developed by computational linguistics.