Dynamic Programming Algorithms for Transition-Based Dependency Parsers
2011 (English)In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, 2011, 673-682 p.Conference paper (Refereed)
We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based dependency parsers from existing tabular methods. Additionally, we provide a detailed discussion of the conditions under which the feature models commonly used in transition-based parsing can be integrated into our algorithms.
Place, publisher, year, edition, pages
2011. 673-682 p.
, Association for Computational Linguistics (ACL). Annual Meeting Conference Proceedings, ISSN 0736-587X
Language Technology (Computational Linguistics)
Research subject Computational Linguistics
IdentifiersURN: urn:nbn:se:uu:diva-148406OAI: oai:DiVA.org:uu-148406DiVA: diva2:402096
49th Annual Meeting of the Association for Computational Linguistics, Portland, Oregon, USA, June 19-24, 2011