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

Alfonso Ortega, Emilio del Rosal, Diana Pérez, Robert Mercaş, Alexander Perekrestenko, Manuel Alfonseca
2009 Lecture Notes in Computer Science  
Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription 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
more » ... 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.
doi:10.1007/978-3-642-02478-8_59 fatcat:xw2jwhaqlvdanbu5bzli4konje