Abstract
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.
Issue Section:
Squibs and Discussions
This content is only available as a PDF.
© 2003 Association for Computational Linguistics
2003