Dealing with Function Words in Unsupervised Dependency Parsing

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

Result language
angličtina
Original language name
Dealing with Function Words in Unsupervised Dependency Parsing
Original language description
In this paper, we show some properties of function words in dependency trees. Function words are grammatical words, such as articles, prepositions, pronouns, conjunctions, or auxiliary verbs. These words are often short and very frequent in texts and therefore many of them can be easily recognized. We formulate a hypothesis that function words tend to have a fixed number of dependents and we prove this hypothesis on treebanks. Using this hypothesis, we are able to improve unsupervised dependency parsingand outperform previously published state-of-the-art results for many languages.
Czech name
—
Czech description
—

Project
<a href="/en/project/GP14-06548P" target="_blank" >GP14-06548P: Sentence structure induction without annotated corpora</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
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
15th International Conference on Computational Linguistics and Intelligent Text Processing
ISBN
978-3-642-54905-2
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
250-261
Publisher name
Springer
Place of publication
Berlin / Heidelberg
Event location
Kathmandu, Nepal
Event date
Apr 6, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)