Finding the k shortest hyperpaths

Cached

Download Links

by Lars Relund Nielsen , Kim Allan Andersen , Daniele Pretolani
Citations:9 - 1 self

Documents Related by Co-Citation

74 Directed Hypergraphs And Applications – Giorgio Gallo, Giustino Longo, Sang Nguyen, Stefano Pallottino - 1992
50 A generalization of Dijkstra’s algorithm – Donald Knuth - 1977
12 An Efficient Algorithm for the n-Best-Strings Problem – Mehryar Mohri, Michael Riley - 2002
21 Coarse-to-fine-grained n-best parsing and discriminative reranking – Eugene Charniak, Mark Johnson - 2005
466 Automatic labeling of semantic roles – Daniel Gildea - 2002
150 Principles and implementation of deductive parsing – Stuart M. Shieber, Yves Schabes, Fernando C. N. Pereira - 1995
156 Online large-margin training of dependency parsers – Ryan Mcdonald, Koby Crammer, Fernando Pereira - 2005
11 Weighted deductive parsing and Knuth’s algorithm – Mark-Jan Nederhof
7324 Cache-oblivious algorithms – M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN - 1999
1965 Dynamic Programming – R Bellman - 1957
81 Training Tree Transducers – Jonathan Graehl, Kevin Knight - 2004
85 An efficient recognition and syntax analysis algorithm for context-free languages – J Kasami - 1965
209 Hierarchical phrase-based translation – David Chiang - 2007
728 A Formal Basis for the Heuristic Determination of Minimum Cost Paths – P E Hart, N J Nilsson, B Raphael - 1968
103 Better k-best parsing – Liang Huang - 2005
8 Marzal (2000). ‘Computation of the n Best Parse Trees for Weighted and Stochastic Context-Free Grammars – V M Jiménez, A
65 A* Parsing: Fast Exact Viterbi Parse Selection – Dan Klein, Christopher D. Manning - 2003
7 Method and system for natural language translation – Peter F Brown, John Cocke, Stephen A Della Pietra, Vincent J Della Pietra, Frederick Jelinek, Jennifer C Lai, Robert L Mercer - 1995
5 Comment on computing the k shortest paths in a graph – Eugene L Lawler - 1977