Computational Linguistics
English-to-Korean transliteration using multiple unbounded overlapping phoneme chunks
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Learning transliteration lexicons from the web
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Named entity translation with web mining and transliteration
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A novel implementation of the FITE-TRT translation method
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
English to persian transliteration
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
This paper proposes a new framework of machine transliteration, called non-productive machine transliteration. In this framework, it is assumed that a large candidate list including the correct transliteration is given. Therefore, the transliteration problem is simplified into the selection problem of the correct entry from the large list. We have developed an efficient algorithm of this framework and applied it to English-Japanese transliteration of person names. Experimental results show that our algorithm is practical even if the size of the candidate list is over a million.