# An Auxiliary Teaching System for Spoken English Based on Speech Recognition Technology

Authors: Lei Bao; Jing Lv
Journal: Scientific Programming
 (2022)

---

## Abstract

Because the English language has always been inaccurate and seemed difficult to correct errors, this development has created a reputation based on improvements to the DWJ algorithm and HMM speech scores and correction mistake. In this paper, different signal characteristics are used using the DWJ algorithm: the Mel frequency cepstrum coefficient compares the standard speech library and the distance between the speech sample and the sample message received. The conversation deciphered the Viterbi code according to the HMM model, which was recognized and evaluated by posteriori probabilities. Finally, the professional data were used to fix the wrong phone to determine, score, and make repair mistakes. The results of the experiments show that the tests used in this article are reliable. The results of the experiment show that the standard English language proficiency in this article is reliable, which can provide students with timely, accurate, and objective assessment and teaching feedback, improving English language proficiency.


---

## Body

## 1. Introduction

As the most widely used language in the world, it is important to learn and master English. However, learning English has always affected Chinese. Learning, reading, listening, and speaking English on a daily basis is the hardest part. With the advancement of computer science and technology, training, and education, the use of computer-assisted speech technology allows for solving this problem. Technology can transform existing instructional patterns and learning environments and transform information into text by doing, analyzing, recognizing, and understanding them. In combination with other language skills such as fluency, speech technology, and machine translation. English language proficiency systems have been developed to help students correct non-verbal cues on time and without repetition. This will greatly benefit students’ English language learning experience and result in significant community and business benefits.


## 2. Literature Review

The basis of telephone calls is knowledge of speech and speech measurement. Speech recognition technology, or Automatic Speech Recognition (ASR), is the technology of translating information into commands or texts by using automatic recognition and comprehension technology (many are computers) to use interactive communication between man and machine. Thus, speech skills have become a hot topic in recent years [1, 2]. The demands of high-end software, hardware, and procedures for speech signal processing work are due to changes in speech, data signal frequency, volume of speech, in particular, multiple acknowledgments and measures. From the classical dynamic time distortion (DTW) algorithm to the hidden Markov simplified model (HMM) and then to the latent inertia device (ANN), speech recognition has become the norm. Unprecedented Difficulties. As a result, it is difficult to improve its accuracy and speed, making it difficult to make a significant impact on knowledge of speech, material, and industry [3].For the classic speech recognition algorithm, DTW solves the problem of different call length patterns based on dynamic programming ideas. DTW is the easiest and most effective way to identify personal information, as it is virtually no longer included in training. However, it has many shortcomings, especially the ability to recognize an independent speaker, speak fluently, and speak with large words. The main reason is that there is no efficiency for training using statistical procedures, and it is not easy to use simple and advanced instructions for algorithms.HMM creates a set number of models of speech signal time. The HMM model describes the acoustic model of speech in an appropriate way and uses training techniques in organically blended low-pitched and upper-level speech patterns in cognitive exploration algorithm so a better effect can be obtained. However, HMM also has some limitations [4]. First, the HMM-based approach does not consider the impact of perception. Secondly, large-scale speech corpora need to be collected to train HMM templates of standard speech to obtain robust HMM. Moreover, since call is an aid to second language learning, it involves more nonnative speech recognition. When recognizing nonnative speech, the recognition performance of HMM trained by native speech will be greatly reduced, so it is necessary to carry out self-adaptive nonnative speech recognition. Even so, it is still difficult for the adaptive HMM to achieve good results in nonnative speech recognition. In addition, HMM also has the following problems: the prior statistical knowledge of speech signals is required, the classification decision-making ability is weak, and the Viterbi recognition algorithm has a large amount of computation and Gaussian mixture probability calculation. These shortcomings make it difficult to further improve the performance of HMM model. For English speech recognition with large amount of data and complex pronunciation changes, HMM has more obvious shortcomings, which makes the speech recognition time longer. Therefore, the HMM-based speech recognition method has encountered a major development bottleneck [5].


## 3. Improved DWT Algorithm

### 3.1. Speech Recognition Principle

The main idea of knowledge of technology is to bring speech into a product of learning, translating practical information into text that is conveyed through the processes of machine knowledge and understand, and allow the machine to control speech. Speech recognition can illustrate the principle of acceptance as shown in Figure1. The most important module of speech recognition is to eliminate speech and modify speech patterns.Figure 1
Principle of speech recognition.


### 3.2. Voice Signal Preprocessing

The first step in speaking skills is before the speaking process. The advancement of speech characters is not only the basis of speaking skills, but also an important factor in the development of the characteristics of speech. Only at the prespeaking stage of the speech signal is it possible to subtract the features that indicate the speech and then carry out the comparison with the sample to get the result related similarities. The audible signal preprocessing module typically has five steps: digitizing the audible signal, endpoint detection, enclosing, windowing, and preemphasis[6].


#### 3.2.1. Speech Signal Digitization

A loudspeaker signal is a type of clock-changing wave and is an analog signal. However, since computers only receive digital signals, if a computer wants to make a speech sound, it must digitize the speech signal. The process of digitizing spoken characters involves comparisons and quantification. After sampling and quantization, the speech signal becomes a digital signal.


#### 3.2.2. Preemphasis

The first task is to improve the signal frequency, eliminate the frequency signal in the speech signal, and smooth the signal spectrum. In the spectrum of speech signals, the higher the frequency, the lower the amplitude. When the frequency of a speech signal is doubled, its amplitude of the energy spectrum decreases by 6 dB. In order to balance the signal spectrum and facilitate the analysis of the spectrum and other characteristics, it is first necessary to see that the signal is speech signal. High-frequency speech signals and low-frequency speech signals are difficult to obtain. Special attention is paid to solving this problem. One indicator is the use of digital audio signals through filters with enhanced 6Db/8 frequency characteristics. This is a first-class digital filter, as shown in the following equation:(1)Hz=1−μ∗z−1.If expressed in time domain, the preaccentuated signal S2(n) is (2)S2n=Sn−∗Sn−1,where μ is 0.9375.


#### 3.2.3. Framing and Windowing

Generally, speech symbols are considered infinite and change over time. However, in the short term, such as l0 ms–25 ms, there is a slight change in the characteristics of the speech signal. We can define this short-term problem as a stable signal, and the characteristics of the speech at this time can be considered as constant [7]. Therefore, it can describe the speech signal using a short time; that is, the speech signal is segmented parallel to the time axis. To achieve the purpose of speech comparison, we subtract the speech signal characteristics for each speech segment and compare them with the segmented speech characteristics. At the same time, the overlap of the frames should be facilitated by the transition of the line adjacent to the speech signal and the continuity of the signal. This overlap is often called the transformation, and the data contained in a ton of speech is called a long line [8].


#### 3.2.4. Endpoint Detection

