A Transition-Based Algorithm for Unrestricted AMR Parsing

David Vilares, Carlos Gómez-Rodríguez


Abstract
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.
Anthology ID:
N18-2023
Volume:
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers)
Month:
June
Year:
2018
Address:
New Orleans, Louisiana
Venue:
NAACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
142–149
Language:
URL:
https://aclanthology.org/N18-2023
DOI:
10.18653/v1/N18-2023
Bibkey:
Cite (ACL):
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.
Cite (Informal):
A Transition-Based Algorithm for Unrestricted AMR Parsing (Vilares & Gómez-Rodríguez, NAACL 2018)
Copy Citation:
PDF:
https://aclanthology.org/N18-2023.pdf
Code
 aghie/tb-amr