TAILIEUCHUNG - Báo cáo khoa học: "A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model"

In this paper, we propose a novel string-todependency algorithm for statistical machine translation. With this new framework, we employ a target dependency language model during decoding to exploit long distance word relations, which are unavailable with a traditional n-gram language model. Our experiments show that the string-to-dependency decoder achieves point improvement in BLEU and point improvement in TER compared to a standard hierarchical string-tostring system on the NIST 04 Chinese-English evaluation set. . | A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model Libin Shen BBN Technologies Cambridge MA 02138 USA lshen@ Jinxi Xu BBN Technologies Cambridge MA 02138 USA jxu@ Ralph Weischedel BBN Technologies Cambridge MA 02138 USA weisched@ Abstract In this paper we propose a novel string-to-dependency algorithm for statistical machine translation. With this new framework we employ a target dependency language model during decoding to exploit long distance word relations which are unavailable with a traditional n-gram language model. Our experiments show that the string-to-dependency decoder achieves point improvement in BLEU and point improvement in TER compared to a standard hierarchical string-to-string system on the NIST 04 Chinese-English evaluation set. 1 Introduction In recent years hierarchical methods have been successfully applied to Statistical Machine Translation Graehl and Knight 2004 Chiang 2005 Ding and Palmer 2005 Quirk et al. 2005 . In some language pairs . Chinese-to-English translation state-of-the-art hierarchical systems show significant advantage over phrasal systems in MT accuracy. For example Chiang 2007 showed that the Hiero system achieved about 1 to 3 point improvement in BLEU on the NIST 03 04 05 Chinese-English evaluation sets compared to a start-of-the-art phrasal system. Our work extends the hierarchical MT approach. We propose a string-to-dependency model for MT which employs rules that represent the source side as strings and the target side as dependency structures. We restrict the target side to the so called well-formed dependency structures in order to cover a large set of non-constituent transfer rules Marcu et al. 2006 and enable efficient decoding through dynamic programming. We incorporate a dependency language model during decoding in order to exploit long-distance word relations which are unavailable with a traditional n-gram language model on target .

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.