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 expressive- ness 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 com- pete with other parsing techniques more efficient a priori.
This work was partially supported by the European Union under FEDER project 1FD97-0047-C04-02, and by the Autonomous Government of Galicia under project PGIDT99XI10502B.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barcala Rodríguez, M. (1999). Diseño e implementación de una herramienta de análisis sintáctico estocástico para el procesamiento de textos en lenguaje natural. Proyecto Fin de Carrera en Ingeniería Informática, dirigido por J. Graña Gil en el Departamento de Computación de la Universidad de A Coruña.
Chappelier, J.-C.; Rajman, M. (1998). A practical bottom-up algorithm for online parsing with stochastic context-free grammars. Rapport Technique 98/284, Departement d’Informatique, Ecole Polytechnique Fédérale de Lausanne (Suisse).
Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, vol. 13(2), pp. 94–102.
Erbach, G. (1994). Bottom-up Earley deduction. In Proceedings of the 14th International Conference on Computational Linguistics (COLING-94), Kyoto (Japan).
Graña Gil, J.; Chappelier, J.-C.; Rajman, M. (1999). Using syntactic constraints in natural language disambiguation. Rapport Technique 99/315, Departement d’Informatique, Ecole Polytechnique Fédérale de Lausanne (Suisse).
Kasami, T. (1965). An efficient recognition and syntax analysis algorithm for context-free languages. Technical Report, AF CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, MA.
Sampson, G. (1994a). The SUSANNE corpus, release 3, 04/04/1994. School of Cognitive & Computing Sciences, University of Sussex, Falmer, Brighton, England.
Sampson, G. (1994b). English for the computer. Oxford University Press.
Younger, D.H. (1967). Recognition of context-free languages in time n 3. Information and Control, vol. 10(2), pp. 189–208.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barcala, FM., Sacristán, O., Graña, J. (2001). Stochastic Parsing and Parallelism. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2001. Lecture Notes in Computer Science, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44686-9_39
Download citation
DOI: https://doi.org/10.1007/3-540-44686-9_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41687-6
Online ISBN: 978-3-540-44686-6
eBook Packages: Springer Book Archive