@inproceedings{5f9a6ca0534a4e12a11a56baca7a2d2f,
title = "Transition-based syntactic linearization",
abstract = "Syntactic linearization algorithms take a bag of input words and a set of optional constraints, and construct an output sentence and its syntactic derivation simultaneously. The search problem is NP-hard, and the current best results are achieved by bottom-up bestfirst search. One drawback of the method is low efficiency; and there is no theoretical guarantee that a full sentence can be found within bounded time. We propose an alternative algorithm that constructs output structures from left to right using beam-search. The algorithm is based on incremental parsing algorithms. We extend the transition system so that word ordering is performed in addition to syntactic parsing, resulting in a linearization system that runs in guaranteed quadratic time. In standard evaluations, our system runs an order of magnitude faster than a state-of-the-art baseline using best-first search, with improved accuracies.",
author = "Yijia Liu and Yue Zhang and Wanxiang Che and Bing Qin",
note = "Publisher Copyright: {\textcopyright} 2015 Association for Computational Linguistics.; Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015 ; Conference date: 31-05-2015 Through 05-06-2015",
year = "2015",
doi = "10.3115/v1/n15-1012",
language = "英语",
series = "NAACL HLT 2015 - 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference",
publisher = "Association for Computational Linguistics (ACL)",
pages = "113--122",
booktitle = "NAACL HLT 2015 - 2015 Conference of the North American Chapter of the Association for Computational Linguistics",
address = "澳大利亚",
}