Analysis of Bangla-2-Braille machine translator

Simple item page
dc.contributor.authorHossain, Syed Akhter
dc.contributor.authorBiswas, Lora Annanya
dc.contributor.authorHossain, Md Iqbal
dc.date.accessioned2018-09-27T05:43:22Z
dc.date.accessioned2019-05-27T09:59:31Z
dc.date.available2018-09-27T05:43:22Z
dc.date.available2019-05-27T09:59:31Z
dc.date.issued2015-04-02
dc.description.abstractBangla-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
dc.identifier.otherhttp://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/3324
dc.identifier.urihttp://hdl.handle.net/20.500.11948/3324
dc.language.isoen
dc.publisherIEEE Xplore
dc.sourceDIU Institutional Repository
dc.subjectAutomata
dc.subjectComputers
dc.subjectConferences
dc.subjectInformation technology
dc.subjectComputational modeling
dc.subjectFormal languages
dc.subjectfinite state machines
dc.subjecthandicapped aids
dc.subjectlanguage translation
dc.subjectnatural language processing
dc.titleAnalysis of Bangla-2-Braille machine translator
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Bangla.docx
Size:
10.04 KB
Format:
Adobe Portable Document Format
Download

Collections

Proceedings