There is no way to determine the end. Different search processes can be used in different systems. In this form, the system uses a combination of short-term zero interference velocity and short-term momentum to capture the final points. Both methods are time-consuming and the results are reliable and accurate.The short-term energy is a reflection of the law of change in terms of volume over time. Assume that the long-range magnitude of theX range of the nth energy of the speech signal is indicated by E. then its calculation formula is shown as follows (where N is the frame length): (3)En=∑m=0N−1xn2m,0≤m≤N−1.We can tell the difference between speech and voice by analyzing the signal strength. The distance between the speaker signal and the pickup will indicate more. Short power consumption, speech signal, and noise can be easily seen in the example of signal-to-noise ratio. However, in a low- to high-pitched environment, the short-wave energy does not exactly distinguish the melody [9].The short-time zero intersection signal is the number of short-time signals transmitted across thex-axis in the range. The signal recording time for a continuous speech signal is the number of times it crosses over the time axis of the zero intersection reported. If the two values of an example of a discrete signal are different, it means that they pass through the time axis at once. Therefore, a zero-intersection value can be calculated. We define the short-time zero-crossing rate of speech signal as follows:(4)Zn=12∑m=0N−1sgnxnm−sgnxnm−1,where sgn[x] is a symbolic function, as follows:(5)sgnx=1x≥0−1x≤0..Low-energy sound tones have a low cross-sectional area, while high-energy sound tones have a high cross-sectional area. In general, by identifying the zero-crossing speed, it can be seen that the speech segment has a stable zero-crossing speed, but the volume is not the case. Therefore, we can filter the end of the conversation by short-term zero intersection [10].


### 3.3. Feature Extraction of Speech Signal

Decomposing speech signal features for improved speech reduces system storage capacity, shortens run time, and effectively improves comparison efficiency [11].Now, after the speech signal has been completed, several measures have been selected for the following characteristics: linear estimated coefficient (LPC), linear hypothesis cepstrum coefficient (LPCC), and Mel cepstrum coefficient (MFCC). These measurements can determine the characteristics of the speech signal. The Mel cepstrum coefficient (MFCC) is stronger for noise operation and more stable than the linear frequency (LPC). Using three negative traits (MFCC, tone, and size) to measure English proficiency, the final experiment showed that MFCC had the highest accuracy [12].The relationship between Mel scale and frequency can be illustrated by the following equation (wheref is the truth rate of the signal): (6)fmel=2595long101+f700,where f is the unit of actual frequency in Hz. MFCC parameter extraction principle’s block diagram is shown in Figure 2.Figure 2
Schematic block diagram of MFCC feature parameter extraction.


### 3.4. Dynamic Time Warping (DTW) Recognition Algorithm

Dynamic time distortion is best associated with the principle of dynamic programming by performing time differences between the design and the experimental model. This bends two sentences connected to different clocks on the time axis so that the two points speak better. There are two time series,m and N, and their lengths are h and K. M sequence is the design, n is a sequence model, and the values of each point in the system are the same indicating the value of each column of temporary speech. For example, the sentence of m speech contains the whole H number. The characteristic value of the i-th frame is mi. The Figure 3 shows data formula (7) of the two sequences:(7)M=m1,m2,…,mi,…,mh;N=n1,n2,…,nj,…,nk;.In order to better compare the two speech periods, we need to compare the two periods and create a network ofh∗k matrices as shown in the figure below. We draw each model audible signal frame on the horizontal axis of the rectangle joint and then draw each sample audible signal frame on the vertical axis of the rectangle joint. The diagrams below are drawn with data from two categories. The intersection of each grid in the figure shows that the distance between mi and nj can be marked wi; that is, the similarity of each point in m is temporary and each point in n is temporary. The smaller the distance, the higher the similarity. Euclidean sites are usually used. Each term of the matrix (i, j) represents a comparison of the terms mi and nj. The DTW algorithm can be scaled down to see the way through multiple points in this network. Content across the network is a parallel content that counts in two sections. The two sequences can be represented in Figure 3 by the two combinations.Figure 3
DTW algorithm constraint search path diagram.From the above analysis, we can define the passage through the lines in the figure according to the method of exploration with the time difference ofW. The k-th definition of W indicates drawings of m and n.From the above analysis, we can determine the way in which the lines in the figure become the means of exploration with time change, shown asW. Conclusion k-th of W is defined as the formula, indicating the sequences M and N. So we have the following formula:(8)W=w1,w2,…,wk−i,…,wk;maxm,n≤k≤m+n−1.


### 3.5. Improved DTW Algorithm

In the previous section, the DTW algorithm always uses all words as the basis of training and recognition and does not consider the distribution of words. Due to the low slope limit during modification, many points in the network cannot be reached. As shown in Figure4, it is not necessary to calculate the appropriate frame spacing for the diamond layer mesh content [13]. In addition, it is not necessary to keep the matrix parallelism of all the frames and the matrix components, because only three networks of the previous line are used in the calculation counts for each network point in each row. The combined use of these two functions can reduce computing and storage space [14].Figure 4
Schematic diagram of matching path constraint.Adjusting multiple lines of the research matrix can affect the required speed. We can control the search area by adjusting the two slopes. If the search is too small, the search speed will be better, more useable methods will be lost, and the comparison will be inaccurate. Changing the search facilities too much may quickly affect competition [15]. Finally, the development of DTW exploration after the experiment did not explore the whole of the matrix data in the figure, but reduced the area of the surrounding parallelogram by two lines with 2/3 and 3/2 slopes. It is the last point that works. A field is a parallelogram called an exploration figure. A field is a parallelogram called an exploration figure. In the origin and endpoint of the parallelogram (top right) and the parallelogram formed by the two edges 2/3 and 3/2, the following two points Send and Xb finally counted. In such areas, rapid and similar searches are the best options [16]. Improvements to traditional DTW algorithms are aimed at improving the performance of comparison speech. Figure 4 shows the research method for improving the DTW algorithm.In Figure4, the actual dynamic bending is divided into three sections: 1,xa,xa+1xbxb+1N1,xa,xa+1xbxb+1N, as shown in(9)xa=132M−Nxb=232N−M,where xa and xb both take the nearest integer; thus, the limiting condition formula (10) for the length of M and N is also obtained:(10)2M−N≥32N−M≥2..If the above conditions are not met, the difference between the two is considered to be very good for dynamic bending modification.It is not necessary to compare each pole on thex-axis with every pole on the y-axis, except the pole on the y-axis. The calculations for ymin and ymax are as follows:(11)ymin12x,0≤x≤xb2x+M−2N,xb≤x≤N,(12)ymin2x,0≤x≤xa12x+M−121/2N,xa≤x≤N..The connecting parts of our three bends are >case. For each front frame of thex-axis, the y-axis ratio is different, but the bending properties are the same, and the distance change is made by the following model: (13)Dx,y=dx,y+minDx−1,y,Dx−1,y−1,Dx−1,y−2.For each front column of thex-axis, only the storage space of the previous column is required. Therefore, instead of storing the entire distance matrix as a whole, only vectors D and D of the two lines should store the storage space of the previous line and count the storage space of the line now, which has been modified for all forward and post. According to the above model, the storage area D of the previous line and the relative DX,v of all the frames of the current line are stored in vector D by calculating the storage location of the current pole and then assigning the new D position to D as the new location stored in the next row. In this way, it goes to the end line of the x-axis, and M meaning of vector D is the parallel to the dynamic curve of the two models.


## 3.1. Speech Recognition Principle

The main idea of knowledge of technology is to bring speech into a product of learning, translating practical information into text that is conveyed through the processes of machine knowledge and understand, and allow the machine to control speech. Speech recognition can illustrate the principle of acceptance as shown in Figure1. The most important module of speech recognition is to eliminate speech and modify speech patterns.Figure 1
Principle of speech recognition.


