CERTAIN APPROACHES FOR A COMPLETE MATHEMATICAL TEXTTO-SPEECH SYSTEM
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 4
Abstract
This paper discusses the teaching - learning process of mathematical subjects made accessible to visually disabled students. It aims to provide users a friendly vocal interface with computer and allow visually impaired people to use the computer. It focuses on the issues that arise from representation, encoding and manipulation of mathematics in electronic media. Professionals use tools like LaTeX that result in encoding of mathematics, symbols and expressions. A well encoded MathML expression can be evaluated in a computer algebra system rendered in a web browser. Some approaches for achieving the transformations from MathML to speech output are mentioned in this paper. A Text-To-Speech (TTS) system that supports JSML is responsible for rendering a document as spoken output. The challenge for educational institutions is, as they increase the use of e learning, they must apply these techniques in a way that does not introduce unnecessary barriers to disabled learners.
Authors and Affiliations
S. GOMATHI ROHINI , R. S. UMADEVI
ESTIMATION OF THE BURST LENGTH IN OBS NETWORKS
This paper presents an overview of the optical burst switching (OBS) and discusses the major components. In OBS, the length of the burst arriving at a particular node is unknown, and hence, node design is very complex. I...
Use of Prefix Trees in Text Error Correction Problem
A deformed fuzzy automaton can be used to calculate similarity value between strings having a nonlimited number of edition errors. In this paper an algorithm is presented that makes use of prefix tree to implement the de...
MOBILE ENABLED GOVERNANCE FOR LOCAL GOVERNMENTS IN INDIA
India is heading towards globalization. Its economy is growing faster than the most of any major economy in the world. The Ministry of Statistics and Programme Implementation expects the Indian economy to grow by 7.4 per...
ACHIEVING MULTI-DOCUMENT SUMMARIZATION BASED ON MULTIPLE-RANKING METHODOLOGY WITH THE HELP OF NEAREST NEIGHBORS IN CLUSTERS
The goal of multi-document summarization is to give a prejudiced summary on a particular topic. This paper describes how to perform summarization task by means of multiple-ranking of sentences from various documents. Our...
A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.
In this paper we present a multi-party Key Agreement Protocol (KAP) using some of the search problems such as Factorization Search Problem , Decomposition Search Problem Conjugacy Search Problem and Twisted Conjugacy Pro...