A Kumaran and Tobias Kellner
Machine Transliteration deals with the conversion of text strings from one orthography to another, while preserving the phonetics of the strings in the two languages. Transliteration is an important problem in machine translation or crosslingual information retrieval, as most proper names and generic iconic terms are out-of-vocabulary words, and there- fore need to be transliterated. There are numerous methods explored in the literature for machine transliteration, ranging from rule-based techniques to statistical learning tech- niques. Here we focus our attention on language-independent techniques that potentially can scale well with a large number of languages. In this paper, we present a modular, sta- tistical learning framework that lends itself for easy experimentation with transliteration tasks between a variety of different languages, in a language-independent manner. The workbench includes a variety of components – algorithms, data-sets and transliterations scripts – for a quick assembly of an effective transliteration system across langauges. We believe that such workbenches would be important in an increasingly multilingual world, for building systems that span a number of languages, quickly and effectively.
|Published in||the 30th annual international ACM SIGIR conference on Research and Development in Information Retrieval (SIGIR 2007), Amsterdam, Netherlands|
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.