Mostrar o rexistro simple do ítem
A Transition-Based Algorithm for Unrestricted AMR Parsing
| dc.contributor.author | Vilares, David | |
| dc.contributor.author | Gómez-Rodríguez, Carlos | |
| dc.date.accessioned | 2024-05-29T12:33:12Z | |
| dc.date.available | 2024-05-29T12:33:12Z | |
| dc.date.issued | 2018-06 | |
| dc.identifier.citation | David Vilares and Carlos Gómez-Rodríguez. 2018. A Transition-Based Algorithm for Unrestricted AMR Parsing. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers), pages 142–149, New Orleans, Louisiana. Association for Computational Linguistics. | es_ES |
| dc.identifier.uri | http://hdl.handle.net/2183/36705 | |
| dc.description | The Conference was held in New Orleans, June 1 to June 6, 2018 at the Hyatt Regency New Orleans hotel. | es_ES |
| dc.description.abstract | [Absctract]: Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, an oracle decides whether to create a concept or whether to connect a pair of existing concepts. The algorithm handles reentrancy and arbitrary cycles natively, i.e. within the transition system itself. The model is evaluated on the LDC2015E86 corpus, obtaining results close to the state of the art, including a Smatch of 64%, and showing good behavior on reentrant edges. | es_ES |
| dc.description.sponsorship | This work is funded from the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), from the TELEPARES-UDC project (FFI2014- 51978-C2-2-R) and the ANSWER-ASAP project (TIN2017-85160-C2-1-R) from MINECO, and from Xunta de Galicia (ED431B 2017/01). We gratefully acknowledge NVIDIA Corporation for the donation of a GTX Titan X GPU. | es_ES |
| dc.description.sponsorship | Xunta de Galicia; ED431B 2017/01 | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Association for Computational Linguistics | es_ES |
| dc.relation | info:eu-repo/grantAgreement/EC/H2020/714150 | es_ES |
| dc.relation | info:eu-repo/grantAgreement/MINECO/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/FFI2014-51978-C2-2-R/ES/TECNOLOGÍAS DE LA LENGUA PARA ANÁLISIS DE OPINIONES EN REDES SOCIALES: DEL TEXTO AL MICROTEXTO | es_ES |
| dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2017-85160-C2-1-R/ES/AVANCES EN NUEVOS SISTEMAS DE EXTRACCION DE RESPUESTAS CON ANALISIS SEMANTICO Y APRENDIZAJE PROFUNDO | es_ES |
| dc.relation.uri | https://aclanthology.org/N18-2023/ | es_ES |
| dc.rights | Atribución 3.0 España | es_ES |
| dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
| dc.subject | Transition-Based Algorithm | es_ES |
| dc.subject | Unrestricted AMR parsing | es_ES |
| dc.subject | Covington parsing algorithm | es_ES |
| dc.subject | Non-Projective Parsing | es_ES |
| dc.subject | Reentrancy Handling | es_ES |
| dc.title | A Transition-Based Algorithm for Unrestricted AMR Parsing | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
| UDC.journalTitle | Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) | es_ES |
| UDC.startPage | 142 | es_ES |
| UDC.endPage | 149 | es_ES |
| UDC.conferenceTitle | 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL HLT) | es_ES |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
OpenAIRE [294]
-
GI-LYS - Congresos, conferencias, etc. [59]
