tailieunhanh - Báo cáo khoa học: "Pattern-Based Context-Free Grammars for Machine Translation"

This paper proposes the use of "patternbased" context-free grammars as a basis for building machine translation (MT) systems, which are now being adopted as personal tools by a broad range of users in the cyberspace society. We discuss major requirements for such tools, including easy customization for diverse domains, the efficiency of the translation algorithm, and scalability (incremental improvement in translation quality through user interaction), and describe how our approach meets these requirements. . | Pattern-Based Context-Free Grammars for Machine Translation Koichi Takeda Tokyo Research Laboratory IBM Research 1623-14 Shimotsuruma Yamato Kanagawa 242 Japan Phone 81-462-73-4569 81-462-73-7413 FAX takeda@ Abstract This paper proposes the use of patternbased context-free grammars as a basis for building machine translation MT systems which are now being adopted as personal tools by a broad range of users in the cyberspace society. We discuss major requirements for such tools including easy customization for diverse domains the efficiency of the translation algorithm and scalability incremental improvement in translation quality through user interaction and describe how our approach meets these requirements. 1 Introduction With the explosive growth of the World-Wide Web WWW as information source it has become routine for Internet users to access textual data written in foreign languages. In Japan for example a dozen or so inexpensive MT tools have recently been put on the market to help PC users understand English text in WWW home pages. The MT techniques employed in the tools however are fairly conventional. For reasons of affordability their designers appear to have made no attempt to tackle the well-known problems in MT such as how to ensure the learnability of correct translations and facilitate customization. As a result users are forced to see the same kinds of translation errors over and over again except they in cases where they involve merely adding a missing word or compound to a user dictionary or specifying one of several word-to-word translations as a correct choice. There are several alternative approaches that might eventually liberate US from this limitation on the usability of MT systems Unification-based grammar for- malisms and lexical-semantics formalisms see LFG Kaplan and Bresnan 1982 HPSG Pollard and Sag 1987 and Generative Lexicon Pustejovsky 1991 for example have been proposed to facilitate computationally precise .