PNEPs for Shallow Parsing - NEPs Extended for Parsing Applied to Shallow Parsing

PNEPs (Parsing Networks of Evolutionary Processors) extend NEPs with context free (instead of substituting) rules, leftmost derivation, bad terminals check and indexes to rebuild the derivation tree. It is possible to build a PNEP from any context free grammar without additional constraints, able to generate all the different derivations for ambiguous grammars with a temporal performance bound by the depth of the derivation tree. One of the main difficulties encountered by parsing techniques when building complete parsing trees for natural languages is the spatial and temporal performance of the analysis. Shallow parsing tries to overcome these difficulties. The goal of shallow parsing is to analyze the main components of the sentences (for example, noun groups, verb groups, etc.) rather than complete sentences. The current paper is mainly focused on testing the suitability of PNEPs to shallow parsing.

[1]  Gheorghe Paun,et al.  DNA Computing , 1998, Texts in Theoretical Computer Science.

[2]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[3]  Victor Mitrana,et al.  Solving NP-Complete Problems With Networks of Evolutionary Processors , 2001, IWANN.

[4]  Victor Mitrana,et al.  On the size complexity of hybrid networks of evolutionary processors , 2005, Theor. Comput. Sci..

[5]  Victor Mitrana,et al.  Evolutionary systems: a language generating device inspired by evolving communities of cells , 2000, Acta Informatica.

[6]  Gemma Bel-Enguix,et al.  NETWORKS OF EVOLUTIONARY PROCESSORS AS NATURAL LANGUAGE PARSERS , 2008 .

[7]  Erzsébet Csuhaj-Varjú,et al.  Networks of Parallel Language Processors , 1997, New Trends in Formal Languages.

[8]  Victor Mitrana,et al.  Networks of evolutionary processors , 2003, Acta Informatica.

[9]  Ashish Choudhury,et al.  Network of Evolutionary Processors with Splicing Rules , 2005, IWINAC.

[10]  Victor Mitrana,et al.  Hybrid Networks of Evolutionary Processors , 2003, GECCO.

[11]  Victor Mitrana,et al.  Accepting Hybrid Networks of Evolutionary Processors , 2004, DNA.

[12]  Gheorghe Paun,et al.  Grammar Systems , 1997, Handbook of Formal Languages.

[13]  Alfonso Ortega,et al.  Simulating NEPs in a cluster with jNEP , 2008 .

[14]  Zellig S. Harris,et al.  String Analysis Of Sentence Structure , 1965 .

[15]  Ingrid Fischer,et al.  Parsing String Generating Hypergraph Grammars , 2004, ICGT.

[16]  Andreas Zollmann,et al.  Syntax Augmented Machine Translation via Chart Parsing , 2006, WMT@HLT-NAACL.

[17]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[18]  Luciano De Errico,et al.  Towards a new architecture for symbolic processing , 1995 .

[19]  Diana Pérez,et al.  PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing , 2009, IWANN.

[20]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[21]  W. N. Locke,et al.  Machine Translation of Languages: Fourteen Essays , 1955 .

[22]  Victor Mitrana,et al.  All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size , 2007, Inf. Process. Lett..