Flexible Non-Terminals for Dependency Tree-to-Tree Reordering
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Insertion Position Selection Model for Flexible Non-Terminals in Dependency Tree-to-Tree Machine Translation
2016-11-01 · EMNLP 2016 11
· Toshiaki Nakazawa, John Richardson, Sadao Kurohashi
Machine TranslationPositionTranslationWord Alignment
Dependency Tree Abstraction for Long-Distance Reordering in Statistical Machine Translation
2014-04-01 · EACL 2014 4
· Chenchen Ding, Yuki Arase
Machine TranslationTranslation
Pre-Reordering for Machine Translation Using Transition-Based Walks on Dependency Parse Trees
2013-08-01 · WS 2013 8
· Antonio Valerio Miceli-Barone, Giuseppe Attardi
Machine TranslationTranslation
To Swap or Not to Swap? Exploiting Dependency Word Pairs for Reordering in Statistical Machine Translation
2016-08-03
· Christian Hadiwinoto, Yang Liu, Hwee Tou Ng
Reordering poses a major challenge in machine translation (MT) between two languages with significant differences in word order. In this paper, we present a novel reordering approach utilizing sparse features based on de…
Machine TranslationSentenceTranslationLow-Resource Syntactic Transfer with Unsupervised Source Reordering
2019-03-13 · NAACL 2019 6
· Mohammad Sadegh Rasooli, Michael Collins
We describe a cross-lingual transfer method for dependency parsing that takes into account the problem of word order differences between source and target languages. Our model only relies on the Bible, a considerably sma…
Cross-Lingual TransferDependency Parsing