Computational model of grammar for English to Sinhala Machine Translation

Development of the computational model of grammar for highly inflected language is a complex task and it is also essential to develop rule-based machine translation systems. This paper presents a computational model of grammar for Sinhala language by considering the Morphology and the Syntax of the Sinhala language. Finite State Transducers (FST) and Context-free grammar (CFG) have been used to describe the computational grammar for Sinhala. The grammar has been tested through the English to Sinhala Machine Translation System. The translation system successfully translates English sentences with simple or complex subjects and objects with most commonly used patterns of the tenses including active and passive voice forms.