Mostrar o rexistro simple do ítem
Stochastic parsing and parallelism
dc.contributor.author | Barcala Rodríguez, Francisco Mario | |
dc.contributor.author | Sacristán Agulló, Oscar | |
dc.contributor.author | Graña Gil, Jorge | |
dc.date.accessioned | 2005-10-28T15:43:43Z | |
dc.date.available | 2005-10-28T15:43:43Z | |
dc.date.issued | 2001 | |
dc.identifier.citation | 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. | es_ES |
dc.identifier.isbn | 3-540-41687-0 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://hdl.handle.net/2183/151 | |
dc.description.abstract | [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. | es_ES |
dc.description.sponsorship | European Commission; 1FD97-0047-C04-02 | es_ES |
dc.description.sponsorship | Xunta de Galcia; PGIDT99XI1 | |
dc.format.mimetype | application/postscript | |
dc.format.mimetype | text/plain | |
dc.language.iso | eng | es_ES |
dc.publisher | Springer-Verlag | es_ES |
dc.title | Stochastic parsing and parallelism | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-COLE - Artigos [10]