Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars
复制标题
进退两难——超边替换 DAG 语法的统一解析
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Petter Ericson
中科院分区：
文献类型：
--
作者：
Henrik Björklund;F. Drewes;Petter Ericson
出于自然语言处理中的应用，我们研究了产生有向无环图的超边替换文法的一致成员问题。我们的主要结果是一个低次多项式时间算法，解决了统一的成员资格问题的限制类型的语法。我们通过两个不同的NP-完全性结果证明了限制的必要性。
Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a low-degree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.