arXiv:2106.06002
공식 코드 · Papers with Code
Probabilistic, Structure-Aware Algorithms for Improved Variety, Accuracy, and Coverage of AMR Alignments
원문 초록
We present algorithms for aligning components of Abstract Meaning Representation (AMR) graphs to spans in English sentences. We leverage unsupervised learning in combination with heuristics, taking the best of both worlds from previous AMR aligners. Our unsupervised models, however, are more sensitive to graph substructures, without requiring a separate syntactic parse. Our approach covers a wider variety of AMR substructures than previously considered, achieves higher coverage of nodes and edges, and does so with higher accuracy. We will release our LEAMR datasets and aligner for use in research on AMR parsing, generation, and evaluation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Reassessing Graph Linearization for Sequence-to-sequence AMR Parsing: On the Advantages and Limitations of Triple-Based Encoding
AMR Parsing is Far from Solved: GrAPES, the Granular AMR Parsing Evaluation Suite
Guiding AMR Parsing with Reverse Graph Linearization
Incorporating Graph Information in Transformer-based AMR Parsing
Cross-domain Generalization for AMR Parsing
Inducing and Using Alignments for Transition-based AMR Parsing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.