Papers › Sinhala Transliteration: A Comparative Analysis Between Rule-based and Seq2Seq Approaches

Sinhala Transliteration: A Comparative Analysis Between Rule-based and Seq2Seq Approaches

31 Dec 2024arXiv:2501.00529archive 2025-07-28

Yomal De Mel, Kasun Wickramasinghe, Nisansa de Silva, Surangika Ranathunga

Due to reasons of convenience and lack of tech literacy, transliteration (i.e., Romanizing native scripts instead of using localization tools) is eminently prevalent in the context of low-resource languages such as Sinhala, which have their own writing script. In this study, our focus is on Romanized Sinhala transliteration. We propose two methods to address this problem: Our baseline is a rule-based method, which is then compared against our second method where we approach the transliteration problem as a sequence-to-sequence task akin to the established Neural Machine Translation (NMT) task. For the latter, we propose a Transformer-based Encode-Decoder solution. We witnessed that the Transformer-based method could grab many ad-hoc patterns within the Romanized scripts compared to the rule-based method. The code base associated with this paper is available on GitHub - https://github.com/kasunw22/Sinhala-Transliterator/

PaperPDFCode

Code

kasunw22/sinhala-transliterator officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

DecoderMachine TranslationNMTTransliteration

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

BASEFocus

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections