Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm
Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm
复制标题
哑炮和讨论：加权演绎解析和 Knuth 算法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
M. Nederhof
中科院分区：
文献类型：
--
作者：
M. Nederhof
我们讨论了加权演绎句法分析，并考虑了寻找具有最低权重的派生的问题。我们证明了Knuth对Dijkstra最短路径算法的推广提供了解决这一问题的一般方法。我们的方法是模块化的，因为Knuth的算法是独立于加权演绎系统而制定的。
We discuss weighted deductive parsing and consider the problem of finding the derivation with the lowest weight. We show that Knuth's generalization of Dijkstra's algorithm for the shortest-path problem offers a general method to solve this problem. Our approach is modular in the sense that Knuth's algorithm is formulated independently from the weighted deduction system.