Analysis of Bangla-2-Braille machine translator

Author

Hossain, Syed Akhter ; Biswas, Lora Annanya ; Hossain, Md Iqbal

Author_Institution

Dept. of Comput. Sci. & Eng., Daffodil Int. Univ., Dhaka, Bangladesh

fYear

2014

Firstpage

300

Lastpage

304

Abstract

Bangla-2-Braille machine translator is implemented using rule based Discrete Finite Automata (DFA) [1]. Rule based DFA directs the necessity of generating regular expression from the DFA in order to validate the language model used for Braille conversion and extend the translator for better usability by the visually impaired people. In this work, we conducted experiments using structured and state elimination method to generate, and validate regular expressions from the DFA designed for Bangla-2-Braille machine translator. The generated expressions were tested for Braille language rules and the results were satisfactory.

Keywords

finite state machines; handicapped aids; language translation; natural language processing; Bangla-2-Braille machine translator; Braille conversion; Braille language rule; discrete finite automata; regular expression generation; rule-based DFA; state elimination method; visually impaired people; Automata; Computational modeling; Computers; Conferences; Formal languages; Information technology; Bangla; Braille; DFA; Machine Translator; Regular Expression;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Technology (ICCIT), 2014 17th International Conference on

Type

conf

DOI

10.1109/ICCITechn.2014.7073082

Filename

7073082