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 parallelism 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. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Barcala, F. M., Sacristán, O., & Graña, J. (2001). Stochastic parsing and parallelism. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 401–410. https://doi.org/10.1007/3-540-44686-9_39
Mendeley helps you to discover research relevant for your work.