An English to Korean transliteration model of extended Markov window

  • Authors:
  • Sung Young Jung;SungLim Hong;Eunok Paek

  • Affiliations:
  • Information Technology Lab., LG Electronics Institute of Technology, Seoul, Korea;Information Technology Lab., LG Electronics Institute of Technology, Seoul, Korea;Information Technology Lab., LG Electronics Institute of Technology, Seoul, Korea

  • Venue:
  • COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automatic transliteration problem is to transcribe foreign words in one's own alphabet. Machine generated transliteration can be useful in various applications such as indexing in an information retrieval system and pronunciation synthesis in a text-to-speech system. In this paper we present a model for statistical English-to-Korean transliteration that generates transliteration candidates with probability. The model is designed to utilize various information sources by extending a conventional Markov window. Also, an efficient and accurate method for alignment and syllabification of pronunciation units is described. The experimental results show a recall of 0.939 for trained words and 0.875 for untrained words when the best 10 candidates are considered.