Compositional Semantic Parsing Across Graphbanks
Most semantic parsers that map sentences to graph-based meaning representations are hand-designed for specific graphbanks. We present a compositional neural semantic parser which achieves, for the first time, competitive accuracies across a diverse range of graphbanks. Incorporating BERT embeddings and multi-task learning improves the accuracy further, setting new states of the art on DM, PAS, PSD, AMR 2015 and EDS.
Code (1)
Tasks
Multi-Task LearningSemantic ParsingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning compositional structures for semantic graph parsing
AM dependency parsing is a method for neural semantic graph parsing that exploits the principle of compositionality. While AM dependency parsers have been shown to be fast and accurate across several graphbanks, they req…
Dependency ParsingSaarland at MRP 2019: Compositional parsing across all graphbanks
We describe the Saarland University submission to the shared task on Cross-Framework Meaning Representation Parsing (MRP) at the 2019 Conference on Computational Natural Language Learning (CoNLL).
AllNormalizing Compositional Structures Across Graphbanks
The emergence of a variety of graph-based meaning representations (MRs) has sparked an important conversation about how to adequately represent semantic structure. These MRs exhibit structural differences that reflect di…
Multi-Task LearningSemantic ParsingFast semantic parsing with well-typedness guarantees
AM dependency parsing is a linguistically principled method for neural semantic parsing with high accuracy across multiple graphbanks. It relies on a type system that models semantic valency but makes existing parsers sl…
Dependency ParsingSemantic ParsingCompositional Generalization via Semantic Tagging
Although neural sequence-to-sequence models have been successfully applied to semantic parsing, they fail at compositional generalization, i.e., they are unable to systematically generalize to unseen compositions of seen…
Semantic ParsingTAG