Efficient Parsing for Head-Split Dependency Trees
Head splitting techniques have been successfully exploited to improve the asymptotic runtime of parsing algorithms for projective dependency trees, under the arc-factored model. In this article we extend these techniques to a class of non-projective dependency trees, called well-nested dependency trees with block-degree at most 2, which has been previously investigated in the literature. We define a structural property that allows head splitting for these trees, and present two algorithms that improve over the runtime of existing algorithms at no significant loss in coverage.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCDependency ParsingSimilar Papers 제목 키워드 기반
A Dependency Perspective on RST Discourse Parsing and Evaluation
Computational text-level discourse analysis mostly happens within Rhetorical Structure Theory (RST), whose structures have classically been presented as constituency trees, and relies on data from the RST Discourse Treeb…
Constituency ParsingDependency ParsingDiscourse ParsingTop-Down RST Parsing Utilizing Granularity Levels in Documents
Some downstream NLP tasks exploit discourse dependency trees converted from RST trees. To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures. Thus,…
Discourse ParsingRelationParsing as Reduction
We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding ord…
Dependency ParsingHead-Driven Phrase Structure Grammar Parsing on Penn Treebank
Head-driven phrase structure grammar (HPSG) enjoys a uniform formalism representing rich contextual syntactic and even semantic meanings. This paper makes the first attempt to formulate a simplified HPSG by integrating c…
Constituency ParsingDecoderDependency ParsingCombining (second-order) graph-based and headed-span-based projective dependency parsing
Graph-based methods, which decompose the score of a dependency tree into scores of dependency arcs, are popular in dependency parsing for decades. Recently, \citet{Yang2022Span} propose a headed-span-based method that de…
ARCDependency Parsing