@inproceedings{plaehn-2000-computing,
title = "Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar",
author = "Plaehn, Oliver",
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://aclanthology.org/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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="plaehn-2000-computing">
<titleInfo>
<title>Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar</title>
</titleInfo>
<name type="personal">
<namePart type="given">Oliver</namePart>
<namePart type="family">Plaehn</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2000-feb" 23-25"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Trento, Italy</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<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.</abstract>
<identifier type="citekey">plaehn-2000-computing</identifier>
<location>
<url>https://aclanthology.org/2000.iwpt-1.20</url>
</location>
<part>
<date>2000-feb" 23-25"</date>
<extent unit="page">
<start>195</start>
<end>206</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar
%A Plaehn, Oliver
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F plaehn-2000-computing
%X 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.
%U https://aclanthology.org/2000.iwpt-1.20
%P 195-206
Markdown (Informal)
[Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar](https://aclanthology.org/2000.iwpt-1.20) (Plaehn, IWPT 2000)
ACL