AMR Parsing with Action-Pointer Transformer
Abstract Meaning Representation parsing belongs to a category of sentence-to-graph prediction tasks where the target graph is not explicitly linked to the sentence tokens. However, nodes or subgraphs are semantically related to subsets of the sentence tokens, and locality between words and related nodes is often preserved. Transition-based approaches have recently shown great progress in capturing these inductive biases but still suffer from limited expressiveness. In this work we propose a transition-based system that combines hard-attention over sentences with a target-side action pointer mechanism to decouple source tokens from node representations. We model the transitions as well as the pointer mechanism using a single Transformer model. Parser state and graph structure information is efficiently encoded using attention heads. We show that our approach leads to increased expressiveness while capitalizing inductive biases and attains new state-of-the Smatch scores on AMR 1.0 (78.5) and AMR 2.0 (81.8).
Code (0)
등록된 구현이 없습니다.
Tasks
Abstract Meaning RepresentationAMR ParsingHard AttentionSentenceSimilar Papers 제목 키워드 기반
AMR Parsing with Action-Pointer Transformer
Abstract Meaning Representation parsing is a sentence-to-graph prediction task where target nodes are not explicitly aligned to sentence tokens. However, since graph nodes are semantically based on one or more sentence t…
Abstract Meaning RepresentationAMR ParsingHard AttentionInductive Bias+1Context Transformer with Stacked Pointer Networks for Conversational Question Answering over Knowledge Graphs
Neural semantic parsing approaches have been widely used for Question Answering (QA) systems over knowledge graphs. Such methods provide the flexibility to handle QA datasets with complex queries and a large number of en…
Conversational Question AnsweringKnowledge GraphsLogical ReasoningQuestion Answering+1Self Attended Stack-Pointer Networks for Learning Long Term Dependencies
We propose a novel deep neural architecture for dependency parsing, which is built upon a Transformer Encoder (Vaswani et al. 2017) and a Stack Pointer Network (Ma et al. 2018). We first encode each sentence using a Tran…
Dependency ParsingSentenceAMR Parsing with Causal Hierarchical Attention and Pointers
Translation-based AMR parsers have recently gained popularity due to their simplicity and effectiveness. They predict linearized graphs as free texts, avoiding explicit structure modeling. However, this simplicity neglec…
AMR ParsingDecoderTranslationHierarchical Pointer Net Parsing
Transition-based top-down parsing with pointer networks has achieved state-of-the-art results in multiple parsing tasks, while having a linear time complexity. However, the decoder of these parsers has a sequential struc…
DecoderDiscourse ParsingInductive BiasSentence