## 3.2. Voice Signal Preprocessing

The first step in speaking skills is before the speaking process. The advancement of speech characters is not only the basis of speaking skills, but also an important factor in the development of the characteristics of speech. Only at the prespeaking stage of the speech signal is it possible to subtract the features that indicate the speech and then carry out the comparison with the sample to get the result related similarities. The audible signal preprocessing module typically has five steps: digitizing the audible signal, endpoint detection, enclosing, windowing, and preemphasis[6].


### 3.2.1. Speech Signal Digitization

A loudspeaker signal is a type of clock-changing wave and is an analog signal. However, since computers only receive digital signals, if a computer wants to make a speech sound, it must digitize the speech signal. The process of digitizing spoken characters involves comparisons and quantification. After sampling and quantization, the speech signal becomes a digital signal.


### 3.2.2. Preemphasis

The first task is to improve the signal frequency, eliminate the frequency signal in the speech signal, and smooth the signal spectrum. In the spectrum of speech signals, the higher the frequency, the lower the amplitude. When the frequency of a speech signal is doubled, its amplitude of the energy spectrum decreases by 6 dB. In order to balance the signal spectrum and facilitate the analysis of the spectrum and other characteristics, it is first necessary to see that the signal is speech signal. High-frequency speech signals and low-frequency speech signals are difficult to obtain. Special attention is paid to solving this problem. One indicator is the use of digital audio signals through filters with enhanced 6Db/8 frequency characteristics. This is a first-class digital filter, as shown in the following equation:(1)Hz=1−μ∗z−1.If expressed in time domain, the preaccentuated signal S2(n) is (2)S2n=Sn−∗Sn−1,where μ is 0.9375.


### 3.2.3. Framing and Windowing

Generally, speech symbols are considered infinite and change over time. However, in the short term, such as l0 ms–25 ms, there is a slight change in the characteristics of the speech signal. We can define this short-term problem as a stable signal, and the characteristics of the speech at this time can be considered as constant [7]. Therefore, it can describe the speech signal using a short time; that is, the speech signal is segmented parallel to the time axis. To achieve the purpose of speech comparison, we subtract the speech signal characteristics for each speech segment and compare them with the segmented speech characteristics. At the same time, the overlap of the frames should be facilitated by the transition of the line adjacent to the speech signal and the continuity of the signal. This overlap is often called the transformation, and the data contained in a ton of speech is called a long line [8].


### 3.2.4. Endpoint Detection

There is no way to determine the end. Different search processes can be used in different systems. In this form, the system uses a combination of short-term zero interference velocity and short-term momentum to capture the final points. Both methods are time-consuming and the results are reliable and accurate.The short-term energy is a reflection of the law of change in terms of volume over time. Assume that the long-range magnitude of theX range of the nth energy of the speech signal is indicated by E. then its calculation formula is shown as follows (where N is the frame length): (3)En=∑m=0N−1xn2m,0≤m≤N−1.We can tell the difference between speech and voice by analyzing the signal strength. The distance between the speaker signal and the pickup will indicate more. Short power consumption, speech signal, and noise can be easily seen in the example of signal-to-noise ratio. However, in a low- to high-pitched environment, the short-wave energy does not exactly distinguish the melody [9].The short-time zero intersection signal is the number of short-time signals transmitted across thex-axis in the range. The signal recording time for a continuous speech signal is the number of times it crosses over the time axis of the zero intersection reported. If the two values of an example of a discrete signal are different, it means that they pass through the time axis at once. Therefore, a zero-intersection value can be calculated. We define the short-time zero-crossing rate of speech signal as follows:(4)Zn=12∑m=0N−1sgnxnm−sgnxnm−1,where sgn[x] is a symbolic function, as follows:(5)sgnx=1x≥0−1x≤0..Low-energy sound tones have a low cross-sectional area, while high-energy sound tones have a high cross-sectional area. In general, by identifying the zero-crossing speed, it can be seen that the speech segment has a stable zero-crossing speed, but the volume is not the case. Therefore, we can filter the end of the conversation by short-term zero intersection [10].


## 3.2.1. Speech Signal Digitization

A loudspeaker signal is a type of clock-changing wave and is an analog signal. However, since computers only receive digital signals, if a computer wants to make a speech sound, it must digitize the speech signal. The process of digitizing spoken characters involves comparisons and quantification. After sampling and quantization, the speech signal becomes a digital signal.


## 3.2.2. Preemphasis

The first task is to improve the signal frequency, eliminate the frequency signal in the speech signal, and smooth the signal spectrum. In the spectrum of speech signals, the higher the frequency, the lower the amplitude. When the frequency of a speech signal is doubled, its amplitude of the energy spectrum decreases by 6 dB. In order to balance the signal spectrum and facilitate the analysis of the spectrum and other characteristics, it is first necessary to see that the signal is speech signal. High-frequency speech signals and low-frequency speech signals are difficult to obtain. Special attention is paid to solving this problem. One indicator is the use of digital audio signals through filters with enhanced 6Db/8 frequency characteristics. This is a first-class digital filter, as shown in the following equation:(1)Hz=1−μ∗z−1.If expressed in time domain, the preaccentuated signal S2(n) is (2)S2n=Sn−∗Sn−1,where μ is 0.9375.


## 3.2.3. Framing and Windowing

Generally, speech symbols are considered infinite and change over time. However, in the short term, such as l0 ms–25 ms, there is a slight change in the characteristics of the speech signal. We can define this short-term problem as a stable signal, and the characteristics of the speech at this time can be considered as constant [7]. Therefore, it can describe the speech signal using a short time; that is, the speech signal is segmented parallel to the time axis. To achieve the purpose of speech comparison, we subtract the speech signal characteristics for each speech segment and compare them with the segmented speech characteristics. At the same time, the overlap of the frames should be facilitated by the transition of the line adjacent to the speech signal and the continuity of the signal. This overlap is often called the transformation, and the data contained in a ton of speech is called a long line [8].


## 3.2.4. Endpoint Detection

There is no way to determine the end. Different search processes can be used in different systems. In this form, the system uses a combination of short-term zero interference velocity and short-term momentum to capture the final points. Both methods are time-consuming and the results are reliable and accurate.The short-term energy is a reflection of the law of change in terms of volume over time. Assume that the long-range magnitude of theX range of the nth energy of the speech signal is indicated by E. then its calculation formula is shown as follows (where N is the frame length): (3)En=∑m=0N−1xn2m,0≤m≤N−1.We can tell the difference between speech and voice by analyzing the signal strength. The distance between the speaker signal and the pickup will indicate more. Short power consumption, speech signal, and noise can be easily seen in the example of signal-to-noise ratio. However, in a low- to high-pitched environment, the short-wave energy does not exactly distinguish the melody [9].The short-time zero intersection signal is the number of short-time signals transmitted across thex-axis in the range. The signal recording time for a continuous speech signal is the number of times it crosses over the time axis of the zero intersection reported. If the two values of an example of a discrete signal are different, it means that they pass through the time axis at once. Therefore, a zero-intersection value can be calculated. We define the short-time zero-crossing rate of speech signal as follows:(4)Zn=12∑m=0N−1sgnxnm−sgnxnm−1,where sgn[x] is a symbolic function, as follows:(5)sgnx=1x≥0−1x≤0..Low-energy sound tones have a low cross-sectional area, while high-energy sound tones have a high cross-sectional area. In general, by identifying the zero-crossing speed, it can be seen that the speech segment has a stable zero-crossing speed, but the volume is not the case. Therefore, we can filter the end of the conversation by short-term zero intersection [10].


