Young-Suk Lee, Jiawei Zhou, Salim Roukos, Tahira Naseem, Ramón Fernandez, Radu Florian
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Predicting linearized Abstract Meaning Representation (AMR) graphs using pre-trained sequence-to-sequence Transformer models has recently led to large improvements on AMR parsing benchmarks. These parsers are simple and avoid explicit modeling of structure but lack desirable properties such as graph well-formedness guarantees or built-in graph-sentence alignments. In this work we explore the integration of general pre-trained sequence-to-sequence language models and a structure-aware transition-based approach. We depart from a pointer-based transition system and propose a simplified transition set, designed to better exploit pre-trained language models for structured fine-tuning. We also explore modeling the parser state within the pre-trained encoder-decoder architecture and different vocabulary strategies for the same purpose. We provide a detailed comparison with recent progress in AMR parsing and show that the proposed parser retains the desirable properties of previous transition-based approaches, while being simpler and reaching the new parsing state of the art for AMR 2.0, without the need for graph re-categorization.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2110.15534")
get_code_for_paper("2110.15534")
have("2110.15534")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2110.15534.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2110.15534)
Connect an agent — have() is free.