Robust Subgraph Generation Improves Abstract Meaning Representation Parsing
The Abstract Meaning Representation (AMR) is a representation for open-domain rich semantics, with potential use in fields like event extraction and machine translation. Node generation, typically done using a simple dictionary lookup, is currently an important limiting factor in AMR parsing. We propose a small set of actions that derive AMR subgraphs by transformations on spans of text, which allows for more robust learning of this stage. Our set of construction actions generalize better than the previous approach, and can be learned with a simple classifier. We improve on the previous state-of-the-art result for AMR parsing, boosting end-to-end performance by 3 F$_1$ on both the LDC2013E117 and LDC2014T12 datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Abstract Meaning RepresentationAMR ParsingEvent ExtractionMachine TranslationTranslationSimilar Papers 제목 키워드 기반
Biomedical Event Extraction using Abstract Meaning Representation
We propose a novel, Abstract Meaning Representation (AMR) based approach to identifying molecular events/interactions in biomedical text. Our key contributions are: (1) an empirical validation of our hypothesis that an e…
Abstract Meaning RepresentationEvent ExtractionGuided Neural Language Generation for Abstractive Summarization using Abstract Meaning Representation
Recent work on abstractive summarization has made progress with neural encoder-decoder architectures. However, such models are often challenged due to their lack of explicit semantic modeling of the source document and i…
Abstractive Text SummarizationAbstract Meaning RepresentationDecoderText GenerationMulti-Relational Graph Transformer for Automatic Short Answer Grading
The recent transition to the online educational domain has increased the need for Automatic Short Answer Grading (ASAG). ASAG automatically evaluates a student’s response against a (given) correct response and thus has b…
Abstract Meaning Representationautomatic short answer gradingSentenceA Differentiable Relaxation of Graph Segmentation and Alignment for AMR Parsing
Abstract Meaning Representations (AMR) are a broad-coverage semantic formalism which represents sentence meaning as a directed acyclic graph. To train most AMR parsers, one needs to segment the graph into subgraphs and a…
AMR ParsingSegmentationSentenceGenerative Subgraph Retrieval for Knowledge Graph-Grounded Dialog Generation
Knowledge graph-grounded dialog generation requires retrieving a dialog-relevant subgraph from the given knowledge base graph and integrating it with the dialog history. Previous works typically represent the graph using…
InformativenessRetrievalvalid