Computational model of grammar for English to Sinhala Machine Translation

Author

Hettige, B. ; Karunananda, A.S.

Author_Institution

Dept. of Stat. & Comput. Sci., Univ. of Sri Jayewardenepura, Nugegoda, Sri Lanka

fYear

2011

fDate

1-2 Sept. 2011

Firstpage

26

Lastpage

31

Abstract

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.

Keywords

context-free grammars; finite state machines; language translation; natural language processing; CFG; English language; FST; Sinhala language; computational grammar; context-free grammar; finite state transducer; rule-based machine translation system; Generators; Grammar; IP networks; Instruments; Conjugation; Context-free grammar; Machine Translation; Sinhala Languages;

fLanguage

English

Publisher

ieee

Conference_Titel

Advances in ICT for Emerging Regions (ICTer), 2011 International Conference on

Conference_Location

Colombo

Print_ISBN

978-1-4577-1113-8

Type

conf

DOI

10.1109/ICTer.2011.6075022

Filename

6075022