Semantic Dependency Graph Parsing Using Tree Approximations
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingSimilar Papers 제목 키워드 기반
Maximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs
2015-07-01 · WS 2015 7
· Natalie Schluter
Dependency Parsing
Potsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing
2014-08-01 · SEMEVAL 2014 8
· {\v{Z}}eljko Agi{\'c}, Alex Koller, er
Dependency ParsingSemantic Dependency Parsing
Parsing to Noncrossing Dependency Graphs
2015-01-01 · TACL 2015 1
· Marco Kuhlmann, Peter Jonsson
We study the generalization of maximum spanning tree dependency parsing to maximum acyclic subgraphs. Because the underlying optimization problem is intractable even under an arc-factored model, we consider the restricti…
ARCDependency ParsingSemantic Dependency ParsingGCN-Sem at SemEval-2019 Task 1: Semantic Parsing using Graph Convolutional and Recurrent Neural Networks
2019-06-01 · SEMEVAL 2019 6
· Shiva Taslimipoor, Omid Rohanian, Sara Mo{\v{z}}e
This paper describes the system submitted to the SemEval 2019 shared task 1 {`}Cross-lingual Semantic Parsing with UCCA{'}. We rely on the semantic dependency parse trees provided in the shared task which are converted f…
Dependency ParsingSemantic Dependency ParsingSemantic ParsingCache Transition Systems for Graph Parsing
2018-03-01 · CL 2018 3
· Daniel Gildea, Giorgio Satta, Xiaochang Peng
Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with…
Dependency ParsingSemantic ParsingTransition-Based Dependency ParsingTree Decomposition