arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.0627cs.CL
收藏

规则加权和终端加权上下文无关文法具有相同的表达性

Rule-weighted and terminal-weighted context-free grammars have identical expressivity

CNRS(法国国家科学研究中心);LIX(计算机科学实验室);Ecole Polytechnique(巴黎综合理工学院);INRIA(法国国家信息与自动化研究所)

Yann Ponty

摘要:

两个形式主义,都基于上下文无关文法,最近被提出作为一个非均匀随机生成的组合对象的基础。前者由Denise等人引入,将权重与字母相关联,而后者最近由Weinberg等人在随机生成的上下文中探索,将权重与转换相关联。在这个简短的说明中,我们使用一个简单的修改的Greibach范式变换算法,由于Blum和Koch,以显示等价的表达式,在他们的诱导分布,这两个形式主义。

英文摘要:

Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the latter, recently explored by Weinberg et al in the context of random generation, associates weights to transitions. In this short note, we use a simple modification of the Greibach Normal Form transformation algorithm, due to Blum and Koch, to show the equivalent expressivities, in term of their induced distributions, of these two formalisms.

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

↑