Lattice Optimal-Path Finding Algorithm

From GM-RKB

Revision as of 02:55, 1 May 2015 by Gmelli (talk | contribs) (Text replacement - "& al, " to "et al., ")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

A Lattice Optimal-Path Finding Algorithm is an Optimal-Path Finding Algorithm that is tailored solve a Lattice Optimal-Path Finding Task.

Example(s):
- Viterbi Algorithm
See: Lattice Graph, General-Graph Optimal-Path Finding Task.

References

1989

(Chow et al., 1989) ⇒ Yen-Lu Chow, and Richard Schwartz. (1989). "The N-Best Algorithm: An Efficient Procedure for Finding Top N Sentence Hypotheses." In: Proceedings of the Workshop on Speech and Natural Language. doi:10.3115/1075434.1075467
(Rabiner, 1989) ⇒ Lawrence R. Rabiner. (1989). "A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition." In: Proceedings of the IEEE, 77(2).

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Lattice_Optimal-Path_Finding_Algorithm&oldid=176623"

Concept