@inproceedings{obrebski-2003-dependency,
title = "Dependency parsing using dependency graph for storing alternative structures",
author = "Obrebski, Tomasz",
booktitle = "Proceedings of the Eighth International Conference on Parsing Technologies",
month = apr,
year = "2003",
address = "Nancy, France",
url = "https://aclanthology.org/W03-3018",
abstract = "In this paper an efficient algorithm for dependency parsing is described in which ambiguous dependency structure of a sentence is represented in the form of a graph. The idea of the algorithm is shortly outlined and some issues as to its time complexity are discussed.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="obrebski-2003-dependency">
<titleInfo>
<title>Dependency parsing using dependency graph for storing alternative structures</title>
</titleInfo>
<name type="personal">
<namePart type="given">Tomasz</namePart>
<namePart type="family">Obrebski</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2003-04</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Eighth International Conference on Parsing Technologies</title>
</titleInfo>
<originInfo>
<place>
<placeTerm type="text">Nancy, France</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>In this paper an efficient algorithm for dependency parsing is described in which ambiguous dependency structure of a sentence is represented in the form of a graph. The idea of the algorithm is shortly outlined and some issues as to its time complexity are discussed.</abstract>
<identifier type="citekey">obrebski-2003-dependency</identifier>
<location>
<url>https://aclanthology.org/W03-3018</url>
</location>
<part>
<date>2003-04</date>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Dependency parsing using dependency graph for storing alternative structures
%A Obrebski, Tomasz
%S Proceedings of the Eighth International Conference on Parsing Technologies
%D 2003
%8 April
%C Nancy, France
%F obrebski-2003-dependency
%X In this paper an efficient algorithm for dependency parsing is described in which ambiguous dependency structure of a sentence is represented in the form of a graph. The idea of the algorithm is shortly outlined and some issues as to its time complexity are discussed.
%U https://aclanthology.org/W03-3018
Markdown (Informal)
[Dependency parsing using dependency graph for storing alternative structures](https://aclanthology.org/W03-3018) (Obrebski, IWPT 2003)
ACL