@inproceedings{plaehn-2000-computing,
    title = "Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar",
    author = "Plaehn, Oliver",
    editor = "Lavelli, Alberto  and
      Carroll, John  and
      Berwick, Robert C.  and
      Bunt, Harry C.  and
      Carpenter, Bob  and
      Carroll, John  and
      Church, Ken  and
      Johnson, Mark  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Lavie, Alon  and
      Nijholt, Anton  and
      Samuelsson, Christer  and
      Steedman, Mark  and
      Stock, Oliviero  and
      Tanaka, Hozumi  and
      Tomita, Masaru  and
      Uszkoreit, Hans  and
      Vijay-Shanker, K.  and
      Weir, David  and
      Wiren, Mats",
    booktitle = "Proceedings of the Sixth International Workshop on Parsing Technologies",
    month = feb # " 23-25",
    year = "2000",
    address = "Trento, Italy",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/2000.iwpt-1.20/",
    pages = "195--206",
    abstract = "This paper presents a probabilistic extension of Discontinuous Phrase Structure Grammar (DPSG), a formalism designed to describe discontinuous constituency phenomena adequately and perspicuously by means of trees with crossing branches. We outline an implementation of an agenda-based chart parsing algorithm that is capable of computing the Most Probable Parse for a given input sentence for probabilistic versions of both DPSG and Context-Free Grammar. Experiments were conducted with both types of grammars extracted from the NEGRA corpus. In spite of the much greater complexity of DPSG parsing in terms of the number of (partial) analyses that can be constructed for an input sentence, accuracy results from both experiments are comparable. We also briefly hint at future lines of research aimed at more efficient ways of probabilistic parsing with discontinuous constituents."
}