[PDF][PDF] The best of both worlds–a graph-based completion model for transition-based parsers

B Bohnet, J Kuhn - Proceedings of the 13th Conference of the …, 2012 - aclanthology.org
Proceedings of the 13th Conference of the European Chapter of the …, 2012aclanthology.org
Transition-based dependency parsers are often forced to make attachment decisions at a
point when only partial information about the relevant graph configuration is available. In this
paper, we describe a model that takes into account complete structures as they become
available to rescore the elements of a beam, combining the advantages of transition-based
and graph-based approaches. We also propose an efficient implementation that allows for
the use of sophisticated features and show that the completion model leads to a substantial …
Abstract
Transition-based dependency parsers are often forced to make attachment decisions at a point when only partial information about the relevant graph configuration is available. In this paper, we describe a model that takes into account complete structures as they become available to rescore the elements of a beam, combining the advantages of transition-based and graph-based approaches. We also propose an efficient implementation that allows for the use of sophisticated features and show that the completion model leads to a substantial increase in accuracy. We apply the new transition-based parser on typologically different languages such as English, Chinese, Czech, and German and report competitive labeled and unlabeled attachment scores.
aclanthology.org
Showing the best result for this search. See all results