@article{satta-kuhlmann-2013-efficient,
    title = "Efficient Parsing for Head-Split Dependency Trees",
    author = "Satta, Giorgio  and
      Kuhlmann, Marco",
    editor = "Lin, Dekang  and
      Collins, Michael",
    journal = "Transactions of the Association for Computational Linguistics",
    volume = "1",
    year = "2013",
    address = "Cambridge, MA",
    publisher = "MIT Press",
    url = "https://preview.aclanthology.org/jlcl-multiple-ingestion/Q13-1022/",
    doi = "10.1162/tacl_a_00226",
    pages = "267--278",
    abstract = "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."
}