## 3.3. Feature Extraction of Speech Signal

Decomposing speech signal features for improved speech reduces system storage capacity, shortens run time, and effectively improves comparison efficiency [11].Now, after the speech signal has been completed, several measures have been selected for the following characteristics: linear estimated coefficient (LPC), linear hypothesis cepstrum coefficient (LPCC), and Mel cepstrum coefficient (MFCC). These measurements can determine the characteristics of the speech signal. The Mel cepstrum coefficient (MFCC) is stronger for noise operation and more stable than the linear frequency (LPC). Using three negative traits (MFCC, tone, and size) to measure English proficiency, the final experiment showed that MFCC had the highest accuracy [12].The relationship between Mel scale and frequency can be illustrated by the following equation (wheref is the truth rate of the signal): (6)fmel=2595long101+f700,where f is the unit of actual frequency in Hz. MFCC parameter extraction principle’s block diagram is shown in Figure 2.Figure 2
Schematic block diagram of MFCC feature parameter extraction.


## 3.4. Dynamic Time Warping (DTW) Recognition Algorithm

Dynamic time distortion is best associated with the principle of dynamic programming by performing time differences between the design and the experimental model. This bends two sentences connected to different clocks on the time axis so that the two points speak better. There are two time series,m and N, and their lengths are h and K. M sequence is the design, n is a sequence model, and the values of each point in the system are the same indicating the value of each column of temporary speech. For example, the sentence of m speech contains the whole H number. The characteristic value of the i-th frame is mi. The Figure 3 shows data formula (7) of the two sequences:(7)M=m1,m2,…,mi,…,mh;N=n1,n2,…,nj,…,nk;.In order to better compare the two speech periods, we need to compare the two periods and create a network ofh∗k matrices as shown in the figure below. We draw each model audible signal frame on the horizontal axis of the rectangle joint and then draw each sample audible signal frame on the vertical axis of the rectangle joint. The diagrams below are drawn with data from two categories. The intersection of each grid in the figure shows that the distance between mi and nj can be marked wi; that is, the similarity of each point in m is temporary and each point in n is temporary. The smaller the distance, the higher the similarity. Euclidean sites are usually used. Each term of the matrix (i, j) represents a comparison of the terms mi and nj. The DTW algorithm can be scaled down to see the way through multiple points in this network. Content across the network is a parallel content that counts in two sections. The two sequences can be represented in Figure 3 by the two combinations.Figure 3
DTW algorithm constraint search path diagram.From the above analysis, we can define the passage through the lines in the figure according to the method of exploration with the time difference ofW. The k-th definition of W indicates drawings of m and n.From the above analysis, we can determine the way in which the lines in the figure become the means of exploration with time change, shown asW. Conclusion k-th of W is defined as the formula, indicating the sequences M and N. So we have the following formula:(8)W=w1,w2,…,wk−i,…,wk;maxm,n≤k≤m+n−1.


## 3.5. Improved DTW Algorithm

In the previous section, the DTW algorithm always uses all words as the basis of training and recognition and does not consider the distribution of words. Due to the low slope limit during modification, many points in the network cannot be reached. As shown in Figure4, it is not necessary to calculate the appropriate frame spacing for the diamond layer mesh content [13]. In addition, it is not necessary to keep the matrix parallelism of all the frames and the matrix components, because only three networks of the previous line are used in the calculation counts for each network point in each row. The combined use of these two functions can reduce computing and storage space [14].Figure 4
Schematic diagram of matching path constraint.Adjusting multiple lines of the research matrix can affect the required speed. We can control the search area by adjusting the two slopes. If the search is too small, the search speed will be better, more useable methods will be lost, and the comparison will be inaccurate. Changing the search facilities too much may quickly affect competition [15]. Finally, the development of DTW exploration after the experiment did not explore the whole of the matrix data in the figure, but reduced the area of the surrounding parallelogram by two lines with 2/3 and 3/2 slopes. It is the last point that works. A field is a parallelogram called an exploration figure. A field is a parallelogram called an exploration figure. In the origin and endpoint of the parallelogram (top right) and the parallelogram formed by the two edges 2/3 and 3/2, the following two points Send and Xb finally counted. In such areas, rapid and similar searches are the best options [16]. Improvements to traditional DTW algorithms are aimed at improving the performance of comparison speech. Figure 4 shows the research method for improving the DTW algorithm.In Figure4, the actual dynamic bending is divided into three sections: 1,xa,xa+1xbxb+1N1,xa,xa+1xbxb+1N, as shown in(9)xa=132M−Nxb=232N−M,where xa and xb both take the nearest integer; thus, the limiting condition formula (10) for the length of M and N is also obtained:(10)2M−N≥32N−M≥2..If the above conditions are not met, the difference between the two is considered to be very good for dynamic bending modification.It is not necessary to compare each pole on thex-axis with every pole on the y-axis, except the pole on the y-axis. The calculations for ymin and ymax are as follows:(11)ymin12x,0≤x≤xb2x+M−2N,xb≤x≤N,(12)ymin2x,0≤x≤xa12x+M−121/2N,xa≤x≤N..The connecting parts of our three bends are >case. For each front frame of thex-axis, the y-axis ratio is different, but the bending properties are the same, and the distance change is made by the following model: (13)Dx,y=dx,y+minDx−1,y,Dx−1,y−1,Dx−1,y−2.For each front column of thex-axis, only the storage space of the previous column is required. Therefore, instead of storing the entire distance matrix as a whole, only vectors D and D of the two lines should store the storage space of the previous line and count the storage space of the line now, which has been modified for all forward and post. According to the above model, the storage area D of the previous line and the relative DX,v of all the frames of the current line are stored in vector D by calculating the storage location of the current pole and then assigning the new D position to D as the new location stored in the next row. In this way, it goes to the end line of the x-axis, and M meaning of vector D is the parallel to the dynamic curve of the two models.


## 4. Voice Scoring and Error Correction

### 4.1. Similarity Comparison Method DTW

