Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1162/089120103321337467 | Computational Linguistics |
Keywords | DocType | Volume |
dijkstra s algorithm,shortest path problem | Journal | 29 |
Issue | ISSN | Citations |
1 | 0891-2017 | 36 |
PageRank | References | Authors |
1.90 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark-jan Nederhof | 1 | 387 | 53.30 |
| NederhofMark-Jan | 2 | 84 | 6.71 |