Weighted deductive parsing and Knuth's algorithm

  • Authors:
  • Mark-Jan Nederhof

  • Affiliations:
  • Faculty of Arts, Humanities Computing, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands

  • Venue:
  • Computational Linguistics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.