Barcala Rodríguez, Francisco MarioSacristán Agulló, OscarGraña Gil, Jorge2005-10-282005-10-282001Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing (CICLING-2001), Ciudad de Méjico (Méjico). Gelbukh, A. (ed.).Lecture Notes in Computer Science, vol. 2004, pp. 401-410.3-540-41687-00302-9743http://hdl.handle.net/2183/151[Abstract] Parsing CYK-like algorithms are inherently parallel: there are a lot of cells in the chart that can be calculated simultaneously. In this work, we present a study on the appropriate techniques of paralle-lism to obtain an optimal performance of the extended CYK algorithm, a stochastic parsing algorithm that preserves the same level of expressiveness as the one in the original grammar, and improves further tasks of robust parsing. We consider two methods of parallelization: distributed memory and shared memory. The excellent performance obtained with the second one turns this algorithm into an alternative that could compete with other parsing techniques more efficient a priori.application/postscripttext/plainengjournal articleopen access