DSpace Repository

Analysis of Bangla-2-Braille machine translator

Show simple item record

dc.contributor.author Hossain, Syed Akhter
dc.contributor.author Biswas, Lora Annanya
dc.contributor.author Hossain, Md Iqbal
dc.date.accessioned 2018-09-27T05:43:22Z
dc.date.accessioned 2019-05-27T09:59:31Z
dc.date.available 2018-09-27T05:43:22Z
dc.date.available 2019-05-27T09:59:31Z
dc.date.issued 2015-04-02
dc.identifier.uri http://hdl.handle.net/20.500.11948/3324
dc.description.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. Full Text Link: http://doi.org/10.1109/ICCITechn.2014.7073082 en_US
dc.language.iso en en_US
dc.publisher IEEE Xplore en_US
dc.subject Automata en_US
dc.subject Computers en_US
dc.subject Conferences en_US
dc.subject Information technology en_US
dc.subject Computational modeling en_US
dc.subject Formal languages en_US
dc.subject finite state machines en_US
dc.subject handicapped aids en_US
dc.subject language translation en_US
dc.subject natural language processing en_US
dc.title Analysis of Bangla-2-Braille machine translator en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account