Stochastic Inversion Transduction Grammars are a very powerful formalism in Machine Translation that allow to parse a string pair with efficient Dynamic Programming algorithms. The usual parsing algorithms that have been previously defined cannot explore the complete search space. In this work, we propose important modifications that consider the whole search space. We formally prove the correctness of the new algorithm. Experimental work shows important improvements in the probabilistic estimation of the models when using the new algorithm. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gascó, G., Sánchez, J. A., & Benedí, J. M. (2010). Complete search space exploration for SITG inside probability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6218 LNCS, pp. 306–315). https://doi.org/10.1007/978-3-642-14980-1_29
Mendeley helps you to discover research relevant for your work.