Machine Translation of Sentences with Fixed Expression.pdfVIP

Machine Translation of Sentences with Fixed Expressions Naoto Katoh 1 Teruaki Aizawa NHK Science and Technical Research Laboratories 1-10-11, Kinuta, Setagaya-ku, Tokyo 157, Japan { katonao, aizaw a } @ strl.nhk, or.jp Abstract This paper presents a practical machine translation system based on sentence types for economic news stories. Conventional English-to-Japanese machine translation (MT) systems which are rule-based approaches, are diffi- cult to translate certain types of Associated Press (AP) wire service news stories, such as economics and sports, because these topics include many fixed expressions (such as compound words or collocations) which are difficult to be processed by conventional syntactic analysis and/or word selection methods. The proposed MT system, an economic-news stories machine translation system (ENTS), can translate eco- nomic news sentences with fixed expressions. The system consists of three processes, to handle different types of sentences, fixed type, economics-specific type and general type. This paper focuses mainly on the translation method for fixed-type sentences, which is a kind of example-based approach. In this translation method, fixed sentence trans- lation (STRA) data plays a key role. The STRA data is a set of bilingual templates, which is built automatically from fixed English sentences and their Japanese transla- tion equivalents. The fixed English sentences are extracted automatically from the AP corpus. A series of experiments to evaluate ENTS using eco- nomic news in the AP news stories showed the translation accuracy was about 50 % higher than with our conven- tional rule-based MT method. 1 Introduction We are developing an English-to-Japanese machine trans- lation (MT) system to produce real-time rough translations for Associated Press (AP) wire service news stories. With some news topics, troubles with fixed expressions lows the translation accuracy of the MT system. Economic