PTB Graph Parsing with Tree Approximation
The Penn Treebank (PTB) represents syntactic structures as graphs due to nonlocal dependencies. This paper proposes a method that approximates PTB graph-structured representations by trees. By our approximation method, we can reduce nonlocal dependency identification and constituency parsing into single tree-based parsing. An experimental result demonstrates that our approximation method with an off-the-shelf tree-based constituency parser significantly outperforms the previous methods in nonlocal dependency identification.
Code (1)
Tasks
Constituency ParsingSimilar Papers 제목 키워드 기반
Maximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs
Semantic Dependency Graph Parsing Using Tree Approximations
Copenhagen-Malm\"o: Tree Approximations of Semantic Parsing Problems
Global Greedy Dependency Parsing
Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacki…
ARCDependency ParsingRe-RankingSentenceDependency parsing with structure preserving embeddings
Modern neural approaches to dependency parsing are trained to predict a tree structure by jointly learning a contextual representation for tokens in a sentence, as well as a head{--}dependent scoring function. Whereas th…
Dependency ParsingSentence