tailieunhanh - Báo cáo khoa học: "Translation as Weighted Deduction"

We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise to clean analyses and compact descriptions that can serve as the basis for modular implementations. We illustrate this with several examples, showing how to build search spaces for several disparate phrase-based search strategies, integrate non-local features, and devise novel models. Although the framework is drawn from parsing and applied to translation, it is applicable to many dynamic programming problems arising in natural language processing and other areas. . | Translation as Weighted Deduction Adam Lopez University of Edinburgh 10 Crichton Street Edinburgh EH8 9AB United Kingdom alopez@ Abstract We present a unified view of many translation algorithms that synthesizes work on deductive parsing semiring parsing and efficient approximate search algorithms. This gives rise to clean analyses and compact descriptions that can serve as the basis for modular implementations. We illustrate this with several examples showing how to build search spaces for several disparate phrase-based search strategies integrate non-local features and devise novel models. Although the framework is drawn from parsing and applied to translation it is applicable to many dynamic programming problems arising in natural language processing and other areas. 1 Introduction Implementing a large-scale translation system is a major engineering effort requiring substantial time and resources and understanding the tradeoffs involved in model and algorithm design decisions is important for success. As the space of systems described in the literature becomes more crowded identifying their common elements and isolating their differences becomes crucial to this understanding. In this work we present a common framework for model manipulation and analysis that accomplishes this and use it to derive surprising conclusions about phrase-based models. Most translation algorithms do the same thing dynamic programming search over a space of weighted rules 2 . Fortunately we need not search far for modular descriptions of dynamic programming algorithms. Deductive logic Pereira and Warren 1983 extended with semir ings Goodman 1999 is an established formalism used in parsing. It is occasionally used to describe formally syntactic translation models but these treatments tend to be brief Chiang 2007 Venugopal et al. 2007 Dyer et al. 2008 Melamed 2004 . We apply weighted deduction much more thoroughly first extending it to phrasebased models and showing that the .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã 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.