At present, there are many methods to measure the pronunciation quality. Our requirements for the scoring algorithm are as follows: high reliability and consistency with experts’ scoring only reflect the learners’ ability to pronounce Chinese and do not pursue the best similarity with standard pronunciation individuals. Following this study, the HMM-based phoneme probability algorithm was stable and not easily altered due to changes in the learner’s behavior or voice channel, indicating similarities between learners’ speech and speech patterns.In speech processing, we cannot simply compare input features with templates directly, because speech signals have considerable randomness. Even if the same person reads the same sentence aloud, it is impossible to have exactly the same length of time. For example, with the faster phonation speed, the length of the vowel stable part will be shortened, while the length of the consonant or transitional part will remain basically the same. Therefore, time regulation is essential. Dynamic time warping is a nonlinear warping technique that combines time warping with distance measure computation. Suppose that the feature vector sequence of the reference template isa1,a2,a3,…,am,…aM, the feature vector sequence of the input speech is b1,b2,b3,…,bn,…bN, and M≠N. Then, the dynamic regularization is to find a time regularization function m=wn and map the time axis n nonlinearly to the time axis m of the reference template, so that (14)Dn,wminwn∑n−1Ndn,wn,where dn,wn represents the distance between the nth and input eigenvectors and the wn reference template vector. Obviously, wn should be a nondecreasing function. Dynamic time warping aligns the input features with the reference template features in time to eliminate the nonessential differences between them. Figures 5 to 9 show the schematic diagram of the distortion between the two modes in the case of direct matching, linear matching, and nonlinear matching. It can be seen from the figures that when the nonlinear matching method is adopted, it is possible to minimize the nonessential difference between the two modes.Figure 5
Direct matching.Figure 6
Linear matching.Figure 7
Direct matching D1.Figure 8
Linear matching diagram (D2).Figure 9
Nonlinear matching (D2).Dynamic time warping is an optimization problem. Dynamic programming technology is often used to solve this problem. The concept that local optimization can lead to global optimization is used. The purpose of the solution is to find the optimal time warping functionwn and the corresponding Dn,w. Recursive formulas (15) and (16) can be derived as follows:(15)Dn+1,m=dn+1,m+minDn,mgn,mDn,m−1,Dn,m−2,(16)gn,m=1,wn≠wn−1∞,wn=wn−1..Since the calculation of each pointD(n+1, m) requires the calculation of all three points D values on the n column, it is very time-consuming to calculate the time regularity using the dynamic programming technique. In pattern recognition, it is often necessary to calculate the distance between features. In speech recognition, the similarity between the reference mode and the input mode is determined by the distortion measure between the two frames [17]. It is a measure that reflects the difference between signal features and is represented by D (x, y). In the calculation of DTW distance, the absolute value average distance equation is used as follows:(17)Dx,y=∑i=1Nxi−yiN.DTW distance cannot be directly used as pronunciation score. We need to find a suitable guide to score from a distance. It is considered a relationship of distance and interest:(18)score=1001+adistb.Obviously, this formula can map the distance to the score range of 0100. To solve the unknown parameters a and B in the formula, we need to know some pairs of fractions and distances. The above parameters can be solved from the scores and DTW distances of some experts in the experiment. Using the formula in this paper, even if the distance is larger or smaller than that in the test, the score can be reasonably converted to the interval of 100 to 0 [18]. As two characteristic parameters are actually used, the actual score estimation formula is slightly more complex than the above formula, and the final score is shown in the following weighted sum formula of the two:(19)score=w1∗1001+a1dist1b1+w2∗1001+a2dist2b2.The unknown parameters in the formula meet certain restrictions:a1,a2,b1,b2>0, w1+w2=1. a1,a2,b1,b2 are the parameters of converting distance into fraction, and w1,w2 are the weights of three features.


### 4.2. HMM-Based Scoring Method

The competition using the HMM speech model is another alternative to speech competition, starting with voice, and hoping to see the difference between the experimental speech and the acoustic structure and the music and score words accordingly [19].The flow of the scoring system is shown in Figure10. Preprepared acoustic modeling and music modeling are used as the answer model using speech recognition technology, and the differences in speech test and models are identified and scored, working with the scoring mechanism [20–28].Figure 10
Flowchart of scoring system.The most common method based on the HMM model is to provide telephony. Procedures include logistics scores and postevent scores. Compared to comparison scores, the type of approach for some shows the learner’s ability to speak rather than the data that influences the differences between learners and speakers. Its definition is as follows:(20)Si=∑t=τiτi+1−1lgPqt|qt−1Pot|qt,where Ot and qt are the analysis vectors of phase t and state of HMM. The definition of a model is, then, the result of a change state; that is, A in the HMM model is the resultant distribution of the probe vector, which is B in HMM.Scoring method for sentences is as follows:(21)s=∑WiSi∑Wi,where S is the sentence score, Si is the sound score, and Wi is the weight song. The advantages of registration do not apply to data. After combining the advantages and disadvantages of the various dialing algorithms, the system uses an HMM-based phoneme-based probability algorithm as a call measurement method.HMM Back Probability-Based Score: since speaking of sentences for elementary English students is also slow, speech speed should be increased as a significant impact on speech scores. Finally, the score of phoneme duration can be defined as follows:(22)D=1N∑i=1Nlgpfdi|qi,where di is the duration of segment i corresponding to phoneme qi and fdi is the normalization function. Considering the independence of text and speaker, the speech duration is normalized by the measurement of speech rate (ROS). ROS is the number of phonemes per unit time in a sentence or in all utterances of a speaker. Generally, fdi=ROS∗di is taken.


### 4.3. Error Detection

After the recognition and scoring process of forced association of phonemes, MFCC eigenvalues get the corresponding associated phoneme string, phoneme start time and end time, and score. On the basis of these results, we began to detect phoneme errors. According to the results of the most phoneme like judgment, we can roughly divide phoneme reading errors into three categories: misreading, missing reading, and adding phonemes. Define the most phoneme like phoneme as the phoneme formula with maximum HMM likelihood:(23)qi′=argMaxLiq.Liq is the likelihood formula of any factor q in time period i:(24)Liq=Pq|Qi=∑t=σiσi+1−1Pst|st−1Pot|st.Missed phoneme:qi is not pronounced, as in the following formula:(25)qi=qi−1qi+1SIL.Mispronunciation element: the pronunciation ofqi is so wrong that it sounds more like another pronunciation. It is expressed as qi+1, and it is not a missed phoneme error. At the same time, it is believed that qi is misread as qi.Adding phoneme: there are redundant phonemes in the phoneme recognition result.The results obtained by the correlator cannot distinguish the three errors. The error detection module can only locate the wrong phoneme according to the phoneme score. If it wants to go further, it needs to get the phoneme recognition results through the recognition process to determine which error it belongs to. Two error detection methods can be designed to meet the above different requirements.If it is not required to detect the error type, the correlator can first evaluate the phoneme level correlation score of the speech and set the threshold value. When the corresponding phoneme score is lower than the threshold value, the phoneme will be classified as the wrong phoneme. If you need to detect specific types of errors, you need to add a phoneme recognition process.


### 4.4. Experimental Simulation and Result Analysis

#### 4.4.1. Data Source

These lines use Arabic-language digital data installed in the UCI machine training library developed by the Automatic Alarm Laboratory of Baji-Mokhtar University. This data is called an Arabic number after the MFCC has resolved 13 conflicts in a total of 8800 dialog boxes (88 callers, 10 Arabic numerals, each number repeated 10 times). The call was made by 44 men and 44 women ages 16–40.The content of this article is about 24 undergraduate students of our college, including 15 boys and 9 girls. The content is recorded using a 16 kHz, 16-bit encoding sampling program, CoolEdit. There are 10 written sentences, which are usually in English.


#### 4.4.2. Recognition Rate Test

