Lin W.-HHSIN-HSI CHEN2023-06-092023-06-092000https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121270525&partnerID=40&md5=38175700ae0d9c671d1da19fefff6b6fhttps://scholars.lib.ntu.edu.tw/handle/123456789/632521This paper classifies the problem of machine transliteration into four types, i.e., forward/backward transliteration between same/different character sets, based on transliteration direction and character sets. A phoneme-based similarity measure is proposed to deal with backward transliteration between different character sets. Chinese-English information retrieval is taken as an example. The experiments show that phoneme-based approach is better than grapheme-based approach. In a mate matching of 1,261 candidates, the average rank is 7.80 and 57.65% of candidates are ranked as number one. © Proceedings of the 13th Conference on Computational Linguistics and Speech Processing, ROCLING 2000.Character sets; Computational linguistics; As numbers; ITS applications; Machine transliteration; Matchings; Similarity measure; Speech processingconference paper2-s2.0-85121270525