Two Algorithms for Finding $k$ Shortest Paths of a Weighted Pushdown Automaton
Computation and Language
2013-02-06 v3 Data Structures and Algorithms
Formal Languages and Automata Theory
Abstract
We introduce efficient algorithms for finding the shortest paths of a weighted pushdown automaton (WPDA), a compact representation of a weighted set of strings with potential applications in parsing and machine translation. Both of our algorithms are derived from the same weighted deductive logic description of the execution of a WPDA using different search strategies. Experimental results show our Algorithm 2 adds very little overhead vs. the single shortest path algorithm, even with a large .
Cite
@article{arxiv.1212.0927,
title = {Two Algorithms for Finding $k$ Shortest Paths of a Weighted Pushdown Automaton},
author = {Ke Wu and Philip Resnik},
journal= {arXiv preprint arXiv:1212.0927},
year = {2013}
}