This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Error-Correcting Viterbi Parsing
October 1998 (vol. 20 no. 10)
pp. 1109-1116

Abstract—The problem of Error-Correcting Parsing (ECP) using an insertion-deletion-substitution error model and a Finite State Machine is examined. The Viterbi algorithm can be straightforwardly extended to perform ECP, though the resulting computational complexity can become prohibitive for many applications. We propose three approaches in order to achieve an efficient implementation of Viterbi-like ECP which are compatible with Beam Search acceleration techniques. Language processing and shape recognition experiments which assess the performance of the proposed algorithms are presented.

[1] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.
[2] A.V. Aho, "Algorithms for Finding Patterns in Strings," Algorithms and Complexity, vol. A, pp. 255-300, J.V. Leeuwen, ed. Handbook of Theoretical Computer Science. Elsevier Science Publishers, (MIT Press copublisher for USA, Canada, and Japan), 1990.
[3] J.C. Amengual and E. Vidal, "Fast Viterbi Decoding With Error Correction," Preprints of the Sixth Spanish Symp. Pattern Recognition and Image Analysis, pp. 218-226. A. Calvo and R. Medina eds. Córdoba, Spain, Apr.3-7 1995.
[4] J.C. Amengual and E. Vidal, "Two Different Approaches for Cost-efficient Viterbi Parsing With Error Correction," Advances in Structural and Syntactic Pattern Recognition, P. Perner, P. Wang, and A. Rosenfeld, eds., pp. 30-39. LNCS 1121. Springer-Verlag, 1996.
[5] J.C. Amengual and E. Vidal, "Different Approaches for Efficient Error-Correcting Viterbi Parsing: An Experimental Comparison," Technical Report, DSIC-II/32/96, Depto. de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Spain, 1996.
[6] J.C. Amengual, E. Vidal, and J.M. Benedí, "Simplifying Language Through Error-Correcting Decoding," Proc. ICSLP96 Fourth Int'l Conf. Spoken Language Processing, pp. 841-844,Philadelphia, Penn.,3-6 Oct., 1996.
[7] L.R. Bahl and F. Jelinek, “Decoding for Channels with Insertions, Deletions, and Substitutions with Applications to Speech Recognition,” IEEE Trans. Information Theory, vol. 21, no. 4, pp. 404-411, July 1975.
[8] A. Bouloutas, G.W. Hart, and M. Schwartz, "Two Extensions of the Viterbi Algorithm," IEEE Trans. Information Theory, vol. 37, no. 2, pp. 430-436, Mar. 1991.
[9] J.A. Feldman, G. Lakoff, A. Stolcke, and S.H. Weber, "Miniature Language Acquisition: A Touchstone for Cognitive Science," Technical Report, TR-90-009, Int'l Computer Science Inst., Berkeley, Calif., Apr. 1990.
[10] G.D. Forney, "The Viterbi Algorithm," Proc. IEEE, vol. 61, pp. 268-278, 1973.
[11] K.S. Fu, Syntactic Pattern Recognition and Applications. Prentice Hall, 1982.
[12] P. Garcia and E. Vidal, "Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 920-925, Sept. 1990.
[13] R.C. Gonzalez and M.G. Thomason, Syntactic Pattern Recognition. An Introduction, Advanced Book Program.Reading, Mass.: Addison-Wesley Pub. Co., 1978.
[14] Y.S. Han, C.R.P. Hartmann, and C. Chen, "Efficient Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes," IEEE Trans. Information Theory, vol. 39, no. 5, pp. 1,514-1,523, Sept. 1993.
[15] G.W. Hart and A. Bouloutas, "Correcting Dependent Errors in Sequences Generated by Finite-State Processes," IEEE Trans. Information Theory, vol. 39, no. 4, pp. 1,249-1,260, July 1993.
[16] M.J. Hunt, "Evaluating the Performance of Connected-Word Speech Recognition Systems," Proc. ICASSP, pp. 457-460, 1988.
[17] B.T. Lowerre, "The Harpy Speech Recognition System," Internal Report. Carnegie-Mellon University. 1976.
[18] S. Lucas, E. Vidal, A. Amiri, S. Hanlon, and J.C. Amengual, "A Comparison of Syntactic and Statistical Techniques for Off-Line OCR," Grammatical Inference and Applications, pp. 168-179. R.C. Carrasco and J. Oncina, eds. LNCS 862. Springer-Verlag, 1994.
[19] R.J. McEliece, "On the BCJR Trellis for Linear Block Codes," IEEE Trans. Information Theory, vol. 42, no. 4, pp. 1,072-1,092, July 1996.
[20] H. Rulot, "ECGI. Un Algoritmo de Inferencia Gramatical Mediante Corrección de Errores" (in Spanish), PhD Dissertation, Universidad de Valencia, 1992.
[21] D. Sankoff, J. B. Kruskal, eds., Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley Publishing Company, 1983.
[22] F. Torró, E. Vidal, and H. Rulot, "Fast and Accurate Speaker Independent Speech Recognition Using Structural Models Learnt by the ECGI Algorithm," Signal Processing V: Theories and Applications. Elsevier Science Publishers, 1990.
[23] E. Vidal, F. Casacuberta, and P. García, "Grammatical Inference and Automatic Speech Recognition," Speech Recognition and Coding, New Advances and Trends, A.J. Rubio and J.M. López, eds., pp. 174-191. NATO Advanced Study Institute. Berlin: Springer-Verlag, 1995.
[24] N. Wiberg, H. Loeliger, and R. Kötter, "Codes and Iterative Decoding on General Graphs," European Trans. Telecommunications, vol. 6, no. 5, pp. 513-525, Sept.-Oct. 1995.

Index Terms:
Error-correcting parsing, sequence alignment, Viterbi algorithm, beam search, depth-first topological sort, bucketsort, priority queues, language processing, shape recognition.
Citation:
Juan C. Amengual, Enrique Vidal, "Efficient Error-Correcting Viterbi Parsing," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 10, pp. 1109-1116, Oct. 1998, doi:10.1109/34.722628
Usage of this product signifies your acceptance of the Terms of Use.