Lattice Optimal-Path Finding Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ----" to ". ----") |
m (Text replacement - "]]↵*" to "]]. *") |
||
| Line 1: | Line 1: | ||
A [[Lattice Optimal-Path Finding Algorithm]] is an [[Optimal-Path Finding Algorithm]] that is tailored solve a [[Lattice Optimal-Path Finding Task]]. | 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> | * <B>Example(s):</B> | ||
** [[Viterbi Algorithm]] | ** [[Viterbi Algorithm]]. | ||
* <B>See:</B> [[Lattice Graph]], [[General-Graph Optimal-Path Finding Task]]. | * <B>See:</B> [[Lattice Graph]], [[General-Graph Optimal-Path Finding Task]]. | ||
Latest revision as of 18:42, 4 October 2023
A Lattice Optimal-Path Finding Algorithm is an Optimal-Path Finding Algorithm that is tailored solve a Lattice Optimal-Path Finding Task.
- Example(s):
- 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).