Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation

@article{Kummerfeld2017ParsingWT,
  title={Parsing with Traces: An \$O(n^4)\$ Algorithm and a Structural Representation},
  author={Jonathan K. Kummerfeld and Dan Klein},
  journal={TACL},
  year={2017},
  volume={5},
  pages={441-454}
}
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 35 times over the past 90 days. VIEW TWEETS
4 Citations
41 References
Similar Papers

Similar Papers

Loading similar papers…