A Transition-Based Directed Acyclic Graph Parser for UCCA
We present the first parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for existing parsing techniques, as it exhibits reentrancy (resulting in DAG structures), discontinuous structures and non-terminal nodes corresponding to complex semantic units. To our knowledge, the conjunction of these formal properties is not supported by any existing parser. Our transition-based parser, which uses a novel transition set and features based on bidirectional LSTMs, has value not just for UCCA parsing: its ability to handle more general graph structures can inform the development of parsers for other semantic DAG structures, and in languages that frequently use discontinuous structures.
Code (1)
Tasks
Semantic ParsingUCCA ParsingSimilar Papers 제목 키워드 기반
T\"upa at SemEval-2019 Task1: (Almost) feature-free Semantic Parsing
Our submission for Task 1 {`}Cross-lingual Semantic Parsing with UCCA{'} at SemEval-2018 is a feed-forward neural network that builds upon an existing state-of-the-art transition-based directed acyclic graph parser. We r…
AllData AugmentationSemantic ParsingWord EmbeddingsHIT-SCIR at MRP 2020: Transition-based Parser and Iterative Inference Parser
This paper describes our submission system (HIT-SCIR) for the CoNLL 2020 shared task: Cross-Framework and Cross-Lingual Meaning Representation Parsing. The task includes five frameworks for graph-based meaning representa…
CUHK at MRP 2019: Transition-Based Parser with Cross-Framework Variable-Arity Resolve Action
This paper describes our system (RESOLVER) submitted to the CoNLL 2019 shared task on Cross-Framework Meaning Representation Parsing (MRP). Our system implements a transition-based parser with a directed acyclic graph (D…
Transition-based Semantic Dependency Parsing with Pointer Networks
Transition-based parsers implemented with Pointer Networks have become the new state of the art in dependency parsing, excelling in producing labelled syntactic trees and outperforming graph-based models in this task. In…
Dependency ParsingSemantic Dependency ParsingWord EmbeddingsUniversal Dependency Parsing with a General Transition-Based DAG Parser
This paper presents our experiments with applying TUPA to the CoNLL 2018 UD shared task. TUPA is a general neural transition-based DAG parser, which we use to present the first experiments on recovering enhanced dependen…
Dependency Parsing