Acknowledgment level is the fact that the platform can accept user feedback. This is especially important because it is one of the most important measures in the performance of cognitive skills. On the platform, only the speech test module uses the speech experience. Therefore, only a test run of these models was conducted here to ensure that the training platform was able to recognize the English characters that had been developed in the past. In addition, the ambient noise makes it difficult to get the sound at the time. To perform the test, a sample library of recorded sounds was used in the experiment, namely, 3 true and 3 unrecorded sounds. To reduce the impact of ambient noise, a quiet room is the best place for this experiment. Table1 provides information on platform level testing.Table 1
Speech recognition test results.
Test resultTest 1Test 2Test 3Test 4Test 5Test 6AccuracyCorrectCorrectCorrectErrorErrorErrori1111100.98u1111111a1001110.56e0010110.73In the text above, 1 is true and 0 is incorrect. The above tips check if you know the phonetic symbols in English. In terms of acknowledgment, verbal analysis is a great way to measure the accuracy of speech and then learn the English depth of symbols combined with other functions of the platform. Therefore, based on the benefits of the accreditation level of speech screening, we can achieve the training benefits mentioned in this paper.


### 4.5. Speech Evaluation Experiment

In this paper, the correlation coefficient and the Pearson correlation coefficient are used to illustrate the relationship between the measurement technology and the measurement book.Depending on the speech characteristics of college students who have different levels of English proficiency, we have different measures (movement, speed, tone, and music) and measured widely, as recommended by English experts. Levels of detailed information and related assessment models are shown in Table2.Table 2
Artificial evaluation grade and evaluation standard.
GradeIntonationSpeed of speechRhythmIntonationPopulationAComplete and correct content, clear and fluent pronunciation, no obvious pronunciation errorModerate speaking speedAccurate accent pronunciation, strong sense of rhythmAccurate and natural intonationExcellent pronunciationBRelatively complete and accurate content, relatively clear and fluent pronunciation, no serious pronunciation errorSpeak a little fast (slow)More accurate accent pronunciation, with a good sense of rhythmAccurate and natural intonationGood pronunciationCBasically complete and correct content, basically clear and fluent pronunciation, pronunciation errors that affect understandingSpeaking fast (slow)Ordinary accent pronunciation, with a certain sense of rhythmBasically accurate intonation, but not natural enoughGeneral grasp of pronunciationDIncomplete and accurate content, pronunciation not clear and fluent, and serious pronunciation errors that affect understandingSpeaking too fast (slow)Accent pronunciation error, too many (less) accents, poor sense of rhythmInaccurate and unnatural tone of voicePoor overall pronunciationThis book was reviewed by two college English teachers. They assessed 10 sentences of English speaking written by 24 high school students one by one, including 4 marks in music, fast, melodic, vocal music, and general measurement. Pearson correlation coefficient is used in this paper to evaluate the reliability of the book review results, because the content of the teachers during the book review will affect evaluation results.To make it easier to calculate, the levels A, B, C, andD of the scale were changed to 4, 3, 2, and 1, respectively. Pearson’s relationship analysis (two experiments) found that the scores of four measures, namely, noise, velocity, noise, and tone, were correlated (r > 0, P<0.05) for each group, regardless of total scores. This suggests that both instructors can follow the same measurement standards during the test and measure the reliability of the test data.In addition, the results of the two teacher evaluations were averaged (e.g., the average of students’ scores on different sentences). The score is the end of the measurement book.


### 4.6. Inspection of Evaluation Indicators

The procedure described in this paper can measure volume, speed, and intonation of 240 samples in 10 sentences of 24 students. Test results are found in Tables3 and 4.Table 3
Evaluation index test results: number of samples.
Index number of samplesConsistentOne-level differenceTwo-level differenceThree-level differenceIntonation2063220Speed of speech1974300Rhythm2043330Intonation1934541Table 4
Evaluation index experimental results: statistical index.
Index difference levelConsistency rate (%)Adjacent consistency rate (%)PearsonIntonation87.2599.580.7Speed of speech82.081000.493Rhythm85.0098.750.543Intonation81.0098.340.627For intonation testing, there were only 207 models with the same level of measurement technology, manual measurement, one-level difference, two-level difference, and no three-level difference. This shows that the machine and manual ratios have a correlation of 87.25%, the adjacent coefficient is up to 99.58%, and the Pearson correlation coefficient is 0.7, indicating that the method in this article is reliable.For speech speed measurement, there were 197 models at the same level of measurement technology and manual test, 43 models with one-level difference, and two or three with different levels. This shows that the machine and manual speed correlation coefficient are 82.08%, the correlation coefficient is up to 100%, and the Pearson correlation coefficient is 0.493, indicating the reliability of the velocity measurement.In terms of test results, there were 204 models of the same stage of machine testing and test manual, 33 models with one-stage difference, and only 3 models with two stages difference, without three-stage difference. This means that the accuracy levels of the machine and manual assembly are as high as 85%, the relative safety rating is as high as 98.75%, and the Pearson correlation coefficient is 0.543, indicating that the measure of consistency is reliable.For sound analysis, there were 192 models of the same level of measurement machine and manual test, 44 models with one-level difference, and only 4 models with two-level difference, no three-level difference. This shows that the machine and the manual correlation coefficient are 81%, the cohesive position is 98.34%, and the Pearson correlation coefficient is 0.627, indicating that the correction of this is reliable. In conclusion, the language, speed, atherosclerosis, and intonation assessment methods used in this article are reliable and can be used to improve the English language standard.


## 4.1. Similarity Comparison Method DTW

At present, there are many methods to measure the pronunciation quality. Our requirements for the scoring algorithm are as follows: high reliability and consistency with experts’ scoring only reflect the learners’ ability to pronounce Chinese and do not pursue the best similarity with standard pronunciation individuals. Following this study, the HMM-based phoneme probability algorithm was stable and not easily altered due to changes in the learner’s behavior or voice channel, indicating similarities between learners’ speech and speech patterns.In speech processing, we cannot simply compare input features with templates directly, because speech signals have considerable randomness. Even if the same person reads the same sentence aloud, it is impossible to have exactly the same length of time. For example, with the faster phonation speed, the length of the vowel stable part will be shortened, while the length of the consonant or transitional part will remain basically the same. Therefore, time regulation is essential. Dynamic time warping is a nonlinear warping technique that combines time warping with distance measure computation. Suppose that the feature vector sequence of the reference template isa1,a2,a3,…,am,…aM, the feature vector sequence of the input speech is b1,b2,b3,…,bn,…bN, and M≠N. Then, the dynamic regularization is to find a time regularization function m=wn and map the time axis n nonlinearly to the time axis m of the reference template, so that (14)Dn,wminwn∑n−1Ndn,wn,where dn,wn represents the distance between the nth and input eigenvectors and the wn reference template vector. Obviously, wn should be a nondecreasing function. Dynamic time warping aligns the input features with the reference template features in time to eliminate the nonessential differences between them. Figures 5 to 9 show the schematic diagram of the distortion between the two modes in the case of direct matching, linear matching, and nonlinear matching. It can be seen from the figures that when the nonlinear matching method is adopted, it is possible to minimize the nonessential difference between the two modes.Figure 5
Direct matching.Figure 6
Linear matching.Figure 7
Direct matching D1.Figure 8
Linear matching diagram (D2).Figure 9
Nonlinear matching (D2).Dynamic time warping is an optimization problem. Dynamic programming technology is often used to solve this problem. The concept that local optimization can lead to global optimization is used. The purpose of the solution is to find the optimal time warping functionwn and the corresponding Dn,w. Recursive formulas (15) and (16) can be derived as follows:(15)Dn+1,m=dn+1,m+minDn,mgn,mDn,m−1,Dn,m−2,(16)gn,m=1,wn≠wn−1∞,wn=wn−1..Since the calculation of each pointD(n+1, m) requires the calculation of all three points D values on the n column, it is very time-consuming to calculate the time regularity using the dynamic programming technique. In pattern recognition, it is often necessary to calculate the distance between features. In speech recognition, the similarity between the reference mode and the input mode is determined by the distortion measure between the two frames [17]. It is a measure that reflects the difference between signal features and is represented by D (x, y). In the calculation of DTW distance, the absolute value average distance equation is used as follows:(17)Dx,y=∑i=1Nxi−yiN.DTW distance cannot be directly used as pronunciation score. We need to find a suitable guide to score from a distance. It is considered a relationship of distance and interest:(18)score=1001+adistb.Obviously, this formula can map the distance to the score range of 0100. To solve the unknown parameters a and B in the formula, we need to know some pairs of fractions and distances. The above parameters can be solved from the scores and DTW distances of some experts in the experiment. Using the formula in this paper, even if the distance is larger or smaller than that in the test, the score can be reasonably converted to the interval of 100 to 0 [18]. As two characteristic parameters are actually used, the actual score estimation formula is slightly more complex than the above formula, and the final score is shown in the following weighted sum formula of the two:(19)score=w1∗1001+a1dist1b1+w2∗1001+a2dist2b2.The unknown parameters in the formula meet certain restrictions:a1,a2,b1,b2>0, w1+w2=1. a1,a2,b1,b2 are the parameters of converting distance into fraction, and w1,w2 are the weights of three features.


## 4.2. HMM-Based Scoring Method

The competition using the HMM speech model is another alternative to speech competition, starting with voice, and hoping to see the difference between the experimental speech and the acoustic structure and the music and score words accordingly [19].The flow of the scoring system is shown in Figure10. Preprepared acoustic modeling and music modeling are used as the answer model using speech recognition technology, and the differences in speech test and models are identified and scored, working with the scoring mechanism [20–28].Figure 10
Flowchart of scoring system.The most common method based on the HMM model is to provide telephony. Procedures include logistics scores and postevent scores. Compared to comparison scores, the type of approach for some shows the learner’s ability to speak rather than the data that influences the differences between learners and speakers. Its definition is as follows:(20)Si=∑t=τiτi+1−1lgPqt|qt−1Pot|qt,where Ot and qt are the analysis vectors of phase t and state of HMM. The definition of a model is, then, the result of a change state; that is, A in the HMM model is the resultant distribution of the probe vector, which is B in HMM.Scoring method for sentences is as follows:(21)s=∑WiSi∑Wi,where S is the sentence score, Si is the sound score, and Wi is the weight song. The advantages of registration do not apply to data. After combining the advantages and disadvantages of the various dialing algorithms, the system uses an HMM-based phoneme-based probability algorithm as a call measurement method.HMM Back Probability-Based Score: since speaking of sentences for elementary English students is also slow, speech speed should be increased as a significant impact on speech scores. Finally, the score of phoneme duration can be defined as follows:(22)D=1N∑i=1Nlgpfdi|qi,where di is the duration of segment i corresponding to phoneme qi and fdi is the normalization function. Considering the independence of text and speaker, the speech duration is normalized by the measurement of speech rate (ROS). ROS is the number of phonemes per unit time in a sentence or in all utterances of a speaker. Generally, fdi=ROS∗di is taken.


## 4.3. Error Detection

After the recognition and scoring process of forced association of phonemes, MFCC eigenvalues get the corresponding associated phoneme string, phoneme start time and end time, and score. On the basis of these results, we began to detect phoneme errors. According to the results of the most phoneme like judgment, we can roughly divide phoneme reading errors into three categories: misreading, missing reading, and adding phonemes. Define the most phoneme like phoneme as the phoneme formula with maximum HMM likelihood:(23)qi′=argMaxLiq.Liq is the likelihood formula of any factor q in time period i:(24)Liq=Pq|Qi=∑t=σiσi+1−1Pst|st−1Pot|st.Missed phoneme:qi is not pronounced, as in the following formula:(25)qi=qi−1qi+1SIL.Mispronunciation element: the pronunciation ofqi is so wrong that it sounds more like another pronunciation. It is expressed as qi+1, and it is not a missed phoneme error. At the same time, it is believed that qi is misread as qi.Adding phoneme: there are redundant phonemes in the phoneme recognition result.The results obtained by the correlator cannot distinguish the three errors. The error detection module can only locate the wrong phoneme according to the phoneme score. If it wants to go further, it needs to get the phoneme recognition results through the recognition process to determine which error it belongs to. Two error detection methods can be designed to meet the above different requirements.If it is not required to detect the error type, the correlator can first evaluate the phoneme level correlation score of the speech and set the threshold value. When the corresponding phoneme score is lower than the threshold value, the phoneme will be classified as the wrong phoneme. If you need to detect specific types of errors, you need to add a phoneme recognition process.


## 4.4. Experimental Simulation and Result Analysis

### 4.4.1. Data Source

These lines use Arabic-language digital data installed in the UCI machine training library developed by the Automatic Alarm Laboratory of Baji-Mokhtar University. This data is called an Arabic number after the MFCC has resolved 13 conflicts in a total of 8800 dialog boxes (88 callers, 10 Arabic numerals, each number repeated 10 times). The call was made by 44 men and 44 women ages 16–40.The content of this article is about 24 undergraduate students of our college, including 15 boys and 9 girls. The content is recorded using a 16 kHz, 16-bit encoding sampling program, CoolEdit. There are 10 written sentences, which are usually in English.


### 4.4.2. Recognition Rate Test

Acknowledgment level is the fact that the platform can accept user feedback. This is especially important because it is one of the most important measures in the performance of cognitive skills. On the platform, only the speech test module uses the speech experience. Therefore, only a test run of these models was conducted here to ensure that the training platform was able to recognize the English characters that had been developed in the past. In addition, the ambient noise makes it difficult to get the sound at the time. To perform the test, a sample library of recorded sounds was used in the experiment, namely, 3 true and 3 unrecorded sounds. To reduce the impact of ambient noise, a quiet room is the best place for this experiment. Table1 provides information on platform level testing.Table 1
Speech recognition test results.
Test resultTest 1Test 2Test 3Test 4Test 5Test 6AccuracyCorrectCorrectCorrectErrorErrorErrori1111100.98u1111111a1001110.56e0010110.73In the text above, 1 is true and 0 is incorrect. The above tips check if you know the phonetic symbols in English. In terms of acknowledgment, verbal analysis is a great way to measure the accuracy of speech and then learn the English depth of symbols combined with other functions of the platform. Therefore, based on the benefits of the accreditation level of speech screening, we can achieve the training benefits mentioned in this paper.


## 4.4.1. Data Source

These lines use Arabic-language digital data installed in the UCI machine training library developed by the Automatic Alarm Laboratory of Baji-Mokhtar University. This data is called an Arabic number after the MFCC has resolved 13 conflicts in a total of 8800 dialog boxes (88 callers, 10 Arabic numerals, each number repeated 10 times). The call was made by 44 men and 44 women ages 16–40.The content of this article is about 24 undergraduate students of our college, including 15 boys and 9 girls. The content is recorded using a 16 kHz, 16-bit encoding sampling program, CoolEdit. There are 10 written sentences, which are usually in English.


## 4.4.2. Recognition Rate Test

Acknowledgment level is the fact that the platform can accept user feedback. This is especially important because it is one of the most important measures in the performance of cognitive skills. On the platform, only the speech test module uses the speech experience. Therefore, only a test run of these models was conducted here to ensure that the training platform was able to recognize the English characters that had been developed in the past. In addition, the ambient noise makes it difficult to get the sound at the time. To perform the test, a sample library of recorded sounds was used in the experiment, namely, 3 true and 3 unrecorded sounds. To reduce the impact of ambient noise, a quiet room is the best place for this experiment. Table1 provides information on platform level testing.Table 1
Speech recognition test results.
Test resultTest 1Test 2Test 3Test 4Test 5Test 6AccuracyCorrectCorrectCorrectErrorErrorErrori1111100.98u1111111a1001110.56e0010110.73In the text above, 1 is true and 0 is incorrect. The above tips check if you know the phonetic symbols in English. In terms of acknowledgment, verbal analysis is a great way to measure the accuracy of speech and then learn the English depth of symbols combined with other functions of the platform. Therefore, based on the benefits of the accreditation level of speech screening, we can achieve the training benefits mentioned in this paper.


## 4.5. Speech Evaluation Experiment

In this paper, the correlation coefficient and the Pearson correlation coefficient are used to illustrate the relationship between the measurement technology and the measurement book.Depending on the speech characteristics of college students who have different levels of English proficiency, we have different measures (movement, speed, tone, and music) and measured widely, as recommended by English experts. Levels of detailed information and related assessment models are shown in Table2.Table 2
Artificial evaluation grade and evaluation standard.
GradeIntonationSpeed of speechRhythmIntonationPopulationAComplete and correct content, clear and fluent pronunciation, no obvious pronunciation errorModerate speaking speedAccurate accent pronunciation, strong sense of rhythmAccurate and natural intonationExcellent pronunciationBRelatively complete and accurate content, relatively clear and fluent pronunciation, no serious pronunciation errorSpeak a little fast (slow)More accurate accent pronunciation, with a good sense of rhythmAccurate and natural intonationGood pronunciationCBasically complete and correct content, basically clear and fluent pronunciation, pronunciation errors that affect understandingSpeaking fast (slow)Ordinary accent pronunciation, with a certain sense of rhythmBasically accurate intonation, but not natural enoughGeneral grasp of pronunciationDIncomplete and accurate content, pronunciation not clear and fluent, and serious pronunciation errors that affect understandingSpeaking too fast (slow)Accent pronunciation error, too many (less) accents, poor sense of rhythmInaccurate and unnatural tone of voicePoor overall pronunciationThis book was reviewed by two college English teachers. They assessed 10 sentences of English speaking written by 24 high school students one by one, including 4 marks in music, fast, melodic, vocal music, and general measurement. Pearson correlation coefficient is used in this paper to evaluate the reliability of the book review results, because the content of the teachers during the book review will affect evaluation results.To make it easier to calculate, the levels A, B, C, andD of the scale were changed to 4, 3, 2, and 1, respectively. Pearson’s relationship analysis (two experiments) found that the scores of four measures, namely, noise, velocity, noise, and tone, were correlated (r > 0, P<0.05) for each group, regardless of total scores. This suggests that both instructors can follow the same measurement standards during the test and measure the reliability of the test data.In addition, the results of the two teacher evaluations were averaged (e.g., the average of students’ scores on different sentences). The score is the end of the measurement book.


## 4.6. Inspection of Evaluation Indicators

The procedure described in this paper can measure volume, speed, and intonation of 240 samples in 10 sentences of 24 students. Test results are found in Tables3 and 4.Table 3
Evaluation index test results: number of samples.
Index number of samplesConsistentOne-level differenceTwo-level differenceThree-level differenceIntonation2063220Speed of speech1974300Rhythm2043330Intonation1934541Table 4
Evaluation index experimental results: statistical index.
Index difference levelConsistency rate (%)Adjacent consistency rate (%)PearsonIntonation87.2599.580.7Speed of speech82.081000.493Rhythm85.0098.750.543Intonation81.0098.340.627For intonation testing, there were only 207 models with the same level of measurement technology, manual measurement, one-level difference, two-level difference, and no three-level difference. This shows that the machine and manual ratios have a correlation of 87.25%, the adjacent coefficient is up to 99.58%, and the Pearson correlation coefficient is 0.7, indicating that the method in this article is reliable.For speech speed measurement, there were 197 models at the same level of measurement technology and manual test, 43 models with one-level difference, and two or three with different levels. This shows that the machine and manual speed correlation coefficient are 82.08%, the correlation coefficient is up to 100%, and the Pearson correlation coefficient is 0.493, indicating the reliability of the velocity measurement.In terms of test results, there were 204 models of the same stage of machine testing and test manual, 33 models with one-stage difference, and only 3 models with two stages difference, without three-stage difference. This means that the accuracy levels of the machine and manual assembly are as high as 85%, the relative safety rating is as high as 98.75%, and the Pearson correlation coefficient is 0.543, indicating that the measure of consistency is reliable.For sound analysis, there were 192 models of the same level of measurement machine and manual test, 44 models with one-level difference, and only 4 models with two-level difference, no three-level difference. This shows that the machine and the manual correlation coefficient are 81%, the cohesive position is 98.34%, and the Pearson correlation coefficient is 0.627, indicating that the correction of this is reliable. In conclusion, the language, speed, atherosclerosis, and intonation assessment methods used in this article are reliable and can be used to improve the English language standard.


## 5. Conclusion

According to the English pronunciation habits of Chinese people, this paper studies and establishes a targeted corpus. Combined with the needs of Chinese speaking learners, it explains and compares the relevant technologies at each stage in the processing of users’ voice. In the speech endpoint detection phase, this paper uses a combination of short-time zero-crossing rate and short-time energy to detect the endpoint of speech. In the speech comparison phase, this paper uses the improved DTW algorithm to recognize the speech similarity. Compared with the traditional DTW algorithm, it speeds up the recognition time and speed, and the recognition effect is better.The HMM-based phoneme probability algorithm is ideal. It is not easy to change due to changes in students’ personal characteristics or sounds and better to show similarities between students’ words and speech patterns. HMM-style speech recognition technology is used to determine Viterbi’s language, and acknowledgment scores are made with subsequent results. Speech scores based on comparisons and patterns will appear to be studied using techniques such as decomposition of feature parameters, forced coupling, and dynamic distortion time, and some scores mechanisms were studied and their numbers were included in the experiment.This paper examines the English-speaking skills of college students in China as educational materials, improves the process of measuring the computer English proficiency, and measures various elements such as music, pace, and melody. We performed speed measurement according to the time of speech of the different characteristics of the frequency, noise measurement as a measure of the energy of the short time and the combination, and sound measurement according to the basic frequency. The results of the experiment show that the melody, tempo, rhythms, and musical measurements used in this article are reliable. In addition, taking into account the weight of the above measurements, the retrospective measurement has developed a model for the appropriate measurement and objective of the quality of the quotation. The results of the experiment show that the standard English proficiency test in this article is reliable. It provides students with timely, accurate, and objective analysis and instructional strategies and assists students in identifying differences in their speech and speech patterns, correcting their mispronunciation, and improving the effectiveness of teaching English.



---

*Source: 6519228-2022-08-28.xml*