Optimal linguistic decoding is a difficult computational problem
- 1 August 1999
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 20 (8) , 813-821
- https://doi.org/10.1016/s0167-8655(99)00045-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- GROWTH TRANSFORMATIONS FOR PROBABILISTIC FUNCTIONS OF STOCHASTIC GRAMMARSInternational Journal of Pattern Recognition and Artificial Intelligence, 1996
- A comparative study of two search strategies for connected word recognition: dynamic programming and heuristic searchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992