Transition-Based Chinese Semantic Dependency Graph Parsing
نویسندگان
چکیده
Chinese semantic dependency graph is extended from semantic dependency tree, which uses directed acyclic graphs to capture richer latent semantics of sentences. In this paper, we propose two approaches for Chinese semantic dependency graph parsing. In the first approach, we build a non-projective transition-based dependency parser with the Swap-based algorithm. Then we use a classifier to add arc candidates generated by rules to the tree, forming a graph. In the second approach, we build a transition-based graph parser directly using a variant of the list-based transition system. For both approaches, neural networks are adopted to represent the parsing states. Both approaches yield significantly better results than the top systems in the SemEval-2016 Task 9: Chinese Semantic Dependency Parsing.
منابع مشابه
IHS-RD-Belarus at SemEval-2016 Task 9: Transition-based Chinese Semantic Dependency Parsing with Online Reordering and Bootstrapping
This paper is a description of our system developed for SemEval-2016 Task 9: Chinese Semantic Dependency Parsing. We have built a transition-based dependency parser with online reordering, which is not limited to a tree structure and can produce 99.7% of the necessary dependencies while maintaining linear algorithm complexity. To improve parsing quality we used additional techniques such as pre...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملA Tale of Two Parsers: investigating and combining graph-based and transition-based dependency parsing using beam-search
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...
متن کاملA Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of beamsearch. By developing a graph-based and a transition-based dependency parser, we show that a beam-search decoder is a competitive choice for both methods. More importantly, we propose ...
متن کاملAlpage: Transition-based Semantic Graph Parsing with Syntactic Features
This paper describes the systems deployed by the ALPAGE team to participate to the SemEval-2014 Task on Broad-Coverage Semantic Dependency Parsing. We developed two transition-based dependency parsers with extended sets of actions to handle non-planar acyclic graphs. For the open track, we worked over two orthogonal axes – lexical and syntactic – in order to provide our models with lexical and ...
متن کامل