A machine transliteration model based on correspondence between graphemes and phonemes

Machine transliteration is an automatic method for converting words in one language into phonetically equivalent ones in another language. There has been growing interest in the use of machine transliteration to assist machine translation and information retrieval. Three types of machine translitera...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on Asian language information processing 2006-09, Vol.5 (3), p.185-208
Main Authors: Oh, Jong-Hoon, Choi, Key-Sun, Isahara, Hitoshi
Format: Article
Language:English
Subjects:
Automation
Correspondence
Information retrieval
Machinery
Proposals
Studies
Translations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Machine transliteration is an automatic method for converting words in one language into phonetically equivalent ones in another language. There has been growing interest in the use of machine transliteration to assist machine translation and information retrieval. Three types of machine transliteration models---grapheme-based, phoneme-based, and hybrid---have been proposed. Surprisingly, there have been few reports of efforts to utilize the correspondence between source graphemes and source phonemes, although this correspondence plays an important role in machine transliteration. Furthermore, little work has been reported on ways to dynamically handle source graphemes and phonemes. In this paper, we propose a transliteration model that dynamically uses both graphemes and phonemes, particularly the correspondence between them. With this model, we have achieved better performance---improvements of about 15 to 41% in English-to-Korean transliteration and about 16 to 44% in English-to-Japanese transliteration---than has been reported for other models.
ISSN:1530-0226
2375-4699
1558-3430
2375-4702
DOI:10.1145/1194936.1194938