PNEPs, NEPs for context free parsing: Application to natural language processing

Biblos-e Archivo/Manakin Repository

Show simple item record

dc.contributor.author Ortega, Alfonso
dc.contributor.author Rosal García, Emilio del
dc.contributor.author Pérez Marín, Diana
dc.contributor.author Mercaş, Robert
dc.contributor.author Perekrestenko, Alexander
dc.contributor.author Alfonseca, Manuel
dc.contributor.other UAM. Departamento de Ingeniería Informática es_ES
dc.date.accessioned 2015-02-26T14:09:49Z
dc.date.available 2015-02-26T14:09:49Z
dc.date.issued 2009
dc.identifier.citation Bio-Inspired Systems: Computational and Ambient Intelligence: 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain, June 10-12, 2009. Proceedings, Part I. Lecture Notes in Computer Science, Volumen 5517. Springer, 2009. 472-479 en_US
dc.identifier.isbn 978-3-642-02477-1 (print) en_US
dc.identifier.isbn 978-3-642-02478-8 (online) en_US
dc.identifier.issn 0302-9743 (print) en_US
dc.identifier.issn 1611-3349 (online) en_US
dc.identifier.uri http://hdl.handle.net/10486/664094
dc.description The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-02478-8_59 en_US
dc.description Proceedings of 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain. en_US
dc.description.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 en_US
dc.description.sponsorship This work was partially supported by MEC, project TIN2008-02081/TIN and by DGUI CAM/UAM, project CCG08-UAM/TIC-4425. en_US
dc.format.extent 9 pág. es_ES
dc.format.mimetype application/pdf en
dc.language.iso eng en
dc.publisher Springer Berlin Heidelberg en_US
dc.relation.ispartof Lecture Notes in Computer Science en_US
dc.rights © Springer-Verlag Berlin Heidelberg 2009 en_US
dc.subject.other Computational Biology en_US
dc.subject.other Bioinformatics en_US
dc.subject.other Pattern Recognition en_US
dc.subject.other Artificial Intelligence en_US
dc.subject.other Data Mining en_US
dc.subject.other Knowledge Discovery en_US
dc.title PNEPs, NEPs for context free parsing: Application to natural language processing en_US
dc.type conferenceObject en
dc.type bookPart en_US
dc.subject.eciencia Informática es_ES
dc.relation.publisherversion http://dx.doi.org/978-3-642-02478-8
dc.identifier.doi 10.1007/978-3-642-02478-8_59
dc.identifier.publicationfirstpage 472
dc.identifier.publicationlastpage 479
dc.identifier.publicationvolume 5517
dc.relation.eventdate June 10-12, 2009 en_US
dc.relation.eventnumber 10
dc.relation.eventplace Salamanca (Spain) en_US
dc.relation.eventtitle 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 en_US
dc.type.version info:eu-repo/semantics/acceptedVersion en
dc.contributor.group Herramientas Interactivas Avanzadas (ING EPS-003) es_ES
dc.rights.accessRights openAccess en
dc.authorUAM Alfonseca Moreno, Manuel (258923)
dc.authorUAM Pérez Marín, Diana Rosario (260499)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record