Advertisement
Published in:
2009 | OriginalPaper | Chapter
PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing
Authors : Alfonso Ortega, Emilio del Rosal, Diana Pérez, Robert Mercaş, Alexander Perekrestenko, Manuel Alfonseca
Published in: Bio-Inspired Systems: Computational and Ambient Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.