CHR语法
CHR Grammars
摘要:
本文提出了一种类似于在Prolog上定义和实现定子句文法的文法形式。这些语法作为健壮的自底向上解析器执行,具有固有的歧义处理和高度灵活性,可以对各种语言现象进行建模。形式主义扩展了以前的逻辑编程为基础的语法与形式的上下文敏感的规则和可能性,包括额外的语法假设在头部和身体的语法规则。其中的应用程序是假设语法和溯因完整性约束下的语言分析的直接实现。自底向上文法是语言处理器的一个有力的规范和实现工具,并可能成为逻辑程序设计中自底向上文法的一个新标准。《逻辑程序设计理论与实践》(Theory and Practice of Logic Programming,TPLP),2005年
英文摘要:
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming. To appear in Theory and Practice of Logic Programming (TPLP), 2005
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。