A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Flexible Non-Terminals for Dependency Tree-to-Tree Reordering
2016
Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
A major benefit of tree-to-tree over treeto-string translation is that we can use target-side syntax to improve reordering. While this is relatively simple for binarized constituency parses, the reordering problem is considerably harder for dependency parses, in which words can have arbitrarily many children. Previous approaches have tackled this problem by restricting grammar rules, reducing the expressive power of the translation model. In this paper we propose a general model for dependency
doi:10.18653/v1/n16-1002
dblp:conf/naacl/RichardsonCNK16
fatcat:65nrop6nvbfh3mqum7bc36xkde