Robust Incremental Neural Semantic Graph Parsing
Parsing sentences to linguistically-expressive semantic representations is a key goal of Natural Language Processing. Yet statistical parsing has focused almost exclusively on bilexical dependencies or domain-specific logical forms. We propose a neural encoder-decoder transition-based parser which is the first full-coverage semantic graph parser for Minimal Recursion Semantics (MRS). The model architecture uses stack-based embedding features, predicting graphs jointly with unlexicalized predicates and their token alignments. Our parser is more accurate than attention-based baselines on MRS, and on an additional Abstract Meaning Representation (AMR) benchmark, and GPU batch processing makes it an order of magnitude faster than a high-precision grammar-based parser. Further, the 86.69% Smatch score of our MRS parser is higher than the upper-bound on AMR parsing, making MRS an attractive choice as a semantic representation.
Code (1)
Tasks
Abstract Meaning RepresentationAMR ParsingDecoderGPUSimilar Papers 제목 키워드 기반
A Double-Graph Based Framework for Frame Semantic Parsing
Frame semantic parsing is a fundamental NLP task, which consists of three subtasks: frame identification, argument identification and role classification. Most previous studies tend to neglect relations between different…
graph constructionSemantic ParsingA Double-Graph Based Framework for Frame Semantic Parsing
Frame semantic parsing is a fundamental NLP task, which consists of three subtasks: frame identification, argument identification and role classification. Most previous studies tend to neglect relations between different…
graph constructionSemantic ParsingCore Semantic First: A Top-down Approach for AMR Parsing
We introduce a novel scheme for parsing a piece of text into its Abstract Meaning Representation (AMR): Graph Spanning based Parsing (GSP). One novel characteristic of GSP is that it constructs a parse graph incrementall…
Abstract Meaning RepresentationAMR ParsingSentenceType-Driven Incremental Semantic Parsing with Polymorphism
Semantic parsing has made significant progress, but most current semantic parsers are extremely slow (CKY-based) and rather primitive in representation. We introduce three new techniques to tackle these problems. First, …
Semantic ParsingVocal Bursts Type Prediction