Gibbs Sampling with Treeness constraint in Unsupervised Dependency Parsing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10107947" target="_blank" >RIV/00216208:11320/11:10107947 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Gibbs Sampling with Treeness constraint in Unsupervised Dependency Parsing
Original language description
This paper presents a work in progress on the task of unsupervised parsing, following the main stream approach of optimizing the overall probability of the corpus. We evaluate a sequence of experiments for Czech with various modifications of corpus initiation, of dependency edge probability model and of sampling procedure, stressing especially the treeness constraint. The best configuration is then applied to 19 languages from CoNLL-2006 and CoNLL-2007 shared tasks. Our best achieved results are comparable to the state of the art in dependency parsing and outperform the previously published results for many languages.
Czech name
—
Czech description
—

Project
<a href="/en/project/GD201%2F09%2FH057" target="_blank" >GD201/09/H057: Res Informatica</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Robust Unsupervised and Semisupervised Methods in Natural Language Processing
ISBN
978-954-452-017-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
1-8
Publisher name
Incoma
Place of publication
Šumen, Bulgaria
Event location
Hisarja, Bulgaria
Event date
Sep 12, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)