Abstract
This work tests the suitability of NEPs to parse languages. We propose PNEP, a simple extension to NEP, and a procedure to translate a grammar into a PNEP that recognizes the same language. These parsers based on NEPs do not impose any additional constrain to the structure of the grammar, which can contain all kinds of recursive, lambda or ambiguous rules. This flexibility makes this procedure specially suited for Natural Languge Processing (NLP). In a first proof with a simplified English grammar, we got a performance (a linear time complexity) similar to that of the most popular syntactic parsers in the NLP area (Early and its derivatives). All the possible derivations for ambiguous grammars were generated.
This work was partially supported by MEC, project TIN2008-02081/TIN and by DGUI CAM/UAM, project CCG08-UAM/TIC-4425.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Volk, M.: Introduction to Natural Language Processing, Course CMSC 723 / LING 645 in the Stockholm University, Sweden (2004)
Weaver, W. (55), Translation, Machine Translation of Languages: Fourteen Essays, 15–23
Mitkov, R.: The Oxford Handbook of Computational Linguistics. Oxford University Press, Oxford (2003)
Mikheev, A.: Periods, capitalized words, etc. Computational Linguistics 28(3), 289–318 (2002)
Alfonseca, E.: An Approach for Automatic Generation of on-line Information Systems based on the Integration of Natural Language Processing and Adaptive Hypermedia techniques, PhD thesis, Computer Science Department, UAM (2003)
Brants, T.: TnT–a statistical part-of-speech tagger. In: Proceedings of the 6th Conference on Applied Natural Language Processing, pp. 224–231 (2000)
Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13(2), 94–102 (1970)
Seifert, S., Fischer, I.: Parsing String Generating Hypergraph Grammars, pp. 352–367. Springer, Heidelberg (2004)
Zollmann, A., Venugopal, A.: Syntax augmented machine translation via chart parsing. In: Proccedings of the Workshop on Statistic Machine Translation, HLT/NAACL, New York (June 2006)
Gomez, C., Javier, F., Valle Agudo, D., Rivero Espinosa, J., Cuadra Fernandez, D.: Methodological approach for pragmatic annotation. Procesamiento del lenguaje Natural, 209–216 (2008)
Csuhaj-Varju, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218. Springer, Heidelberg (1997)
Csuhaj-Varju, E., Mitrana, V.: Evolutionary systems:a language generating device inspired by evolving communities of cells. Acta Informatica 36 (2000)
Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.M.: Solving np-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 621–628. Springer, Heidelberg (2001)
Castellanos, J., Leupold, P., Mitrana, V.: On the size complexity of HNEPs. Theoretical Computer Science 330(2), 205–220 (2005)
Manea, F.: Using ahneps in the recognition of context-free languages. In: Proceedings of the Workshop on Symbolic Networks, ECAI 2004 (2004)
Manea, F., Mitrana, V.: All np-problems can be solved in polynomial time by AHNEPs of constant size. Inf. Process. Lett. 103(3), 112–118 (2007)
Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary processors. In: Pre-proceedings of DNA, vol. 10, pp. 107–117 (2004)
Martin-Vide, C., Mitrana, V., Perez-Jimenez, M., Sancho-Caparrini, F.: Hybrid networks of evolutionary processors. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 401–412. Springer, Heidelberg (2003)
Bel Enguix, G., Jimenez-Lopez, M.D., Mercaş, R., Perekrestenko, A.: Networks of evolutionary processors as natural language parsers. In: Proc. ICAART (2009)
del Nuez, E., Castaeda, R., Ortega, C.: Simulating NEPs in a cluster with jNEP. In: Proceedings of International Conference on Computers, Communications and Control, ICCCC 2008 (2008)
Csuhaj-Varju, E., Martin Vide, C., Mitrana, V.: HNEPs are Computationally Complete. Acta Informatica
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ortega, A., del Rosal, E., Pérez, D., Mercaş, R., Perekrestenko, A., Alfonseca, M. (2009). PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02478-8_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-02478-8_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02477-1
Online ISBN: 978-3-642-02478-8
eBook Packages: Computer ScienceComputer Science (R0)