Bare-Bones Dependency Parsing
2012 (English)In: Security and Intelligent Information Systems / [ed] Bouvry, P., Klopotek, M.A., Leprevost, F., Marciniak, M., Mykowiecka, A., Rybinski, H., Springer Berlin/Heidelberg, 2012, 20-32 p.Conference paper (Refereed)
If all we want from a syntactic parser is a dependency tree, what do we gain by first computing a different representation such as a phrase structure tree? The principle of parsimony suggests that a simpler model should be preferred over a more complex model, all other things being equal, and the simplest model is arguably one that maps a sentence directly to a dependency tree a bare-bones dependency parser. In this paper, I characterize the parsing problem faced by such a system, survey the major parsing techniques currently in use, and begin to examine whether the simpler model can in fact rival the performance of more complex systems. Although the empirical evidence is still limited, I conclude that bare-bones dependency parsers can achieve state-of-the-art parsing accuracy and often excel in terms of efficiency.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2012. 20-32 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 7053
natural language parsing, dependency parsing
Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:uu:diva-164952ISI: 000306943900002ISBN: 978-3-642-25260-0OAI: oai:DiVA.org:uu-164952DiVA: diva2:471073
International Joint Conference on Security and Intelligent Information Systems (SIIS 2011), JUN 13-14, 2011, Warsaw, POLAND