Substring-Based Transliteration

Transliteration is the task of converting a word from one alphabetic script to another. We present a novel, substring-based approach to transliteration, inspired by phrasebased models of machine translation. We investigate two implementations of substringbased transliteration: a dynamic programming algorithm, and a finite-state transducer. We show that our substring-based transducer not only outperforms a state-of-the-art letterbased approach by a significant margin, but is also orders of magnitude faster.

• Type: Conference
• Year: 2007
• Where: ACL
• Authors: Tarek Sherif, Grzegorz Kondrak
• Keywords: ACL 2007, Computational Linguistics, Dynamic Programming Algorithm, State-of-the-art Letterbased Approach, Substringbased Transliteration