Parsing with Traces: An O(n4) Algorithm and a Structural Representation

@article{Kummerfeld2017ParsingWT,
  title={Parsing with Traces: An O(n4) Algorithm and a Structural Representation},
  author={Jonathan K. Kummerfeld and Dan Klein},
  journal={Transactions of the Association for Computational Linguistics},
  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
23
Twitter Mentions

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

Finding Optimal 1-Endpoint-Crossing Trees

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Empty element recovery by spinal parser operations

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Deep Syntactic Processing by Combining Shallow Methods

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL