Received 14 February 2016; accepted 17 March 2016; published 23 March 2016
Speech is one form of communication used by the humans for exchanging the information. Each word that is spoken by the humans is created using the phonetic combination of vowel and consonant speech sound units. Speech processing is the study of speech signals and processing methods of these signals. The speech signals are usually processed in a digital representation. Speech recognition is the process of converting the speech signal into human readable text. Nowadays speech recognition is used in variety of applications. People with disabilities can benefit from speech recognition programs. For individuals that are deaf or hard of hearing, speech recognition software is used to automatically generate a closed captioning of conversations such as discussions in conference rooms, classroom lectures. Speech recognition is also very useful for people who have difficulty using their hands, ranging from mild repetitive stress injuries to involved disabilities that preclude using conventional computer input devices. Our proposed system is developed to facilitate the visually impaired people or the person with arm injuries with excellent programming skills that can code the C program through voice input. The paper is organized into existing systems, proposed system, implementation and its performance. Literature related with the proposed systems is discussed in Chapter 2. Chapter 3 deals with the proposed frame work followed by the implementation in Chapter 4. The performance analysis is detailed in Chapter 5. Chapter 6 concludes with a few points as to the scope for future enhancement.
2. Literature Survey
Speech recognition  is used to convert the audio signals into human readable text format. Speech recognition is classified as two types according to number of users using it. Speaker dependent system―the system  recognizes the words only from the trained speaker. Accuracy of these systems is usually high. Speaker independent system―these systems  are able to be used by different individuals without training to recognize each person’s speech characteristics. Speech recognition system is classified into two types based on input to the system. Isolated speech recognition-it operates on a single word at a time  , requiring a pause between saying each word. Continuous speech recognition   ―It operates on speech in which, words are connected together. Speech recognition is classified as three types according to sub word unit  used for recognition. The types are: syllable-based Recognition, phoneme-based recognition and word-based recognition. There are two phases in developing speech recognition system. They are training and testing phase. In training phase, the speech samples are collected. The features are extracted from the collected speech samples and the acoustic model is built. During testing phase, using acoustic model speech utterance is recognized.
Different types of spectral features that  can be extracted during training phase are Linear predictive analysis (LPC), Linear predictive cepstral coefficients (LPCC), perceptual linear predictive coefficients (PLP), Mel- frequency cepstral coefficients (MFCC) etc. In our proposed work, MFCC features are extracted from the speech samples.
A few of the speech based applications developed are mentioned below.
In  , a web based application to find out the user’s mood from the emotions present in the speech signal is presented. It is used to overcome the difficulties in the present web education system’s feedback. However this application will collect the feedback about the web page as voice samples. From the collected voice samples, it will identify the user moods. A client-server based speech recognition system is described in  . In this work, recognition is done at the server side. The client will transmit the speech signals to the server. Speech can be transmitted to the server through internet. The disadvantage of this approach is that the user cannot access these applications through low bandwidth connections. A speech browser is developed in  . This system is used to browse the worldwide web via speech input. Speech based e-learning is described in  . In  , the speech recognition system uses client/server architecture. The client uses a Java applet, which is integrated in an HTML page. It takes the user’s input and activates the corresponding service at the speech server.
3. Proposed Framework
Two major modules of the proposed framework are shown in Figure 1.
Module 1: Speech recognition.
Module 2: Building IDE for C program.
3.1. Speech Recognition
In Speech recognition training phase, feature vectors are extracted from the given speech signal. The extracted feature is used to build the acoustic model. In testing phase, from the test speech signal, the features are extracted. The extracted feature is compared with the acoustic model to produce the recognized text. Speech Recognition system is implemented using sphinx  -  tool kit.
Figure 1. Proposed framework.
3.2. Building IDE for C Program
Recognized text from module 1 is pre processed to convert the text into proper C program using syntactic construct of the C language. This C program will be fetched as input to IDE. This IDE will produce the compiled output of the recognized C program.
3.3. Proposed Framework Description
3.3.1 Training Phase
The training phase consists of the following modules.
1) Data collection
Example of dictionary file:
ADD AE D
AMBERSAND AE M B ER S AE N D
2) Feature Extraction
Features are extracted from the voice samples. MFCC features   are extracted using the following steps shown in Figure 2.
Pre emphasis―Divide the signal into 20 - 40 ms frames. In this paper the frame size is assumed as 25 ms. This means the frame length for a 16 kHz signal is 0.025 × 16,000 = 400 samples. Frame step is usually 10 ms to 15 ms, which allows overlap between the frames.
Hamming windowing―Windowing is applied to minimize the disruptions at the start and at the end of the frame.
Fast fourier transform―The conversion from time domain to frequency domain is carried out by fourier transform method.
where h(n): N sample long analysis window,
K: the length of the DFT.
The periodogram―based power spectral estimate for the speech frame si(n) is given by
Mel Filter Bank Processing―The filters are used to compute a weighted sum of spectral components to filter the output.
Mel Scale―The Mel scale relates perceived frequency, or pitch, of a pure tone to its actual measured frequency. Humans are superior at discerning minute alterations in pitch at low frequencies than they are at high frequencies. Incorporating this scale makes our features matches closely with humans’ perception.
The formula for converting frequencies into Mel scale is:
Discrete Cosine Transform―It is used to convert the Mel spectrum to the domain of time.
Delta Energy and Delta Spectrum―It is necessary to add features related to the change in the characteristics of cepstral over the time. Delta energy and delta spectrum are also known as differential and acceleration coefficients. The MFCC feature vector describes only the power spectral envelope of a single frame, however speech would also have information in the dynamics i.e. what are the trajectories of the MFCC coefficients over time. It turns out that calculating the MFCC trajectories and appending them to the original feature vector increases ASR performance by quite a bit.
Delta coefficients are computed as follows:
Figure 2. MFCC feature extraction steps.
where dt is a delta coefficient, from frame computed in terms of the static coefficients ct+N to ct-N.
3) Building HMM model
A hidden Markov model (HMM)  is a statistical Markov model which has the unobserved states. The states in the Hidden Markov Model are not directly visible, i.e. it has hidden states. Each state has a probability distribution over the other states. Using HMM, the acoustic model is built from the extracted MFCC features. It is a word based model. Here each phone is represented as state. First state and last state are non-emitting state. The state transition between one phoneme to another phoneme. The state transition will lead to find out the vocabulary during the recognition process.
For example: INCLUDE IH N K L UW D
The word INCLUDE has 6 states. State transition from IH to D will lead to the word INCLUDE
4) Language Model
The language model is used to assign probability to each word according to their frequencies. This language model will facilitate to predict the subsequent word during the testing phase of the speech recognition. In speech recognition if the HMM model didn’t predict the word correctly, then language model will find out the subsequent sequence word using these calculated probability values. Different types of language models can be built, e.g. unigram, bigram, trigram model, etc. Unigram model is used to find out one single word, whereas bigram model is used to predict the predecessor or successor word. Trigram model is used to predict the predecessor and the successor of the given word.
The unigram model can be calculated by:
where represents the words in the corpus and P(wi) represents the probability of each word occurring in that corpus. i represents the ith word in the corpus. C(wi) represents the count of the ith word.
N represents the total number of words in the corpus.
The bigram model can be calculated by:
where represents the previous words in the corpus and represents the probability of each word with the other words occurring in the corpus. i represents the ith word in the corpus.
The trigram model can be calculated by:
Example of language model:
(trigram)-0.3010 <s>OPENBRACKET </s>
<s> : represents a word in the word corpus that occurs predecessor of the current word. </s>: represents a word in the word corpus that occurs a successor of the current word. Here probability values are represented in logarithm.
3.3.2. Speech Testing
1) Feature Extraction
The MFCC features are extracted from the test speech utterance. The procedure for extracting MFCC feature is explained in Section 3.3.1.
2) Acoustic Model
After extracting the MFCC features from test speech signal, using the acoustic model the text is recognized. In order to incorporate the syntax of the C program, the recognized text is given to the IDE Preprocessing module. Speech testing is implemented in two ways.
Real time speech testing-Voice input is given instantly to recognize the text.
Recorded wav file speech testing-The recorded wav files are given as input to this type of testing.
The algorithm for Real time speech testing is shown in algorithm 1. In algorithm 1, IDE commands represent open, save, new, compile and run. The algorithm for doIDEcommands function and doIDEpreprocessing function are explained in algorithm 3 and 6. The algorithm for recorded wav file speech testing is given in algorithm 2. The algorithms are explained in Appendix.
3.4. IDE Preprocessing
In IDE pre processing module, the recognized text from speech testing will be converted into C program using the syntactic construct of C language. In the first step, the recognized text is divided into tokens. If token is recognized as symbol then replace the token with its corresponding symbol. If token is a number then convert the token into its equivalent number. If the token is not a number or a symbol then leave the text as it is. After the recognized text is pre processed, it will be fetched as input to the IDE module.
Text to Symbol and Number Conversion
Create two look up tables for storing the symbols (operators in C language) and numbers. Compare the token with the symbols present in the look up table for symbols. If one of the symbols matches with the token then replace the token with its corresponding symbol. Otherwise, compare the token with the numbers present in the look up table for numbers. If one of the numbers matches with the token then replace the token with its corresponding value. If the token does not match with all of the symbols or numbers then leave the token as such. This process will be repeated for all the tokens. Few symbols and all numbers are listed in look up Table 1 & Table 2 respectively.
The algorithms for doing IDEpreprocessing are shown in algorithm 3, 4, 5.
3.5. Existing IDE
In this module, the pre processed text will be fetched as input. IDE commands are also given through voice input only. The IDE commands used in our proposed work are open file, save file, new file, compile file and run file.
3.5.1. New File
This command will open a new file in the IDE. The voice command will create a new file in the IDE.
Table 1. Look up table for symbols.
Table 2. Look up table for numbers.
3.5.2. Open File
The open file command is used to open the existing file. For opening a file the user has to provide the command “open file <filename> dot c ‘or’ open file location <location of the file>” through voice input. If the file exists subsequently the IDE will open the file. If it is not exists in that case it will show an error message to the user.
If we utter the following lines:
Open file example dot c (or) open file location D colon backslash example backslash example dot c.
This will be converted into the text as follows:
Open file example.c
Open file location D:\example\example.c
The voice command for open file is converted into text. From the text, file name will be extracted. If the command is open file without the keyword “location” in that case it will look for the file in the current directory. If the command is with the keyword “location” then it will look for the file at the specific location.
3.5.3. Save File
The save command is used to save a file. For saving a file the user has to provide the command “save file <filename> dot c ‘or’ save file location <location of the file>” through voice input. It will save the contents of the IDE into the file specified by the user.
Example: save file example dot c (or) save file location D colon backslash example backslash example dot c.
These will be converted into the text.
Save file example.c
Save file location D:\example\example.c
The voice command will be converted as text. From the text the
File name will be extracted. If the command is save file without keyword “location” then it will save the
File in the current directory. If the command is with the keyword “location” then it will save the file at the specific location.
3.5.4. Compile File
The compile command is used to compile the C file. For compiling a file the user has to provide the command “compile file” through voice input. The file is compiled using the gcc compiler. After the compilation process the gcc compiler will produce the .exe file or .o file based on the Operating System. It will produce .exe files for windows and .o file for unix based Operating System.
3.5.5. Run File
The run command is used to run the C file. For running a C file the user has to provide the command “run file” through voice input. If the .exe file or .o file is found then it will run the .exe file or .o file in the command prompt or terminal according the Operating System. If the .exe file or .o file is not found then it will display the error message. After running the C program the .exe or .o file is deleted.
3.5.6. Goto Line Number
The goto line number command is used to correct the errors occurred during the compilation of the C program. For error correction in a C file, the user has to provide the command “goto line number <lineno>” through voice input. Extract the line number from the user voice command. Empty the text in that line. After clearing the text in the specific line given by the user, place the latest recognized text. The new text is recognized from the user voice.
Example: goto line number six six.
From this six six should be extracted and converted to numbers as 66. This text to number conversion will
be done by the IDEP reprocessing module. The algorithm for doing IDECommands is shown in algorithms 6, 7, 8, 9, 10.
4. Experimental Setup
5. Performance Analysis
The performance measure used to evaluate the proposed system is discussed below.
The Word Error Rate (WER) is a metric which is used to measure the performance of an ASR. It compares the given word to a recognized word and is defined as follows:
S is the number of substitutions,
D is the number of deletions,
I is the number of insertions and,
N is the number of words in the actual word.
Word Error Rate calculation for the entire system is as follows:
Word Error Rate calculation for a C program is
i is the line number of the program,
WERi is the Word Error Rate for the ith line of the C program,
n is the total line numbers in a C program.
Word Error Rate calculation for IDE commands is
c is the voice input for IDE command,
WERc is the Word Error Rate for the IDE command c,
m is the total no. of IDE commands uttered by user.
The performance of speech recognition is analyzed by varying the number of mixture components using 150 words are tabulated in Table 3. From Table 3, it has been noted that word error rate is decreased when number of mixture component is increased. There is an increase in word error rate for mixture component 128. The reason for increase in word error rate is that, the amount of training data is not sufficient to train the model for 128 mixture component. The number of times the word is uttered is increased to 40 to improve the performance for 128 mixture component. The number of mixture component in HMM model is decided based on the number of phonemes available in the training utterances. From the above experiment, it has been concluded that the optimum number of mixture component for the current study is fixed as 64 components.
The performance of speech recognition is analyzed by varying number of words are represented in Figure 3. From Figure 3, it has been noted that word error rate is increased when the vocabulary size is increased. For large vocabulary speech recognition system, the suitable sub word unit is phoneme or syllable.
Our proposed system is used to capture the C program through voice input and produces the compiled C program as output. During training phase, speech utterances corresponding to C key word are collected. MFCC features are extracted from the speech samples. HMM model is built using extracted features. During testing, from the test utterance, the MFCC features are extracted. Using the HMM model, the text is recognized. The recognized text is converted into the C program by using syntactic constructs of the C language. The IDE commands for saving, opening, compiling and running the file are also given through voice input. The proposed speech based IDE is implemented for C program only, it can be extended to other programming languages. In our proposed work, word based speech recognition is implemented. While extending the research work to other programming languages, phoneme based speech recognition can be applied. Phoneme based speech recognition supports the large vocabulary data set.
Table 3. Performance of speech recognition system using different mixture components.
Figure 3. WER vs. number of words.
 Ben Mosbah, B. (2006) Speech Recognition for Disabilities People. Information and Communication Technologies, 2006, Vol. 1, 864-869.
 Huang, X.D. and Lee, K.F. (1993) On Speaker-Independent, Speaker-Dependent, and Speaker-Adaptive Speech Recognition. IEEE Transactions on Speech and Audio Processing, 1, 150-157.
 Yusnita, M.A., Paulraj, M.P., Yaacob, S., Abu Bakar, S., Saidatul, A., Abdullah, A.N. (2011) Phoneme-Based or Isolated-Word Modeling Speech Recognition System? An Overview. 2011 IEEE 7th International Colloquium on Signal Processing and Its Applications (CSPA), Penang, 4-6 March 2011, 304-309.
 van der Walt, C. and Mortimer, B. (1993) The Practical Application of a Continuous Speech Recognition System. In Proceedings of the 1993 IEEE South African Symposium on Communications and Signal Processing, Jan Smuts Airport, 6 August 1993, 145-149.
 Ganapathiraju, A., Hamaker, J., Picone, J., Ordowski, M. and Doddington, G.R. (2001) Syllable-Based Large Vocabulary Continuous Speech Recognition. IEEE Transactions on Speech and Audio Processing, 9, 358-366.
 Shrawankar, U. and Thakare, V.M. (2013) Techniques for Feature Extraction in Speech Recognition System: A Comparative Study. International Journal of Computer Applications in Engineering, Technology and Sciences, 2, 412-418.
 Gong, M.M. and Luo, Q. (2007) Speech Emotion Recognition in Web Based Education. In IEEE International Conference on Grey Systems and Intelligent Services, Nanjing, 18-20 November 2007, 1082-1086.
 Digalakis, V.V., Neumeyer, L.G. and Perakakis, M. (1999) Quantization of Cepstral Parameters for Speech Recognition over the World Wide Web. IEEE Journal on Selected Areas in Communications, 17, 82-90.
 Borges, J.A., Jimenez, J. and Rodriquez, N.J. (1999) Speech Browsing the World Wide Web. In 1999 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 4, 80-86.
 Werner, S., Wolfi, M., Eichner, M. and Hofimann, R. (2004) Integrating Speech Enabled Services in a Web-Based E-Learning Environment. International Conference on Information Technology: Coding and Computing, Vol. 2, 303-307.
 Lee, K.-F., Hon, H.W. and Reddy, R. (1990) An Overview of the SPHINX Speech Recognition System. IEEE Transactions on Acoustics, Speech and Signal Processing, 38, 35-45.
 Huang, X.D., Alleval, F., Hwang, M.-Y. and Rosenfeld, R. (1993) An Overview of the SPHINX-II Speech Recognition System. Proceedings of the Workshop on Human Language Technology, Vol. 38, 81-86.
 Putra, B. (2011) Implementation of Secure Speaker Verification at Web Login Page Using Mel Frequency Cepstral Coefficient-Gaussian Mixture Model (MFCC-GMM). 2011 2nd International Conference on Instrumentation Control and Automation (ICA), Bandung, 15-17 November 2011, 358-363.
 Martine, J., Perez, H., Escamillal, E. and Suzuki, M.M. (2012) Speaker Recognition Using Mel Frequency Cepstral Coeficients (MFCC) and Vector Quantization (VQ) Techniques. In 2012 22nd International Conference on Electrical Communications and Computers (CONIELECOMP), Cholula, 27-29 February 2012, 248-251.
 Rabiner, L. (1989) A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE, 77, 257-286.