A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Parsing with Traces: An O(n4) Algorithm and a Structural Representation
2017
Transactions of the Association for Computational Linguistics
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and
doi:10.1162/tacl_a_00072
fatcat:3cv6ajmhmbbvbmmoz43aguxtzy