Lattice Optimal-Path Finding Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "& al, " to "et al., ") |
||
| Line 8: | Line 8: | ||
===1989=== | ===1989=== | ||
* ([[1989_TheNBestAlgorithmAnEfficientPro|Chow | * ([[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). | * ([[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). | ||
---- | ---- | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Revision as of 02:55, 1 May 2015
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).