Constrained Systems for Efficient Natural Language Processing

高效自然语言处理的约束系统

• 批准号: 8909810
• 负责人: David Weir
• 金额: $ 6.2万
• 依托单位: Northwestern University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1989
• 资助国家: 美国
• 起止时间: 1989-09-01 至 1992-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8909810&HistoricalAwards=false
• 关键词: Constrained; Systems; Efficient; Natural; Language

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.

这项对基于计算机的语言处理形式主义的研究将重点关注促进语言模型实施的特征。 不仅应该能够将此类模型简洁地嵌入到系统中，而且生成的系统应该具有计算效率。 为了达到要求所确定的限制形式，使其适合表达自然语言模型。 在早期的工作中，研究人员发现了一系列受限语法形式主义的几个共同特征，尽管它们的符号非常不同。 这些特征涉及推导过程形式的限制，并且似乎表明这些形式中的每一种都适合高效的并行解析算法。 该研究现在将利用并行计算模型的研究结果，形式化这些系统的共同特征及其处理含义。 这应该会导致对计算语言学发展的理论中固有的理想计算特性有更深入的理解。