文章基本信息

标题：Weighted Deductive Parsing and Knuth's Algorithm
本地全文：下载
作者：Mark-Jan Nederhof
期刊名称：Computational Linguistics
印刷版ISSN：0891-2017
电子版ISSN：1530-9312
出版年度：2003
卷号：29
期号：1
页码：135-143
DOI：10.1162/089120103321337467
语种：English
出版社：MIT Press
摘要：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.