View source for Lattice Optimal-Path Finding Algorithm

A [[Lattice Optimal-Path Finding Algorithm]] is an [[Optimal-Path Finding Algorithm]] that is tailored solve a [[Lattice Optimal-Path Finding Task]].
* <B>Example(s):</B>
** [[Viterbi Algorithm]].
* <B>See:</B> [[Lattice Graph]], [[General-Graph Optimal-Path Finding Task]].

----
----

== References ==

=== 1989 ===
* ([[1989_TheNBestAlgorithmAnEfficientPro|Chow et al., 1989]]) ⇒ [[Yen-Lu Chow]], and [[Richard Schwartz]]. ([[1989]]). “[http://acl.ldc.upenn.edu/H/H89/H89-2027.pdf The N-Best Algorithm: An Efficient Procedure for Finding Top N Sentence Hypotheses].” In: [[Proceedings of the Workshop on Speech and Natural Language]]. [http://dx.doi.org/10.3115/1075434.1075467 doi:10.3115/1075434.1075467]
* ([[Rabiner, 1989]]) ⇒ [[Lawrence R. Rabiner]]. (1989). “[http://www.cs.ait.ac.th/~mdailey/cvreadings/Rabiner-Tutorial.pdf A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition].” In: Proceedings of the IEEE, 77(2).

----

__NOTOC__
[[Category:Concept]]