Stochastic parsing and parallelism
Ver/ abrir
Use este enlace para citar
http://hdl.handle.net/2183/151Coleccións
- GI-COLE - Artigos [10]
Metadatos
Mostrar o rexistro completo do ítemTítulo
Stochastic parsing and parallelismData
2001Cita bibliográfica
Proceedings 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.
Resumo
[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.
ISSN
0302-9743
ISBN
3-540-41687-0