Optimal translation boundaries for BTG-based decoding

Xiangyu Duan; Min Zhang

doi:10.1109/IALP.2011.73

Optimal translation boundaries for BTG-based decoding

Xiangyu Duan^*
, Min Zhang

^*Corresponding author for this work

Agency for Science, Technology and Research, Singapore

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper proposes a method for inducing translation boundaries as soft constraints for Bracketing Transduction Grammar based (BTG-based) decoding. Translation boundaries used in previous research are extracted from left-most synchronous trees generated by a deterministic algorithm. Translation boundaries in this research are extracted from induced synchronous trees, which are statistically optimal and more balanced than the left-most synchronous trees. Experiments show that induced translation boundaries are more consistent than those extracted from left-most synchronous trees, resulting in significantly better performances over the strong baseline.

Original language	English
Title of host publication	Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011
Pages	205-208
Number of pages	4
DOIs	https://doi.org/10.1109/IALP.2011.73
State	Published - 2011
Externally published	Yes
Event	2011 International Conference on Asian Language Processing, IALP 2011 - Penang, Malaysia Duration: 15 Nov 2011 → 17 Nov 2011

Publication series

Name	Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011

Conference

Conference	2011 International Conference on Asian Language Processing, IALP 2011
Country/Territory	Malaysia
City	Penang
Period	15/11/11 → 17/11/11

Keywords

BTG-based
induction
translation boundary

Access to Document

10.1109/IALP.2011.73

Cite this

@inproceedings{b9dc5df8ccb0477aa03db4825b06e0e7,

title = "Optimal translation boundaries for BTG-based decoding",

abstract = "This paper proposes a method for inducing translation boundaries as soft constraints for Bracketing Transduction Grammar based (BTG-based) decoding. Translation boundaries used in previous research are extracted from left-most synchronous trees generated by a deterministic algorithm. Translation boundaries in this research are extracted from induced synchronous trees, which are statistically optimal and more balanced than the left-most synchronous trees. Experiments show that induced translation boundaries are more consistent than those extracted from left-most synchronous trees, resulting in significantly better performances over the strong baseline.",

keywords = "BTG-based, induction, translation boundary",

author = "Xiangyu Duan and Min Zhang",

year = "2011",

doi = "10.1109/IALP.2011.73",

language = "英语",

isbn = "9780769545547",

series = "Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011",

pages = "205--208",

booktitle = "Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011",

note = "2011 International Conference on Asian Language Processing, IALP 2011 ; Conference date: 15-11-2011 Through 17-11-2011",

}

Duan, X & Zhang, M 2011, Optimal translation boundaries for BTG-based decoding. in Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011., 6121504, Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011, pp. 205-208, 2011 International Conference on Asian Language Processing, IALP 2011, Penang, Malaysia, 15/11/11. https://doi.org/10.1109/IALP.2011.73

Optimal translation boundaries for BTG-based decoding. / Duan, Xiangyu; Zhang, Min.
Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011. 2011. p. 205-208 6121504 (Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal translation boundaries for BTG-based decoding

AU - Duan, Xiangyu

AU - Zhang, Min

PY - 2011

Y1 - 2011

N2 - This paper proposes a method for inducing translation boundaries as soft constraints for Bracketing Transduction Grammar based (BTG-based) decoding. Translation boundaries used in previous research are extracted from left-most synchronous trees generated by a deterministic algorithm. Translation boundaries in this research are extracted from induced synchronous trees, which are statistically optimal and more balanced than the left-most synchronous trees. Experiments show that induced translation boundaries are more consistent than those extracted from left-most synchronous trees, resulting in significantly better performances over the strong baseline.

AB - This paper proposes a method for inducing translation boundaries as soft constraints for Bracketing Transduction Grammar based (BTG-based) decoding. Translation boundaries used in previous research are extracted from left-most synchronous trees generated by a deterministic algorithm. Translation boundaries in this research are extracted from induced synchronous trees, which are statistically optimal and more balanced than the left-most synchronous trees. Experiments show that induced translation boundaries are more consistent than those extracted from left-most synchronous trees, resulting in significantly better performances over the strong baseline.

KW - BTG-based

KW - induction

KW - translation boundary

UR - https://www.scopus.com/pages/publications/84862933486

U2 - 10.1109/IALP.2011.73

DO - 10.1109/IALP.2011.73

M3 - 会议稿件

AN - SCOPUS:84862933486

SN - 9780769545547

T3 - Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011

SP - 205

EP - 208

BT - Proceedings - 2011 International Conference on Asian Language Processing, IALP 2011

T2 - 2011 International Conference on Asian Language Processing, IALP 2011

Y2 - 15 November 2011 through 17 November 2011

ER -

Optimal translation boundaries for BTG-based decoding

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this