PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing

Authors:
Alfonso Ortega;Emilio Rosal;Diana Pérez;Robert Mercaş;Alexander Perekrestenko;Manuel Alfonseca
Affiliations:
Dep. Ing. Inf. EPS, Universidad Autónoma de Madrid, Spain;Escuela Politécnica Superior Universidad San Pablo C.E.U, Spain;Dep. Ing. Inf. EPS, Universidad Autónoma de Madrid, Spain;Dept. of Romance Filology, GRLMC, Rovira i Virgili University, Tarragona, Spain;Dept. of Romance Filology, GRLMC, Rovira i Virgili University, Tarragona, Spain;Dep. Ing. Inf. EPS, Universidad Autónoma de Madrid, Spain
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Year:
2009

Citing 10
Cited 0

An efficient context-free parsing algorithm

Communications of the ACM
Periods, capitalized words, etc.

Computational Linguistics
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
TnT: a statistical part-of-speech tagger

ANLC '00 Proceedings of the sixth conference on Applied natural language processing
The Oxford Handbook of Computational Linguistics (Oxford Handbooks in Linguistics S.)

The Oxford Handbook of Computational Linguistics (Oxford Handbooks in Linguistics S.)
On the size complexity of hybrid networks of evolutionary processors

Theoretical Computer Science - Descriptional complexity of formal systems
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Information Processing Letters
Syntax augmented machine translation via chart parsing

StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Hybrid networks of evolutionary processors

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Quantified Score

Hi-index	0.01

Visualization

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.