TAILIEUCHUNG - Báo cáo khoa học: "Empirical Lower Bounds on the Complexity of Translational Equivalence ∗"

This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext was higher than suggested in the literature. These findings shed new light on why “syntactic” constraints have not helped to improve statistical translation models, including finitestate phrase-based models, tree-to-string models, and tree-to-tree models. | Empirical Lower Bounds on the Complexity of Translational Equivalence Benjamin Wellington Computer Science Dept. New York University New York NY 10003 lastname @ Sonjia Waxmonsky Computer Science Dept. University of Chicago 1 Chicago IL 60637 wax@ I. Dan Melamed Computer Science Dept. New York University New York NY 10003 lastname @ Abstract This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext was higher than suggested in the literature. These findings shed new light on why syntactic constraints have not helped to improve statistical translation models including finite-state phrase-based models tree-to-string models and tree-to-tree models. The paper also presents evidence that inversion transduction grammars cannot generate some translational equivalence relations even in relatively simple real bitexts in syntactically similar languages with rigid word order. Instructions for replicating our experiments are at http GenPar ACL06 1 Introduction Translational equivalence is a mathematical relation that holds between linguistic expressions with the same meaning. The most common explicit representations of this relation are word alignments between sentences that are translations of each other. The complexity of a given word alignment can be measured by the difficulty of decomposing it into its atomic units under certain constraints detailed in Section 2. This paper describes a study of the distribution of alignment complexity in a variety of bitexts. The study considered word alignments both in isolation and in combination with independently generated parse trees for one or both sentences in each pair. Thus the study Thanks to David Chiang Liang Huang the anonymous reviewers and members of the NYU Proteus Project for helpful feedback. This research was supported by NSF grant s 0238406 and .

• Báo cáo khoa học
• Empirical Lower Bounds
• the Complexity of Translational Equivalence
• Benjamin Wellington
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Bài giảng Xử lý ngôn ngữ tự nhiên
• Ngôn ngữ tự nhiên
• Kỹ thuật lập trình
• Xử lý nhập nhằng ngữ nghĩa
• Xử lý ngữ nghĩa
• Xử lý ngôn ngữ
• Natural Language Processing
• Ngôn ngữ lập trình
• Nhập nhằng cấu trúc
• Tri thức về ngôn ngữ
• Mô hình n gram
• Dịch máy
• Phương pháp dịch máy
• Hiểu ngôn ngữ
• Phân tích ngữ nghĩa
• Phân loại tin tự động
• Biểu diễn vị từ
• Thuộc tính về sự kiện
• Thuộc tính về sự kiện
• Mô hình ngôn ngữ Google Book N grams
• Mô hình ngôn ngữ KenLM
• Phương pháp làm mịn
• Tách từ tiếng Việt
• Gán nhãn từ loại
• Phân tích cú pháp
• Nghĩa từ vựng
• Phân giải nhập nhằng từ
• Phân loại văn bản
• Lexical chain
• Phản hồi thông tin
• Bài toán PTCP
• Cấu trúc ngữ pháp
• Phân tích cú pháp xác suất
• CKY kết hợp xác suất
• Văn phạm phi ngữ cảnh xác suất
• Hình thái học