<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Artif. Intell.</journal-id>
<journal-title>Frontiers in Artificial Intelligence</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Artif. Intell.</abbrev-journal-title>
<issn pub-type="epub">2624-8212</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frai.2025.1639147</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Artificial Intelligence</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Arabic speech recognition model using Baidu&#x00027;s deep and cluster learning</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Al-Anzi</surname> <given-names>Fawaz S.</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2910767/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Sundaram Thankaleela</surname> <given-names>Bibin Shalini</given-names></name>
<uri xlink:href="http://loop.frontiersin.org/people/3169391/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
</contrib-group>
<aff><institution>Department of Computer Engineering, College of Engineering and Petroleum, Kuwait University</institution>, <country>Kuwait</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Shadi Abudalfa, King Fahd University of Petroleum and Minerals, Saudi Arabia</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Miodrag Zivkovic, Singidunum University, Serbia</p>
<p>Judy Simon, SRM Arts and Science College, India</p>
<p>Nourredine Oukas, University of Bouira, Algeria</p>
<p>Aadil Ganie, Universitat Polit&#x000E8;cnica de Val&#x000E8;ncia, Spain</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Fawaz S. Al-Anzi <email>fawaz.alanzi&#x00040;ku.edu.kw</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>04</day>
<month>09</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>8</volume>
<elocation-id>1639147</elocation-id>
<history>
<date date-type="received">
<day>01</day>
<month>06</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>11</day>
<month>08</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2025 Al-Anzi and Sundaram Thankaleela.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Al-Anzi and Sundaram Thankaleela</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>This study involves extracting the spectrum from the Arabic raw, unlabeled audio signal and producing Mel-frequency cepstral coefficients (MFCCs). The clustering algorithm groups the retrieved MFCCs with analogous features. The K-means clustering technique played a crucial role in our research, enabling the unsupervised categorization of unlabeled Arabic audio data. Employing K-means on the extracted MFCC features allowed us to classify acoustically similar segments into distinct groups without prior knowledge of their characteristics. This initial phase was crucial for understanding the inherent diversity in our diverse sampled dataset. Dynamic Time Warping (DTW) and Euclidean Distance are utilized for illustration. Classification algorithms such as Decision Tree, eXtreme Gradient Boosting (XGBoost), K-Nearest Neighbors (KNN), and Random Forest are used to classify the various classes obtained based on clustering. This study also demonstrates the efficacy of Mozilla&#x00027;s Deep Speech framework for Arabic speech recognition. The core component of deep speech is its neural network architecture, which consists of multiple layers of Recurrent Neural Networks (RNNs). It strives to comprehend the intricate patterns and interactions between spoken sounds and their corresponding textual representations. The clustered labeled Arabic audio dataset, along with transcripts and Arabic Alphabets, is used as input to Baidu&#x00027;s Deep Speech model for training and testing purposes. PyCharm, in conjunction with Python 3.6, is used to build a Dockerfile. Creating, editing, and managing Dockerfiles within PyCharm&#x00027;s IDE is simplified by its functionality and integrated environment. Deep speech provides an eminent Arabic speech recognition quality with reduced loss, word error rate (WER), and character error rate (CER). Baidu&#x00027;s Deep Speech intends to achieve high performance in both end-to-end and isolated speech recognition with good precision and a low word rate and character error rate in a reasonable amount of time. The suggested strategy yielded a loss of 276.147, a word error rate of 0.3720, and a character error rate of 0.0568. This technique increases the accuracy of Arabic automatic speech recognition (ASR).</p></abstract>
<kwd-group>
<kwd>clustering</kwd>
<kwd>language model</kwd>
<kwd>acoustic model</kwd>
<kwd>Baidus deep speech</kwd>
<kwd>RNN</kwd>
<kwd>deep learning</kwd>
</kwd-group>
<contract-sponsor id="cn001">Kuwait University<named-content content-type="fundref-id">https://doi.org/10.13039/501100004482</named-content></contract-sponsor>
<counts>
<fig-count count="18"/>
<table-count count="6"/>
<equation-count count="14"/>
<ref-count count="44"/>
<page-count count="20"/>
<word-count count="11667"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Natural Language Processing</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Speech acts as a gateway in communicating our ideas through different vocal sounds and is a powerful tool that shapes our world. The study of speech signals and the techniques used to process them is known as speech processing. Modern automatic speech recognition (ASR) systems replace the conventional human&#x02013;machine interface in various commercial applications. Through the application of linguistics and computer science, ASR systems can interpret spoken words and translate them into text. This enables voice-activated device interaction, message dictation, and generation of transcripts from recordings. Recent developments in artificial intelligence (AI), particularly natural language processing (NLP), have focused on using AI applications for ASR. Researchers have investigated morphological analysis, resource building, and machine translation for the Arabic language. Speech and language disorders are a side effect of many diseases, and devices like the Servox Digital Electro-Larynx (EL) can generate quasi-clear voices for people with disorders (<xref ref-type="bibr" rid="B29">Mohammed Ameen and Abdulrahman Kadhim, 2023</xref>). The respiratory, phonatory, and articulatory end organs are all involved in the intricate neurological process of speech (<xref ref-type="bibr" rid="B31">Musikic et al., 2025</xref>). Acoustic media and background noise can disrupt and interfere with speech communication. Vocalization system damage can affect the efficiency of voice recognition and voice clarity (<xref ref-type="bibr" rid="B26">Liu et al., 2025</xref>). ASR is useful in many domains, including the development of accessible applications to transforming human&#x02013;machine communication. Speech recognition automatically identifies and translates a person&#x00027;s spoken words based on the data available in a speech waveform and its historical data feed. The evolution of deep learning has changed the ASR landscape in conjunction with Recurrent Neural Network (RNNs), deep neural networks (DNNs), and convolutional neural networks (CNNs). Deep neural networks are multilayered artificial intelligence that learns from data. They are inspired by the structure of the human brain, and these layers enable them to handle challenging issues. Deep neural networks, which have been trained on enormous datasets, modify their internal connections to identify patterns and carry out tasks such as speech translation and image recognition. The ability of CNNs to extract intricate patterns from audio input has been inspiring. Baidu&#x00027;s Deep Voice enhances voice recognition precision in noisy situations, as well as in far-field and reverberant conditions (<xref ref-type="bibr" rid="B6">Ahmed and Ghabayen, 2017</xref>; <xref ref-type="bibr" rid="B27">Masterson, 2015</xref>). MFCCs effectively decipher sound content in speech and audio processing. The MEL scale considers how our ears interpret pitch and frequencies with similar sounds. Applications such as speech recognition systems can interpret speech data by evaluating MFCCs. A clustering algorithm is a specific set of instructions that tells a computer how to automatically group data points into clusters. The study addresses the issue of unlabeled Arabic audio data by applying an unsupervised clustering algorithm to analyze and structure the corpus, uncovering acoustic patterns, speaker variabilities, and environmental conditions. These insights inform effective data handling strategies and the training of Arabic Deep Speech ASR models. These algorithms are used in unsupervised learning, where the data does not have predefined labels. There are many clustering algorithms, but one of the popular popular ones is K-means. Algorithms such as Hierarchical clustering, Mean shift clustering, Gaussian mixture model, Affinity propagation, and K-means clustering are widely available to group different patterns of MFCCs (<xref ref-type="bibr" rid="B7">Al-Anzi and Shalini, 2024</xref>).</p>
<p>The primary objective of this study is to develop an ASR system that automatically transcribes spoken utterances into a textual format. Our approach utilized a database consisting of Arabic audio recordings, which encompassed news broadcasts, public speeches, and various general recordings of individuals. The primary objective of our study is to extract the Mel-frequency coefficients necessary for ASR from the unlabeled Arabic audio dataset. We employed a clustering approach, with the clusters organized according to the KNN algorithm to label the collected MFCCs. The retrieved MFCCs are categorized according to their auditory characteristics. We have utilized Baidu&#x00027;s Deep Speech model to transcribe spoken language into text. The input given to the model is our clustered Arabic audio dataset along with its transcribe and alphabet. We also assessed the word error rate (WER) and character error rate (CER) of the transcribed results from the audio datasets. We have labeled the clustered dataset using a speech recognition pretrained model from the klaam library, categorizing it as Modern Standard Arabic (MSA), Egyptian Arabic (EGY), and Gulf Arabic (GLF) based on dialects. We have trained the model using different machine learning algorithms to categorize the dialects and assess accuracy, loss, and evaluation metrics for the clustered results.</p>
<p>The subsequent sections of the article are structured as follows: A concise literature overview encompassing ASR, diverse languages and accents in ASR, end-to-end speech processing, and the deep learning architectures that facilitate speech recognition, concluding with a clearly defined research gap, along with the methodologies and materials. Includes fundamental architecture, data collection, data analysis, MFCC analysis, clustering of MFCC characteristics, classification, performance evaluation, findings, debates, conclusion, and future scope.</p>
</sec>
<sec id="s2">
<title>2 Literature review</title>
<p>The study by <xref ref-type="bibr" rid="B6">Ahmed and Ghabayen (2017)</xref> proposes three methods to improve Arabic automatic speech recognition. They are listed in the following order: utilizing a Decision Tree to generate alternative pronunciations, modifying a native acoustic model with a different native model, and text processing to improve the language model. By employing these methods, the word error rate was reduced. The methodology of the paper showed how deep speech recognition models can integrate over time with long, adjustable windows (<xref ref-type="bibr" rid="B6">Ahmed and Ghabayen, 2017</xref>).</p>
<sec>
<title>2.1 Automatic speech recognition</title>
<p>In the study by <xref ref-type="bibr" rid="B23">Keshishian et al. (2021)</xref>, ASR aims to enable computers to identify and interpret human speech as accurately as possible. Many techniques can be used to implement speech recognition models. The author utilized one of the newest techniques for speech recognition, which employs neural networks with deep learning. An overview of the research conducted on Arabic voice recognition is given in the paper by Wlgihab et al. It also sheds some light on the facilities and toolkits available for Arabic voice recognition system development (<xref ref-type="bibr" rid="B8">Algihab et al., 2019</xref>). A vast array of products has been developed that efficiently leverage ASR to enable communication between humans and machines by Karpagavalli and Chandra et al. Speech recognition applications exhibit reduced performance in the presence of reverberation or minimal background noise (<xref ref-type="bibr" rid="B21">Karpagavalli and Chandra, 2016</xref>). Both acoustic and text transcriptions are used during the entire training process of ASR neural network systems.</p>
<p>The study by Belinkov et al. compares phonemes and graphemes along with different articulatory properties to evaluate the representation quality across a range of classification tasks. The study analyzes three datasets and two languages, Arabic and English, and demonstrates how consistently different features are represented across deep neural network covers (<xref ref-type="bibr" rid="B14">Belinkov et al., 2019</xref>). The purpose of the study by Abdul et al. is to discuss the applications of the MFCC as well as certain problems with its calculation and how they affect the model&#x00027;s performance (<xref ref-type="bibr" rid="B1">Abdul and Al-Talabani, 2022</xref>). An enhanced Mel-frequency cepstral coefficients (MFCC) feature for unsupervised marine target clustering is presented in the research. It exhibits a high success rate for multitarget or depth-target clustering as well as strong anti-interference capabilities (<xref ref-type="bibr" rid="B44">Yang and Zhou, 2018</xref>). The Short-Time Fan-Chirp Transform (FChT), a novel technique for time-frequency analysis of speech signals, is presented in this study (<xref ref-type="bibr" rid="B22">K&#x000E9;pesi and Weruaga, 2006</xref>). It enhances spectral and time-frequency representation, making it appropriate for filtering applications. Taking contextual considerations into account, this method examines speech processing to quantify controllable speech features across a variety of talker populations, noise levels, competing speakers, and the channel through which it is conveyed (<xref ref-type="bibr" rid="B35">Pitton et al., 1996</xref>).</p>
<p>The study by Abushariah et al. gave a framework for designing a speaker-independent automatic Arabic speech recognition system using a phonetically rich speech corpus. The system uses Carnegie Mellon University&#x00027;s Sphinx tools and Cambridge HTK tools and uses three-emitting state Hidden Markov Models for tri-phone-based acoustic models. The system achieved word recognition accuracy of 92.67 and 93.88% for similar speakers with different sentences, and a Word Error Rate of 11.27 and 10.07% with and without diacritical marks (<xref ref-type="bibr" rid="B2">Abushariah et al., 2012</xref>). A simple word decomposition algorithm presented by Afify et al. requires a text corpus and affix list, improving WER by 10% in Iraqi Arabic ASR. The algorithm also reduces WER by 13% relative (<xref ref-type="bibr" rid="B3">Afify et al., 2006</xref>). The research presented by Ali Ahamed et al. shows a novel methodology for assessing ASR in languages lacking a standardized orthographic system. The authors solicited five distinct users to transcribe speech segments, subsequently integrating the alignments from numerous references and presenting a revised WER. The findings indicated an average WER of 71.4 and 80.1%, respectively.</p>
</sec>
<sec>
<title>2.2 Different languages, ascent speech recognition</title>
<p>To build high-performing recognizers for two radically different languages, such as Mandarin and English, the authors Amodei et al. looked into a variety of network topologies and found a few helpful techniques, such as look-ahead convolution for unidirectional models, and enhanced numerical optimization using SortaGrad and Batch Normalization (<xref ref-type="bibr" rid="B12">Amodei et al., 2016</xref>). In the study by Nahid et al., they investigated the capacity of the DeepSpeech network to recognize unique Bengali speech samples. Recurrent Long Short-Term Memory (LSTM) layers form the foundation of this network, which models internal phoneme representations. At the bottom, convolutional layers are added, which removes the requirement to assume anything about internal phoneme alignment. The model was trained using a connectionist temporal classification (CTC) loss task, and the transcript was generated by casting a beam search decoder. On the Bengali real number speech dataset, the developed method produced a lower word error rate and a character error rate (<xref ref-type="bibr" rid="B33">Nahid et al., 2019</xref>).</p>
<p>In the study by <xref ref-type="bibr" rid="B36">Priyank Dubey (2023)</xref>, they discussed that the transcription of spoken speech can be extracted from the waveform using ASR. Mozilla Deep Speech is among the most recent, according to Baidu&#x00027;s Deep Speech research report. Through end-to-end deep learning, the state-of-the-art deep voice recognition system was developed. A properly optimized RNN is used with several Graphical Processing Units (GPUs). Its generalizability to other English accents is limited because American English accents make up the majority of the datasets used in this training. In this study, researchers used the most recent Deep Voice model, Deep Speech-0.9.3, to create an Indian-English speech recognition system from beginning to end for dialects. In the study by <xref ref-type="bibr" rid="B43">Xu et al. (2020)</xref>, the focus of the research was on a real-time German speech-to-text system that was constructed using numerous German language datasets. Researchers in this study optimized DeepSpeech for teaching a current German speech-to-text prototype by combining multiple German datasets. Moreover, they achieved strong WER rates. The model discussed in the study by Ai-Zaro et al. produces the WER/PER of 3.11 and 6.18% (<xref ref-type="bibr" rid="B11">Al-Zaro et al., 2025</xref>).</p>
<p>Literature (<xref ref-type="bibr" rid="B19">Iakushkin et al., 2018</xref>) explains how a voice recognition system for the Russian language is made using DeepSpeech. The foundation was the Mozilla Corporation&#x00027;s DeepSpeech English implementation, which is available as open-source software. The system was trained in a containerized environment using Docker technology. A dataset of Russian literary audio recordings made available on <ext-link ext-link-type="uri" xlink:href="https://voxforge.com">voxforge.com</ext-link> was used, and the best WER was 18%. A study by <xref ref-type="bibr" rid="B28">Messaoudi et al. (2021)</xref> proposes an end-to-end method for building Tunisian language communication systems based on deep learning. The paired text-speech dataset in the Tunisian dialect created for this proposal is called &#x0201C;TunSpeech.&#x0201D; Furthermore, the current Modern Standard Arabic (MSA) speech data were combined with dialectal Tunisian speech data to lower the Out-of-Vocabulary rate.</p>
</sec>
<sec>
<title>2.3 End-to-end speech processing</title>
<p>Research (<xref ref-type="bibr" rid="B24">Kim et al., 2017</xref>) offers a novel end-to-end speech recognition method that leverages a hybrid CTC-attention model within a multitask learning framework to boost resilience and accelerate convergence, thereby reducing the alignment issue. An experiment using the WSJ and CHiME-4 tasks demonstrates its superiority over the CTC and attention-based encoder-decoder baselines, yielding 5.4&#x02013;14.6% relative improvements in CER. The study by <xref ref-type="bibr" rid="B5">Agarwal and Zesch (2020)</xref> utilizes a shared task on SwissText/KONVENS for a speech-to-text system. A neural network is trained end to end, using Mozilla DeepSpeech as its foundation. Data augmentation, post-processing, and transfer learning from standard English and German were utilized. The WER generated by the system is 58.9%.</p>
</sec>
<sec>
<title>2.4 Speech recognition using deep learning</title>
<p>In the study by <xref ref-type="bibr" rid="B34">Nedal Turab (2014)</xref>), a neural network technique was used to address phoneme recognition. Gaussian low-pass filtering produced improved voice signal quality and reduced noise, which was then used to train a neural network for system training. Study (<xref ref-type="bibr" rid="B9">Alrumiah and Al-Shargabi, 2023</xref>) tackles the important task of identifying classic Arabic speech for the 1.9 billion Muslims who recite the Quran. It proposes a model based on Deep Neural Networks (DNNs). With a 19.43% word error rate and a 3.51% character error rate, RNN-CTC outperformed the other models following its training on a 100-h dataset of Quran recordings. CNN was used to further reduce the word error rate. Paper (<xref ref-type="bibr" rid="B10">Alsayadi et al., 2021</xref>) presents Arabic diacritical mark-based ASR systems. To create a trustworthy and accurate Arabic ASR, a study by Alsayadi et al. looks at the application of cutting-edge end-to-end deep learning techniques. The acoustic characteristics used in these methods are the log Mel-Scale Filter Bank energies and the Mel-frequency cepstral coefficients. Enhancing discretized Arabic ASR is possible with CNN-LSTM and a new CTC-based ASR. When it comes to Arabic voice recognition, CNN-LSTM with a consideration basis outperforms both traditional ASR and the Joint CTC-attention ASR context (<xref ref-type="bibr" rid="B10">Alsayadi et al., 2021</xref>). The research by Ullah et al. utilized Arabic image datasets that have been gathered, consisting of 2,000 Arabic digit records and 900 Arabic phrase records from 24 native speakers. VGG-19 is a deep convolutional neural network with 19 weight layers and is used in this study to extract visual characteristics. Two different approaches, namely, the batch-normalized VGG-19 base model and the standard VGG-19 base model, are presented in the study. The test dataset produces the accuracy of 93% digit and phrase recognition, 97% phrase recognition, and 94%-digit acknowledgment rates (<xref ref-type="bibr" rid="B41">Ullah et al., 2022</xref>).</p>
<p>Nagamine et al. analyze a sigmoid DNN trained for a phoneme recognition task to characterize different aspects of the non-linear changes that occur in hidden layers. The more separable phone instances are handled by deeper layers of the network through a non-linear feature space transformation. The study describes how a deep neural network model learns by transforming the feature space in a non-uniform way through repeated non-linear transformations (<xref ref-type="bibr" rid="B32">Nagamine et al., 2016</xref>). In the study by <xref ref-type="bibr" rid="B18">Hori et al. (2018)</xref>, researchers investigate the impact of word-based RNN philological mockups language models (RNN-LMs) on end-to-end ASR performance. It includes a novel word-based RNN-LM which allows decoding with only word-based. Low WER is achieved by the proposed model for the WSJ Eval&#x00027;92 test set. In the study by <xref ref-type="bibr" rid="B15">Dendani et al. (2020)</xref>, the representational characteristics of a DNN trained for phoneme recognition were described. In the first hidden layer, node selectivity to specific articulation styles and locations appeared, and in the deeper layers, this selectivity became more pronounced. In the study by <xref ref-type="bibr" rid="B15">Dendani et al. (2020)</xref>, ASR is implemented using a Deep Auto Encoder (DAE). The results showed that the enhanced speech&#x00027;s accuracy was about 3.17 times better than the accuracy estimated before. Recent models and algorithms, such as Mozilla Deep Speech, have been developed, but their generalizability is limited due to their use of American&#x02013;English accent datasets (<xref ref-type="bibr" rid="B36">Priyank Dubey, 2023</xref>). The study by Srivathshan et al. proposes a hybrid Active Noise Cancellation (ANC) system that combines Secondary-Path Filtered Active Noise Control (SF-ANC) and a Fuzzy Adaptive Neuro-Fuzzy Inference System (FxANFIS) to improve noise reduction performance (<xref ref-type="bibr" rid="B39">Srivathshan et al., 2025</xref>).</p>
</sec>
<sec>
<title>2.5 Research gap</title>
<p>We haven&#x00027;t found any specific results from my more targeted searches for studies that directly combine Baidu&#x00027;s Deep Speech with cluster learning for Arabic speech recognition. Research on combining Baidu&#x00027;s Deep Speech and cluster learning for Arabic speech recognition has not yielded specific results, suggesting a lack of extensive exploration. However, studies using Deep Speech and cluster learning techniques have revealed challenges like language complexity and data limitations. This supports the hypothesis that this specific combination may not yet have been thoroughly investigated by researchers.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Methods and materials</title>
<p>The unlabeled Arabic audio dataset, along with the alphabet, is applied in the proposed work. The auditory data are converted and then hooked onto a sequence of probabilities spanning the characters in the alphabet. Second, this sequence of possibilities gives rise to a cast of characters. The first and second steps are made possible by a Deep Neural Network and an n-gram language model, respectively. The n-gram language model is trained on a text corpus, and the neural network is trained on corresponding text transcripts and audio files. To predict text from speech and prior text, respectively, both the language model and the neural model receive training. Generating (MFCC, Analog to Digital Conversion, Framing, Windowing, Discrete Fourier Transform conversion, Mel-Filter Banks Wrapping Frequency, Converting Mel Filter Banks to Log, Executing Discrete Cosine Transform, the Resultant MFCC Acoustic Model generation, Language Model creation, and Decoding algorithm with deep speech are the fundamental techniques employed in this system. They are all converted to a WAV setup and given a monaural aural canal with a sampling rate of 16,000 Hz and a depth of 16 bits for each value to allow our deep speech pipeline to read all audio clips.</p>
<p>Our unlabeled Arabic audio dataset was subjected to a clustering technique and was mainly used in the pre-processing and data interpretation phases. Since our original dataset was completely unlabeled, we used clustering to characterize acoustic diversity, which involves identifying distinct acoustic groups. The results obtained are manually tested against the transcribed text data. The clustering algorithm enables us to find hidden structures in the data by grouping the MFCC features. The MFCCs are derived from the available Arabic Audio datasets, which are further clustered based on their similar features using clustering algorithms. Machine learning algorithms are further introduced to classify the clusters. The combination of MFCC extraction, clustering, and classification provides an effective framework for extracting insightful information from Arabic speech data. Speech analysis tasks are a good fit for MFCCs because they capture the aspects of speech that are perceptible to humans. ASR allows voice-activated computer communication for individuals with physical disabilities. Mozilla&#x00027;s Deep Speech is one of the well-known ASR systems widely accepted and has shown remarkable progress in multiple languages, including Arabic. Baidu&#x00027;s Deep Speech framework is an open-source ASR system that converts spoken words into written language. This speech-to-text technology uses deep learning algorithms to translate spoken language into written text. Acoustic models, language, speech coherence, and performance evaluation are a few components of speech recognition models.</p>
<sec>
<title>3.1 Methodology</title>
<p><xref ref-type="fig" rid="F1">Figure 1</xref> depicts a detailed pipeline for processing Arabic audio data, incorporating both unsupervised and supervised machine learning methods alongside a deep learning model for transcription. The method commences with an Arabic Audio Corpus, which is subsequently input into a dataset preparation phase. MFCCs are recovered from this dataset, functioning as resilient acoustic characteristics. The characteristics subsequently undergo Clustering, wherein an unsupervised algorithm, presumably K-means, categorizes the audio segments according to their acoustic similarities. The speech recognition pretrained model by the klaam library labeled the clustered output as MSA, EGY, and GLF. The efficacy of the classification models is evaluated by metrics such as Precision, Recall, and F1-Score, with distinct results highlighting an emphasis on dialectal performance. The result of this clustering phase initiates a Training/Testing phase for traditional machine learning models, such as Decision Trees, XGBoost, Random Forest, and KNN, employed for a Classification task, presumably aimed at categorizing audio segments based on insights derived from the clustering. The classification outcomes, combined with the &#x0201C;Arabic Alphabets&#x0201D; input, facilitate the generation of labeled data, which is thereafter divided into 70% for training, 15% for testing, and 15% for validation. These annotated data are essential for training Baidu&#x00027;s DeepSpeech model, the fundamental element responsible for the Text Transcribe job, which converts Arabic audio into text. This integrated architecture exemplifies a multifaceted strategy for Arabic speech processing, amalgamating feature engineering, unsupervised learning, conventional classification, and deep learning to provide a holistic solution.</p>
<fig position="float" id="F1">
<label>Figure 1</label>
<caption><p>Methodology diagram with clustering and Baidu&#x00027;s deep speech.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0001.tif">
<alt-text>Flowchart illustrating an Arabic audio processing workflow. It starts with a dataset, followed by MFCCs, clustering, and classification. Training/testing with techniques like Decision Tree and Random Forest occur alongside evaluation parameters&#x02014;precision, recall, and F1 score. Labeled data undergoes a train-test split (70:15:15), with outputs labeled MSA, EGY, and GLF. Baidu Deep Speech processes this into a text transcript.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>3.2 Architecture of the speech recognition system</title>
<p><xref ref-type="fig" rid="F2">Figure 2</xref> shows the architecture of the Speech Recognition System. Deep neural networks are used in speech recognition to translate spoken words into written text. To extract significant acoustic properties, the spoken utterances are first preprocessed. The following steps correspond to the preprocessing, feature extraction phases, decoder, and model creation. The preprocessing block performs various operations on the speech signal, such as noise reduction and silence removal. After the noise reduction, the background noise gets removed. There will not be any background noise in the spoken signal after the preprocessing phase. Scaling the voice signal to a standard magnitude is known as normalization. The speech stream is divided into shorter segments through framing, and these segments typically last 20&#x02013;30 ms.</p>
<fig position="float" id="F2">
<label>Figure 2</label>
<caption><p>Architecture of the speech recognition system.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0002.tif">
<alt-text>Flowchart depicting a speech recognition process. It starts with spoken utterance, moves through acoustic front-end, feature extraction, and a search algorithm (decoder). Outputs interact with a deep neural network (DNN) and connect to language model, acoustic model, and pronunciation, resulting in hypothesized words or phonemes.</alt-text>
</graphic>
</fig>
<p>The process of extracting information from each voice signal frame is known as feature extraction. The acoustic properties of the voice signal are represented by these features. These characteristics are then applied to a series of models: an audio model forecasts the phoneme sequence, and a dialectal prototypical model uses the analysis of the previous word to predict the next. A decoder transforms the sequence into a string of words, enabling accurate speech-to-text conversion. This process uses a pronunciation dictionary to ensure accurate translation and proper word pronunciation. The retrieved features in the acoustic model, a statistical model, represent a set of phonemes. The language model is a numerical model that forecasts the next verse in a series based on the verses that have already been spoken. The decoder needs to convert the sequence of phonemes from the acoustic model into a word order. The last block in the diagram represents the word sequences that have been transcribed. A string of words represents spoken speech. Because DNNs can identify complex patterns in data, they are well-suited for voice recognition tasks.</p>
<sec>
<title>3.2.1 Probability theory for speech recognition</title>
<p>An ASR system&#x00027;s main objective is to infer the acoustic input O in <xref ref-type="disp-formula" rid="E1">Equation 1</xref>, the most likely discrete symbol sequence among all valid sequences in the language L (<xref ref-type="bibr" rid="B37">Rabiner and Juang, 1993</xref>).</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>O</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The symbol sequence to be recognized is N, given in <xref ref-type="disp-formula" rid="E2">Equation 2</xref>:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x02026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The fundamental ASR system goal and the probability are given in <xref ref-type="disp-formula" rid="E3">Equations 3</xref>, <xref ref-type="disp-formula" rid="E4">4</xref>.</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mtext class="textrm" mathvariant="normal">argmax</mml:mtext><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo>/</mml:mo><mml:mi>O</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E4"><label>(4)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo>/</mml:mo><mml:mi>O</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>O</mml:mi><mml:mo>/</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mtext>&#x000A0;</mml:mtext><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
</sec>
</sec>
<sec>
<title>3.3 Data collection</title>
<p>The Arabic audio dataset is our in-house dataset, which contains 4,071 audio samples from various fields, such as security and justice, Economy, Education, Health, Technology, and Sports. Each heading of data is subdivided into three levels of datasets, such as first, second, and third sets. Deep speech requires mono-channel audio files in WAV format with a sampling rate of 16 kHz and an encoding of 2 bytes per sample for all WAV files, so ensuring consistency in audio quality and format. This collection is categorized by speech type, comprising 733 spontaneous voice files and 588 read speech files, providing a varied representation of natural and controlled verbal expressions. The text linked to these audio recordings has an average length of 93.0 characters, reflecting a moderate complexity and vocabulary range within the collection. Ten to twenty-second passes are available between each voice sample. The more closely we match this, the longer or shorter the model will be. The alphabet.txt file contains a transcription of every character from the given voice clip. From the audio voice clip, all punctuation has been removed, including quotation marks, dashes, and other marks. Three sets of data were separated: test, validation, and training. Diacritical marks are used to show proper pronunciation or to provide phonetic guidance because the standard Arabic script does not provide enough information about pronunciation. Since deep speech operates at the character level, the inclusion of these representations influenced the generation of the acoustic model. Prediction possibilities rise based on the number of letters.</p>
</sec>
<sec>
<title>3.4 Data analysis</title>
<p>We have used a sample rate of 1,600 Hz for each audio data. The encoding of each wave file is 2 bytes per sample. Likely, spontaneous speech is used for our analysis. The number of spontaneous speech files is 733, and the number of speech files read is 588. The total number of training files is 1,321. The average text length is 93.0.</p>
<sec>
<title>3.4.1 Silence removal</title>
<p><xref ref-type="fig" rid="F3">Figure 3</xref> shows the signal after noise removal analysis of an Arabic signal. Arabic audio signals must be stripped of silent or low-energy segments by identifying and removing them. The advantages of silence removal include speech analysis for cleared content and improved speech clarity.</p>
<fig position="float" id="F3">
<label>Figure 3</label>
<caption><p>Raw and spectrogram of wave signals.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0003.tif">
<alt-text>Two-part image showing an audio analysis. The top part is a waveform with peaks and troughs representing sound amplitude over time, marked by red vertical lines at intervals. The bottom part is a spectrogram depicting sound frequency over time, with colored bands for intensity and labeled sections &#x0201C;Y,&#x0201D; &#x0201C;E,&#x0201D; and &#x0201C;S&#x0201D;.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>3.4.2 Time and frequency analysis of speech</title>
<p>The basic frequency of the vocal cords, which determines whether a voice is perceived as high or low, is referred to as pitch. Rapid alterations in the speech signals linked to consonants and other non-voiced sounds are known as transient features. The time-frequency distribution of the signal is mentioned as the frequency spectrum of the audio signal. The specific characteristics of the spectrum will depend on the speaker&#x00027;s voice, the content of the speech, and the recording conditions. Analyzing spectra gains valuable insights into the acoustic properties of speech signals and is helpful for speech recognition, speaker identification, and language understanding.</p>
</sec>
</sec>
<sec>
<title>3.5 Sampling</title>
<p>Digitalizing the continuous sound wave is necessary for audio signal sampling. We have digitized the sound wave for Arabic audio. To achieve this, the parameters of the sampling rate should be established to determine the frequency of signal measurement. We have used a sampling rate of 44.1 kHz and a bit depth of 16 bits for our Arabic speech for sampling one lengthy audio wave. The overall sampling rate is 16 kHz. <xref ref-type="fig" rid="F4">Figure 4</xref> shows the sampling frame of the audio signal. Spectra used horizontal and vertical axes to visually represent the energy distribution across time and frequency, respectively. The power of each combination is indicated by the intensity of the color. Common observations include darker areas, which are associated with high energy, and lighter areas, often linked to unvoiced sounds.</p>
<fig position="float" id="F4">
<label>Figure 4</label>
<caption><p>Sampling frame of an audio signal.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0004.tif">
<alt-text>Line graph showing fluctuating data points in red, with values ranging from negative six thousand to positive six thousand on the Y-axis and zero to over four hundred thousand on the X-axis.</alt-text>
</graphic>
</fig>
<sec>
<title>3.5.1 Discrete Fourier Transform</title>
<p>The windowed speech signal is subjected to DFT, which yields the signal&#x00027;s phase and magnitude representation. The Fast Fourier Transform (FFT) algorithm transforms time domain analysis to frequency domain analysis <xref ref-type="fig" rid="F5">Figure 5</xref> shows the FFT spectrum of an audio signal and the distribution of the energy that occurs at different frequencies for each segment. Dominant frequencies are those that indicate prominent tones, such as formants and pitch. The spectral content is used to reveal the presence of various frequency components. The sampling frequency of 1,600 Hz provides basic frequency analysis.</p>
<fig position="float" id="F5">
<label>Figure 5</label>
<caption><p>FFT recordings of wave.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0005.tif">
<alt-text>Bar chart showing the Fast Fourier Transform (FFT) of a recording sampled at 16000 Hz. The x-axis represents frequency up to 8000 Hz, and the y-axis represents amplitude. Peaks are prominent below 1500 Hz, tapering off as frequency increases.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>3.5.2 MFCC feature extractions</title>
<p>The process of extracting MFCC features is essential for comprehending speech content, which involves triangular filters. Standard FFTs linearly analyze frequencies of sound, but human hearing operates on a Mel scale. The output of the FFT is passed through triangle-shaped filters. We can capture the portions of the spectrum most pertinent to human hearing by adding the contributions of each filter, each of which focuses on a particular frequency range. The MFCC is the result of this Mel-focused representation. Filters are arranged logarithmically, except above 1,000 Hz, and are equally distributed. The equation used to compute Mel frequency is given in <xref ref-type="disp-formula" rid="E5">Equation 5</xref> (<xref ref-type="bibr" rid="B17">Gupta et al., 2013</xref>).</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Mel</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1127</mml:mn><mml:mtext class="textrm" mathvariant="normal">In</mml:mtext><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mn>700</mml:mn></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The changes in the speech from frame to frame can be calculated with the first and second MFCC coefficients. <xref ref-type="fig" rid="F6">Figure 6</xref> shows the block diagram of MFCC feature Extraction.</p>
<fig position="float" id="F6">
<label>Figure 6</label>
<caption><p>MFCC feature extraction.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0006.tif">
<alt-text>Flowchart depicting Mel Frequency Cepstral Coefficients (MFCC) extraction process. It begins with a speech signal, followed by pre-emphasis, frame blocking, windowing, and Mel filter bank application. The process concludes with Discrete Cosine Transform (DCT) and results in MFCC features. Arrows indicate the sequence of steps, with visual representations of each stage.</alt-text>
</graphic>
</fig>
<p>The audio signal is divided into frames. Windowing and FFT are applied to convert it to the frequency domain. Mel-scale filtering is used in accordance with human auditory perception and logarithmic compression. The discrete Cosine Transform is used to reduce dimensionality, and the resulting MFCCs can provide speaker independence, robustness against noise, and can be processed efficiently. They also capture the fundamental spectral characteristics of speech. <xref ref-type="fig" rid="F7">Figure 7</xref> shows the Mel power spectrum of the Arabic audio dataset.</p>
<fig position="float" id="F7">
<label>Figure 7</label>
<caption><p>Mel spectrogram.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0007.tif">
<alt-text>Mel power spectrogram depicting frequency in Hertz against time, highlighting intensity with a color gradient from purple to yellow. Intensity varies, with noticeable patterns and a brief pause around the twentieth second.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>3.5.3 MFCC statistics</title>
<p>The mean, standard deviation, maximum, and minimum values are represented in <xref ref-type="table" rid="T1">Table 1</xref>. The mean reveals the average emphasis on the frequency band within the speech. The speech data&#x00027;s standard deviation is a measure of its variability. The maximum and minimum values help in locating anomalies or errors made during the MFCC extraction process. A Discrete Cosine Transform is applied to each MEL filter band to extract MFCCs from the Mel spectrum.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>MFCC statistics.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Mean</bold></th>
<th valign="top" align="center"><bold>Standard deviation</bold></th>
<th valign="top" align="center"><bold>Maximum</bold></th>
<th valign="top" align="center"><bold>Minimum</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">&#x02212;52.965</td>
<td valign="top" align="center">8.573</td>
<td valign="top" align="center">&#x02212;19.167</td>
<td valign="top" align="center">&#x02212;88.341</td>
</tr></tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="F8">Figure 8</xref> shows the correlation heat map of the different Mel frequency coefficients. The degree of similarity between different MFCCs is shown by their correlation. The various MFCC features are represented by the rows and columns in the heatmap. The correlation between the features that correspond to the row and column is represented by the color of each cell. When two features have a positive correlation, that is, when they tend to rise or fall together, they are colored red. When two features are negatively correlated, one tends to increase while the other decreases, as indicated by blue. When the two features are uncorrelated, the color white is used. Every value on the heatmap&#x00027;s diagonal is 1.0, indicating that every feature has a perfect correlation with every other feature. Higher values indicate stronger correlations. The values of the diagonal range from &#x02212;1.0 to 1.0. MFCC captures the spectral envelope of audio signals based on the relative prominence of different frequency bands.</p>
<fig position="float" id="F8">
<label>Figure 8</label>
<caption><p>Correlation heat map.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0008.tif">
<alt-text>Correlation heatmap of MFCC features showing a grid with columns and rows labeled col1 to col5. Colors range from blue to red, indicating correlation strength from 0 to 1, with red representing high correlation and blue representing low.</alt-text>
</graphic>
</fig>
</sec>
</sec>
</sec>
<sec id="s4">
<title>4 Clustering and classification</title>
<p>MFCC features are clustered together using a clustering algorithm. As the labels are unknown to us, supervised learning is not a solution to the problem. An unsupervised learning method called K-means clustering will be used for grouping into clusters. The clustering divides data points into a fixed number of groups (K) based on their similarity. The first K data points are chosen at random to serve as the initial cluster centers. The nearest center is determined by averaging these assigned points. Repeating this process until the centers stabilize produces groups in which the data points are unique from those in other clusters and similar to each other within each cluster. Clustering is done based on the Euclidean distance in the MFCC feature space between data points. Three clusters are applied to MFCC features. The clustered data are scaled with a silhouette score. <xref ref-type="fig" rid="F9">Figure 9</xref> shows the three groups of clusters formed from MFCC correlation features. A silhouette score of 0.6918 was obtained in the clustering. The silhouette score is the metric used to assess the quality of clustering algorithms. It evaluates how well data points are assigned to their clusters. Scores range from &#x02212;1 to 1, with values closer to 1 indicating improved clustering.</p>
<fig position="float" id="F9">
<label>Figure 9</label>
<caption><p>Clustering of MFCC features.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0009.tif">
<alt-text>Scatter plot showing three clusters of data points, each colored differently: dark purple, teal, and yellow. The points are distributed diagonally from the bottom left to the top right, suggesting a positive correlation. Axes are labeled from negative five to positive four on both axes.</alt-text>
</graphic>
</fig>
<sec>
<title>4.1 Grid search</title>
<p>In machine learning, grid search is a technique used to determine a model&#x00027;s optimal settings, also known as hyperparameters. Each hyperparameter has a specific range, and the model is trained using all possible combinations from the different ranges. The performance of each combination is assessed, and the best combination is selected as an ideal set. Grid search CV finds the optimal solution based on the selected metric.</p>
</sec>
<sec>
<title>4.2 Classification</title>
<p>For multiclass classification tasks, the support vector machine classifier is used. A hyperparameter tuning method called grid search is used to maximize the performance of the SVM model. &#x0201C;Linear&#x0201D; and &#x0201C;rbf&#x0201D; for kernel and (<xref ref-type="bibr" rid="B29">Mohammed Ameen and Abdulrahman Kadhim, 2023</xref>; <xref ref-type="bibr" rid="B14">Belinkov et al., 2019</xref>) for C are the possible values that are explored for the two hyperparameters, &#x0201C;kernel&#x0201D; and &#x0201C;C.&#x0201D; The training data are fitted to the SVM model that performs the best. Confusion matrix and classification report metrics are used in performance evaluation.</p>
</sec>
</sec>
<sec id="s5">
<title>5 Baidu&#x00027;s deep speech</title>
<p>The state-of-the-art speech recognition system known as Deep Speech was developed using Baidu&#x00027;s end-to-end ASR architecture. A massive amount of speech data is trained using multiple GPUs and an RNN. Baidu&#x00027;s Deep Speech can learn directly from a large set of data, so it does not require speech adaptation or noise filtering. Deep RNN training will be based on supervised learning. From voice samples, mel-frequency cepstral coefficients are extracted, and transcription is output directly. A full voice recognition system powered by deep learning and its structure. The system generates a matrix of character probabilities, which shows that it gives each character in the alphabet a chance at each period step, indicating the likelihood that that particular character will match the audio. Furthermore, the Connectionist Temporal Classification (CTC) loss function increases the probability of accurate transcription. TensorFlow uses Baidu&#x00027;s Deep Speech Architecture to implement Mozilla Deep Speech, enabling the creation of prototypes for any dialect. It is simpler to operate and performs better in noisy environments than other traditional systems. This system&#x00027;s main advantage is that it outperforms traditional speech recognition systems, capable of handling speaker oscillation, echo, and background noise. From audio files, a time series spectrogram is produced, with each time slice representing a vector of audio characteristics. Three of the five unseen layers that comprise the RNN that powers the Deep Speech model are non-recurrent. <xref ref-type="fig" rid="F10">Figure 10</xref> shows the architecture of Baidu&#x00027;s Deep Speech system.</p>
<fig position="float" id="F10">
<label>Figure 10</label>
<caption><p>Baidu&#x00027;s Deep speech structure.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0010.tif">
<alt-text>Flowchart illustrating a speech recognition system. It begins with &#x0201C;Spoken Utterances&#x0201D; leading to &#x0201C;Preprocessing &#x00026; Feature Extraction,&#x0201D; then &#x0201C;Extracted Features.&#x0201D; These are processed by a &#x0201C;DNN based Unified Model,&#x0201D; followed by a &#x0201C;Decoder,&#x0201D; resulting in &#x0201C;Transcribed Word Sequences.&#x0201D; A conventional speech recognition system underlines this process with three components: &#x0201C;Acoustic Model&#x0201D; (feature to phoneme), &#x0201C;Pronunciation Dictionary&#x0201D; (phoneme to word), and &#x0201C;Language Model&#x0201D; (word to sentence).</alt-text>
</graphic>
</fig>
<sec>
<title>5.1 Acoustic model and language model</title>
<p>The acoustic archetypal generates a likelihood distribution over the characters of the alphabet in response to audio. The acoustic model takes up the majority of the training time. Typically, three steps are involved in the feature extraction process. The acoustic front end, also known as speech analysis, is the initial phase. It creates raw features by performing a type of temporal analysis of the signal&#x00027;s spectrum. The acoustic model&#x00027;s task is to use the sequence-to-sequence Deep Speech algorithm to identify which acoustic signals correspond to which specific letters. The language model helps translate these probabilities into comprehensible language words, followed by extensive labeled voice training on a large volume of data. The most important things to consider are the data that are rarely or never present in our training sets. We combine our system with one of these n-gram language models since they are readily trained from large unlabeled text datasets. Language models are typically trained by minimizing confusion on training data and by observing word sequences in text corpora that contain millions of word tokens. A variety of toolkits, including SRILM, KENLM, and open-game toolkits, are used to generate language models. It is necessary to train the linguistic model and the audio model with the same alphabet. alphabet.txt is the glue that holds the linguistic model and the acoustic model together. The neural network utilized in the acoustic model was trained on a corpus of voice and transcripts, which was created with TensorFlow. An n-gram model trained with KENLM is the morphological ideal, and the training data are a corpus of text. As inputs are fed into the network for a reference window of size k, the ith unit in a convolutional layer l at a timestamp t delivers M(l,i), as shown in <xref ref-type="disp-formula" rid="E6">Equation 6</xref>, which represents the architecture of a deep RNN using Arabic data.</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo>:</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Here, M(0) denotes the input, and it contains 13 units. &#x003C3;(.) is the activation function as in <xref ref-type="disp-formula" rid="E7">Equation 7</xref>, and the hidden fully connected layers use a Rectified Linear Unit (ReLU) activation function. We always constrain the output of a convolution unit to up to 5 (<xref ref-type="bibr" rid="B42">Wu et al., 2024</xref>).</p>
<disp-formula id="E7"><label>(7)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>&#x003C3;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo class="qopname">min</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo class="qopname">max</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>At any timestamp <italic>t</italic>, the units at layer l of the recurrent bidirectional LSTM take updates from both past and future timestamps, as shown in <xref ref-type="disp-formula" rid="E8">Equations 8</xref>, <xref ref-type="disp-formula" rid="E9">9</xref>.</p>
<disp-formula id="E8"><label>(8)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mover class="overset"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mrow></mml:mover><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x000B7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">M</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mover class="overset"><mml:mrow><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mrow></mml:mover><mml:mo>&#x000B7;</mml:mo><mml:mover class="overset"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mrow><mml:mo>&#x02192;</mml:mo></mml:mrow></mml:mover><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E9"><label>(9)</label><mml:math id="M9"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mover class="overset"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mrow><mml:mo>&#x02190;</mml:mo></mml:mrow></mml:mover><mml:mo>=</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x000B7;</mml:mo><mml:mtext class="textrm" mathvariant="normal">M</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mover class="overset"><mml:mrow><mml:msup><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>&#x02190;</mml:mo></mml:mrow></mml:mover><mml:mo>&#x000B7;</mml:mo><mml:mover class="overset"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mrow><mml:mo>&#x02190;</mml:mo></mml:mrow></mml:mover><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where &#x003C9;<sup><italic>l</italic></sup> is the input hidden weight matrix and <italic>U</italic><sup><italic>l</italic></sup> is a recurrent weight matrix. The sum of forward and backward directional states yields an &#x0201C;informed state&#x0201D; (hl), which is shaped by the prior transitional probabilities of the phonemes. The activation function tanh(.) acts like a squashing function, as shown in <xref ref-type="disp-formula" rid="E10">Equation 10</xref> (<xref ref-type="bibr" rid="B30">Morais, 2025</xref>).</p>
<disp-formula id="E10"><label>(10)</label><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mo class="qopname">tan</mml:mo><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x000A0;</mml:mtext></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msup><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The processed cepstral coefficients flow through the recurrent layers, and each upper layer receives this processed information from its immediate lower layer, which is given in <xref ref-type="disp-formula" rid="E11">Equation 11</xref>.</p>
<disp-formula id="E11"><label>(11)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The output is a softmax layer that gives a probability distribution over phonemes, shown in <xref ref-type="disp-formula" rid="E12">Equation 12</xref>.</p>
<disp-formula id="E12"><label>(12)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>o</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mo>/</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo>&#x003A3;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003C9;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>h</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The value of the output unit at any timestamp <italic>t</italic> will indicate the probability of the corresponding phoneme n as predicted by the network. The network is then trained using the CTC loss function, and the parameters of the network are updated using the backpropagation through time (BPTT) algorithm. Then 32-bit beam search decoder is used to construct the output from the phoneme distribution. The Term Frequency Inverse Document Frequency (TF-IDF) vectorizer is a useful tool for translating Arabic text data into numerical vectors. When analyzing text at the character level, it considers individual characters, pairs of characters, and triplets of characters. This is an important step for the Arabic script. It learns the vocabulary and term importance from the data and then creates TF-IDF vectors for each document. Based on the frequency of each term in the document and rarity across the dataset, these vectors indicate the relative importance of each term. Then, among other NLP tasks, these vectors can be used to train machine learning models for document classification, hidden topic identification, and document similarity comparison. The two main tasks completed by the vectorizer are stemming/lemmatizing Arabic text and normalizing it. The sample data are shown in <xref ref-type="fig" rid="F11">Figure 11</xref>.</p>
<fig position="float" id="F11">
<label>Figure 11</label>
<caption><p>Sample TF-IDF vectorizer data.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0011.tif">
<alt-text>A text-based table showing numbers and Arabic script. The top row contains numbers ranging from 100 to 1008, with ellipses indicating continuation. Below each number are values such as 0.00005 and specific Arabic words.</alt-text>
</graphic>
</fig>
<p>To calculate the probability of each sentence, the function counts the number of sentences (n-grams) that have been viewed so far, divides that count by the total number of sentences, and increases the count for each sentence. This is a basic method to determine the word or words that will appear next in a given sequence and to calculate the probability that a sentence will appear again based on how frequently it appears in the dataset. It separates Arabic text data into words, cleans it up, and calculates the probability that different word combinations (n-grams) will occur together. A sample prediction is shown in <xref ref-type="fig" rid="F12">Figure 12</xref>.</p>
<fig position="float" id="F12">
<label>Figure 12</label>
<caption><p>Sample n-gram prediction.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0012.tif">
<alt-text>Text in Arabic and English showing a search input and result. The input reads &#x0201C;Enter search words: &#x00643;&#x00627;&#x00643;&#x00627;&#x00627;&#x00644;&#x00628;&#x00631;&#x00627;&#x00632;&#x0064A;&#x00644;&#x0064A; &#x0201D;. Below are additional Arabic words: &#x0201C;&#x00646;&#x0064A;&#x00645;&#x00627;&#x00631;&#x0201D;, &#x00639;&#x00644;&#x00649;&#x0201D;, &#x0201C;&#x00641;&#x0064A;&#x0201D;, &#x0201C;&#x00631;&#x00648;&#x00646;&#x00627;&#x00644;&#x0062F;&#x0064A;&#x00646;&#x0064A;&#x00648;&#x0201D;. The output is a list containing these words: &#x0201C;[&#x00027;&#x00643;&#x00627;&#x00643;&#x00627;&#x00027;, &#x00027;&#x00646;&#x0064A;&#x00645;&#x00627;&#x00631;&#x00027;, &#x00027;&#x00639;&#x00644;&#x00649;&#x00027;, &#x00027;&#x00641;&#x0064A;&#x00027;, &#x00027;&#x00631;&#x00648;&#x00646;&#x00627;&#x00644;&#x0062F;&#x0064A;&#x00646;&#x0064A;&#x00648;&#x00027;]&#x0201D;, followed by &#x0201C;False, 5&#x0201D;.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>5.2 Augmentation and hyperparameter setup</title>
<sec>
<title>5.2.1 Baidu&#x00027;s deep speech hyperparameters</title>
<p>The majority of the hyperparameters in the preconfiguration for Mozilla Deep Speech remained unchanged. Nonetheless, the batch size was slightly modified in consideration of the machine&#x00027;s capabilities and the amount of training data. Furthermore, Deep Speech offers the ability to create checkpoints, allowing training to be resumed in the event of an error using the checkpoints. Either we create a checkpoint directory and store the training checkpoints there, or we freight the Deep Speech frontier directory containing the training checkpoints. Prediction accuracy is calculated using the loss. As the loss decreases, the difference between the neural network&#x00027;s predictions and the actual known values becomes smaller. When there is no reduction in loss, the parameter indicates how many training epochs should be considered as a plateau.</p>
<list list-type="bullet">
<list-item><p><bold>Hyperparameter optimization:</bold> Optuna is a framework utilized for hyperparameter optimization. It specifically adjusts lm_alpha, which is a language model weight, and lm_beta is a word insertion bonus. To reduce the WER and CER on a designated test set, it systematically assesses several combinations of these parameters, dynamically reinitializing the TensorFlow graph for each iteration and relaying intermediate performance metrics to Optuna, which subsequently directs the search intelligently and eliminates unpromising trials to enhance efficiency. The model ascertains whether to optimize for WER or CER according to the loaded scorer&#x00027;s mode and offers a definitive entry point for users to commence this essential post-training optimization procedure, yielding the optimal parameters and their associated performance.</p></list-item>
<list-item><p><bold>Reduce plateau</bold>: If training does not result in a decrease in loss over time, it is said to have plateaued. It is possible to break through the plateau and keep reducing losses by adjusting the learning rate and other parameters.</p></list-item>
<list-item><p><bold>Early stopping:</bold> If training does not eventually reduce loss, an early termination is an option.</p></list-item>
<list-item><p><bold>Dropout:</bold> When training produces a model with poor generalization, it is referred to as overfitting and has an impact on the model&#x00027;s generalizability. A method called &#x0201C;dropout&#x0201D; enhances the generalizability of the model by arbitrarily eliminating nodes from the neural network to lessen overfitting.</p></list-item>
<list-item><p><bold>Steps and Epochs:</bold> A training set&#x00027;s entire cycle is referred to as an epoch. Batch size affects how much memory is required for processing. Fifteen epochs and a batch size of four are employed for this optimization.</p></list-item>
<list-item><p><bold>Train&#x02013;test split:</bold> The training loop efficiently manages data loading, preprocessing, and augmentation, while enabling multi-GPU training by distributing computations across &#x0201C;towers&#x0201D; to average gradients for faster updates. Key components, including adaptive learning rate reduction during performance plateaus, early stopping to prevent overfitting, and thorough checkpointing, which entails retaining the best-performing model on a validation set, are integrated to ensure rapid and effective model development. This provides functionalities for autonomous evaluation of models on test datasets and the creation of efficient inference graphs, representing a complete solution for DeepSpeech model training and deployment. We have utilized 70% of the audio data for training 15% for testing, and 15% for validation.</p></list-item>
</list>
</sec>
<sec>
<title>5.2.2 Machine learning hyperparameters</title>
<p><xref ref-type="table" rid="T2">Table 2</xref> shows that the grid search method uses different values of hyperparameters in each run. The first run uses the C values of 73, 79, 50, and 52, while the second run uses the C values of 19, 81, 72, and 89. The fit and score time are mentioned in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Hyperparameters of grid search.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Scores</bold></th>
<th valign="top" align="center"><bold>Decision tree</bold></th>
<th valign="top" align="center"><bold>XGBoost</bold></th>
<th valign="top" align="center"><bold>KNN</bold></th>
<th valign="top" align="center"><bold>Random forest</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Mean fit time</td>
<td valign="top" align="center">0.0135</td>
<td valign="top" align="center">0.0317</td>
<td valign="top" align="center">0.0234</td>
<td valign="top" align="center">0.0293</td>
</tr>
<tr>
<td valign="top" align="left">Standard fit time</td>
<td valign="top" align="center">0.0007</td>
<td valign="top" align="center">0.0009</td>
<td valign="top" align="center">0.0020</td>
<td valign="top" align="center">0.0009</td>
</tr>
<tr>
<td valign="top" align="left">Mean score time</td>
<td valign="top" align="center">0.0037</td>
<td valign="top" align="center">0.0112</td>
<td valign="top" align="center">0.0030</td>
<td valign="top" align="center">0.0101</td>
</tr>
<tr>
<td valign="top" align="left">Standard score time</td>
<td valign="top" align="center">1.2655</td>
<td valign="top" align="center">4.6037</td>
<td valign="top" align="center">7.41052</td>
<td valign="top" align="center">1.0215</td>
</tr>
<tr>
<td valign="top" align="left">Mean test score</td>
<td valign="top" align="center">0.9973</td>
<td valign="top" align="center">0.9886</td>
<td valign="top" align="center">0.9980</td>
<td valign="top" align="center">0.9900</td>
</tr>
<tr>
<td valign="top" align="left">Standard test score</td>
<td valign="top" align="center">0.0020</td>
<td valign="top" align="center">0.0028</td>
<td valign="top" align="center">0.0019</td>
<td valign="top" align="center">0.0027</td>
</tr>
<tr>
<td valign="top" align="left">Rank test score</td>
<td valign="top" align="center">2.000</td>
<td valign="top" align="center">3.000</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">3.000</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>5.2.3 Computational environment</title>
<p>All experimental methods were performed on a MacBook Pro, specifically configured with a 1.4 GHz Quad-Core Intel Core i5 processor. The system employed Intel Iris Plus Graphics 645 for graphics processing, featuring 1,536 MB of memory. The device was equipped with 8 GB of 2,133 MHz LPDDR3 RAM and ran macOS Sequoia version 15.5. The dataset and computational outputs were stored on a 250.69 GB Macintosh HD, with 112.16 GB of space available during the experimental phase. This configuration facilitated the computational framework for all data processing, model training, and evaluation activities conducted in this research.</p>
</sec>
</sec>
</sec>
<sec id="s6">
<title>6 Results and discussions</title>
<sec>
<title>6.1 Confusion matrix</title>
<p>Confusion matrices are specially used to visualize a model&#x00027;s performance in classification problems. They display the frequency of errors, such as false positives and false negatives, as well as the proportion of correctly classified data points, such as true positives and true negatives. The model predicts 1,145 actual instances of class 1 correctly and 55 actual instances of class 2, and 86 out of 87 actual instances of class 3. <xref ref-type="fig" rid="F13">Figures 13</xref>, <xref ref-type="fig" rid="F14">14</xref> show the confusion matrices.</p>
<fig position="float" id="F13">
<label>Figure 13</label>
<caption><p>Confusion matrix, decision tree, and XGBoost.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0013.tif">
<alt-text>Two side-by-side normalized confusion matrix heatmaps. The left heatmap represents a Decision Tree model, showing higher accuracy for class 0 (0.98) and class 2 (0.85). The right heatmap represents an XGB model, displaying perfect accuracy for classes 0 and 1 (1.00), and high accuracy for class 2 (0.98). Both use a color scale from light blue (low values) to dark blue (high values).</alt-text>
</graphic>
</fig>
<fig position="float" id="F14">
<label>Figure 14</label>
<caption><p>Confusion matrix KNN and Random Forest.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0014.tif">
<alt-text>Side-by-side normalized confusion matrix heatmaps for KNN and Random Forest classifiers. The KNN matrix shows true label zero perfectly predicted, label one with 84% accuracy, and label two with 90% accuracy. The Random Forest matrix shows true label zero with 99% accuracy, label one with 93%, and label two with 87%. The color gradient indicates prediction accuracy.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>6.2 Classification report</title>
<p>Both the confusion matrix and classification report indicate that the model achieved excellent performance with perfect accuracy, precision, recall, and F1-score for each class. <xref ref-type="table" rid="T3">Table 3</xref> shows the classification report.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Classification report.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Classifiers</bold></th>
<th valign="top" align="center"><bold>Class</bold></th>
<th valign="top" align="center"><bold>Precision</bold></th>
<th valign="top" align="center"><bold>Recall</bold></th>
<th valign="top" align="center"><bold>F1-score</bold></th>
<th valign="top" align="center"><bold>Support</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" rowspan="3">Decision tree</td>
<td valign="top" align="left">0</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">99</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1134</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">54</td>
</tr>
<tr>
<td valign="top" align="left" rowspan="3">XGBoost</td>
<td valign="top" align="left">0</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">0.98</td>
<td valign="top" align="center">0.98</td>
<td valign="top" align="center">99</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">1126</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">0.98</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">62</td>
</tr>
<tr>
<td valign="top" align="left" rowspan="3">KNN</td>
<td valign="top" align="left">0</td>
<td valign="top" align="center">0.95</td>
<td valign="top" align="center">0.87</td>
<td valign="top" align="center">0.91</td>
<td valign="top" align="center">95</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">0.98</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">1137</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">1.00</td>
<td valign="top" align="center">0.76</td>
<td valign="top" align="center">0.87</td>
<td valign="top" align="center">55</td>
</tr>
<tr>
<td valign="top" align="left" rowspan="3">Random Forest</td>
<td valign="top" align="left">0</td>
<td valign="top" align="center">0.88</td>
<td valign="top" align="center">0.90</td>
<td valign="top" align="center">0.89</td>
<td valign="top" align="center">78</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">0.99</td>
<td valign="top" align="center">1153</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">0.98</td>
<td valign="top" align="center">0.95</td>
<td valign="top" align="center">0.96</td>
<td valign="top" align="center">56</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>6.3 Learning curve</title>
<p>The learning curve shows the x-axis with values between 500 and 2,500 labeled as training data size, shown in <xref ref-type="fig" rid="F15">Figure 15</xref>. The model accuracy y-axis has a range of 0.95 to 1.0. Two lines are displayed, one green for validation accuracy and one blue for training accuracy. As the size of the training data increases, the validation accuracy also increases, indicating that data are being trained well and validated. The learning curves for the decision tree, XGboost, KNN, and Random Forest are shown in <xref ref-type="fig" rid="F15">Figures 15</xref>, <xref ref-type="fig" rid="F16">16</xref>.</p>
<fig position="float" id="F15">
<label>Figure 15</label>
<caption><p>Learning curve for decision tree and XGBoost.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0015.tif">
<alt-text>Two line graphs compare model accuracy for Decision Tree and XGBoost based on training data size. The Decision Tree graph shows constant training accuracy at 1.00, with validation accuracy ranging between 0.95 and 0.97. The XGBoost graph shows training accuracy slightly below 1.00, with validation accuracy increasing from 0.97 to just over 0.995. Shaded areas represent variance in validation accuracy.</alt-text>
</graphic>
</fig>
<fig position="float" id="F16">
<label>Figure 16</label>
<caption><p>Learning curves for KNN and random forest.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0016.tif">
<alt-text>Two line graphs compare the performance of KNN and Random Forest models. Both graphs plot model accuracy against training data size. The KNN graph shows an increase in training accuracy up to around 1,500 samples, and a slight dip beyond that, with validation accuracy gradually rising but lower overall. The Random Forest graph shows consistently high training accuracy and increasing validation accuracy as data size grows. Both include shaded regions representing variance.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<title>6.4 Precision&#x02013;recall curve</title>
<p>The graphical tool called a precision&#x02013;recall curve (PRC) is used to assess how well the classification model performs in multiclass problems, as shown in <xref ref-type="fig" rid="F17">Figure 17</xref>. PRCs offer insight into the tradeoff between precision and recall in contrast with the receiver operating characteristic area under the curve (ROC AUC), which concentrates on binary classification. The ROC AUC score is obtained as 0.99928. The WER is the percentage of words that the system incorrectly recognizes, and the CER is the percentage of characters that the system recognizes incorrectly. This shows that the speaker&#x00027;s ability to speak correctly has improved, as has the speech recognition system&#x00027;s ability to recognize their speech. The graph also shows that the WER continuously outperforms the CER. This is because the speech recognition system finds it easier to identify individual characters.</p>
<fig position="float" id="F17">
<label>Figure 17</label>
<caption><p>Precision&#x02013;recall curve for XGBoost.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0017.tif">
<alt-text>Precision-recall curve for an XGBoost model showing three classes. Class 0 has an average precision of 1.00, Class 1 is 0.99, and Class 2 is 0.97. The graph plots precision against recall, demonstrating high performance across all classes.</alt-text>
</graphic>
</fig>
<p><xref ref-type="fig" rid="F18">Figure 18</xref> shows the test and validation loss vs. various epochs and the word and character error rate vs. epochs of the system&#x00027;s WER and CER plotted against time. The WER is the percentage of words that the system incorrectly predicts, and the CER is the percentage of characters that the system incorrectly predicts (<xref ref-type="bibr" rid="B13">Baghdasaryan, 2022</xref>). The graph shows that both the WER and CER show a decrease over time, suggesting that the system&#x00027;s speech recognition performance is improving. In contrast, the WER constantly exceeds the CER. The reason for this is that individual characters are recognized by the algorithm more readily than entire words. The graph also shows how the WER and CER start to plateau after a certain number of epochs. The graph shows that the voice recognition system is training effectively. The system&#x00027;s increasing efficiency is demonstrated by the decrease in WER and CER over time. The word error rate is the most popular metric for ASR.</p>
<disp-formula id="E13"><label>(13)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">WER</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>When a word in the reference sequence is transcribed as a different word, it is called a substitute word (Sw). When a word is completely absent from the automatic transcription, it is referred to as a deleted word (Dw). The number of words inserted is Iw. This means the word&#x00027;s appearance in the transcription has no correspondent in the reference word sequence. As it lacks the upper bound, the word error rate only indicates whether one system is superior to another. For this reason, a character error rate is used.</p>
<disp-formula id="E14"><label>(14)</label><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">CER</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<fig position="float" id="F18">
<label>Figure 18</label>
<caption><p>Test and validation loss vs. epochs and word and character error rate vs. epochs.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-08-1639147-g0018.tif">
<alt-text>Two graphs showing model performance over epochs. The left graph plots test and validation loss, both decreasing sharply initially, then flattening, with test loss consistently lower. The right graph shows word and character error rates, both decreasing over time, with character error rate lower throughout.</alt-text>
</graphic>
</fig>
<p><xref ref-type="table" rid="T4">Table 4</xref> describes the entire model analysis. The size and complexity of the exercise data, along with the system&#x00027;s design, will determine the ideal number of epochs for training a speech recognition system.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Model performance analysis.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Epoch</bold></th>
<th valign="top" align="center"><bold>Test loss</bold></th>
<th valign="top" align="center"><bold>Validation loss</bold></th>
<th valign="top" align="center"><bold>Word error rate</bold></th>
<th valign="top" align="center"><bold>Character error rate</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">1,017.0</td>
<td valign="top" align="center">1021.4</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">0.59118</td>
</tr>
<tr>
<td valign="top" align="left">12</td>
<td valign="top" align="center">300.00</td>
<td valign="top" align="center">324.70</td>
<td valign="top" align="center">0.7815</td>
<td valign="top" align="center">0.1920</td>
</tr>
<tr>
<td valign="top" align="left">19</td>
<td valign="top" align="center">223.27</td>
<td valign="top" align="center">286.77</td>
<td valign="top" align="center">0.6982</td>
<td valign="top" align="center">0.1643</td>
</tr>
<tr>
<td valign="top" align="left">22</td>
<td valign="top" align="center">160.01</td>
<td valign="top" align="center">266.72</td>
<td valign="top" align="center">0.6170</td>
<td valign="top" align="center">0.1437</td>
</tr>
<tr>
<td valign="top" align="left">25</td>
<td valign="top" align="center">132.86</td>
<td valign="top" align="center">259.57</td>
<td valign="top" align="center">0.6160</td>
<td valign="top" align="center">0.1432</td>
</tr>
<tr>
<td valign="top" align="left">31</td>
<td valign="top" align="center">128.33</td>
<td valign="top" align="center">257.66</td>
<td valign="top" align="center">0.6037</td>
<td valign="top" align="center">0.1387</td>
</tr></tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="T5">Table 5</xref> illustrates the best model analysis and the corresponding transcribed Arabic text.</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Model performance analysis&#x02014;best model.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Epoch</bold></th>
<th valign="top" align="center"><bold>Best WER</bold></th>
<th valign="top" align="center"><bold>Best CER</bold></th>
<th valign="top" align="center"><bold>Loss at best WER/CER</bold></th>
<th valign="top" align="left"><bold>Arabic text</bold></th>
<th valign="top" align="left"><bold>English text</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">12</td>
<td valign="top" align="center">0.4687</td>
<td valign="top" align="center">0.1060</td>
<td valign="top" align="center">110.289</td>
<td valign="top" align="left">&#x00627;&#x00644;&#x00633;&#x00650;&#x00651;&#x0064A;&#x00641;&#x00642;&#x00650;&#x00635;&#x0064E;&#x00631;&#x00650;&#x00641;&#x00650;&#x0064A;&#x00627;&#x00644;&#x00623;&#x0064F;&#x00633;&#x00628;&#x0064F;&#x00648;&#x00639;&#x00650;&#x0064A;&#x00651;&#x00627;&#x00650;&#x0062C;&#x0062A;&#x00650;&#x00645;&#x0064E;&#x00627;&#x00639;&#x0064F;&#x00647;&#x0064F;&#x00627;&#x00644;&#x00648;&#x0064F;&#x00632;&#x0064E;&#x00631;&#x0064E;&#x00627;&#x00621;&#x00650;&#x00645;&#x0064E;&#x0062C;&#x00644;&#x00650;&#x00633;&#x0064F;&#x00639;&#x0064E;&#x00642;&#x0064E;&#x0062F;&#x0064E; &#x00627;&#x00644;&#x00645;&#x0062D;&#x0064E;&#x00645;&#x0064E;&#x00651;&#x0062F;&#x00646;&#x0064E;&#x00627;&#x00635;&#x00650;&#x00631;&#x00627;&#x00644;&#x00634;&#x00650;&#x00651;&#x0064A;&#x0062E;&#x00627;&#x00644;&#x00634;&#x00650;&#x00651;&#x0064A;&#x0062E;&#x00645;&#x0064E;&#x0062C;&#x00644;&#x00650;&#x00633;&#x00650;&#x00631;&#x0064E;&#x00626;&#x00650;&#x0064A;&#x00633;&#x00650;&#x00633;&#x0064F;&#x00645;&#x0064F;&#x00648;&#x00650;&#x00651;&#x00628;&#x00650;&#x00631;&#x00650;&#x00626;&#x0064E;&#x00627;&#x00633;&#x0064E;&#x00629;&#x00650; &#x00643;&#x0064E;&#x00634;&#x0064E;&#x00641;&#x0064E;&#x00627;&#x00644;&#x00647;&#x0064E;&#x00627;&#x00645;&#x0064E;&#x00651;&#x00629;&#x00627;&#x00644;&#x00645;&#x00650;&#x00644;&#x0064E;&#x00641;&#x0064E;&#x00651;&#x00627;&#x0062A;&#x00650;&#x00645;&#x00650;&#x00646;&#x00645;&#x0064E;&#x0062C;&#x00645;&#x0064F;&#x00648;&#x00639;&#x0064E;&#x00629;&#x0064D;&#x00627;&#x00644;&#x00648;&#x0064F;&#x00632;&#x0064E;&#x00631;&#x0064E;&#x00627;&#x00621;&#x0064F;&#x0062A;&#x0064E;&#x0062F;&#x0064E;&#x00627;&#x00648;&#x0064E;&#x00644;&#x0064E;&#x0062A;&#x0062D;&#x0064E;&#x0064A;&#x0062B;&#x0064F; &#x00631;&#x0064E;&#x00648;&#x00636;&#x0064E;&#x00627;&#x00646;&#x00650;&#x00627;&#x00644;&#x00627;&#x00644;&#x00648;&#x0064F;&#x00632;&#x0064E;&#x00631;&#x0064E;&#x00627;&#x00621;&#x00645;&#x0064E;&#x0062C;&#x00644;&#x00650;&#x00633;&#x00650;&#x00644;&#x00650;&#x00634;&#x0064F;&#x00624;&#x0064F;&#x00648;&#x00646;&#x00650;&#x00627;&#x00644;&#x0062F;&#x0064E;&#x00651;&#x00648;&#x00644;&#x0064E;&#x00629;&#x00648;&#x0064E;&#x00632;&#x00650;&#x0064A;&#x00631;&#x00650;&#x00639;&#x0064E;&#x00646;&#x00647;&#x0064E;&#x00627; &#x00627;&#x00644;&#x00631;&#x0064E;&#x00651;&#x00648;&#x00636;&#x0064E;&#x00627;&#x00646;</td>
<td valign="top" align="left">The Cabinet held its weekly meeting at Seif Palace under the chairmanship of His Highness the Prime Minister Sheikh Nasser Al-Mohammed, where the ministers deliberated a set of important files revealed by Minister of State for Cabinet Affairs Roudhan Al-Roudhan</td>
</tr>
<tr>
<td valign="top" align="left">19</td>
<td valign="top" align="center">0.3720</td>
<td valign="top" align="center">0.0568</td>
<td valign="top" align="center">276.147</td>
<td valign="top" align="left">&#x00628;&#x0064E;&#x00639;&#x0062F;&#x0064E;&#x00623;&#x0064E;&#x00634;&#x00647;&#x0064F;&#x00631;&#x00645;&#x0064F;&#x00646;&#x00630;&#x0064F;&#x00625;&#x00650;&#x00636;&#x00631;&#x0064E;&#x00627;&#x00628;&#x0064E;&#x00627;&#x0062A;&#x0064D;&#x0064A;&#x0064E;&#x00634;&#x00647;&#x0064E;&#x0062F;&#x0064F;&#x00627;&#x00644;&#x0064A;&#x0064E;&#x00645;&#x0064E;&#x00646;&#x00623;&#x0064E;&#x00646;&#x0064E;&#x00651;&#x00625;&#x00650;&#x00644;&#x0064E;&#x00649;&#x00627;&#x00644;&#x00625;&#x00650;&#x00634;&#x0064E;&#x00627;&#x00631;&#x0064E;&#x00629;&#x0064F;&#x0062A;&#x0064E;&#x0062C;&#x0062F;&#x0064F;&#x00631;&#x0064F; &#x00648;&#x0064E;&#x0062A;&#x00650;&#x00644;&#x00643;&#x0064E;&#x00627;&#x00644;&#x0062D;&#x0064E;&#x00627;&#x00643;&#x00650;&#x00645;&#x00644;&#x00650;&#x00644;&#x00646;&#x00650;&#x00651;&#x00638;&#x0064E;&#x00627;&#x00645;&#x00650;&#x00627;&#x00644;&#x00645;&#x0064F;&#x00624;&#x0064E;&#x0064A;&#x00650;&#x00651;&#x0062F;&#x0064E;&#x00629;&#x00650;&#x00648;&#x0064E;&#x00627;&#x00644;&#x00645;&#x0064E;&#x00633;&#x00650;&#x0064A;&#x00631;&#x0064E;&#x00627;&#x0062A;&#x00650;&#x00627;&#x00644;&#x00645;&#x0064F;&#x00638;&#x0064E;&#x00627;&#x00647;&#x0064E;&#x00631;&#x0064E;&#x00627;&#x0062A;&#x00650; &#x00639;&#x0064E;&#x00644;&#x00650;&#x0064A;&#x00650;&#x00651;&#x00627;&#x00644;&#x00631;&#x0064E;&#x00651;&#x00626;&#x00650;&#x0064A;&#x00633;&#x0064A;&#x0064E;&#x0062A;&#x0064E;&#x00644;&#x0064E;&#x00642;&#x0064E;&#x00651;&#x00649;&#x00641;&#x00650;&#x0064A;&#x00645;&#x0064E;&#x00627;&#x00628;&#x00650;&#x00625;&#x00650;&#x00633;&#x00642;&#x0064E;&#x00627;&#x00637;&#x00650;&#x00647;&#x0062A;&#x0064F;&#x00637;&#x0064E;&#x00627;&#x00644;&#x00650;&#x00628;&#x0064F;&#x00648;&#x0064E;&#x00627;&#x00644;&#x0064E;&#x00651;&#x0062A;&#x00650;&#x0064A;&#x00644;&#x0064E;&#x00647;&#x00627;&#x00644;&#x00645;&#x0064F;&#x00639;&#x0064E;&#x00627;&#x00631;&#x0064E;&#x00636;&#x0064E;&#x00629;&#x00650; &#x00639;&#x0064E;&#x00642;&#x00650;&#x00628;&#x0064E;&#x00627;&#x00644;&#x00633;&#x0064E;&#x00651;&#x00639;&#x0064F;&#x00648;&#x0062F;&#x00650;&#x0064A;&#x0064E;&#x00651;&#x00629;&#x00627;&#x00644;&#x00633;&#x0064E;&#x00651;&#x00639;&#x0064F;&#x00648;&#x0062F;&#x00650;&#x0064A;&#x0064E;&#x00651;&#x00629;&#x00627;&#x00644;&#x00645;&#x0064E;&#x00645;&#x00644;&#x0064E;&#x00643;&#x0064E;&#x00629;&#x00650;&#x00641;&#x00650;&#x0064A;&#x00627;&#x00644;&#x00639;&#x00650;&#x00644;&#x0064E;&#x00627;&#x0062C;&#x0064E;&#x00635;&#x0064E;&#x00627;&#x00644;&#x00650;&#x0062D;&#x00639;&#x0064E;&#x00628;&#x0062F;&#x00627;&#x00644;&#x00644;&#x00647; &#x00627;&#x00644;&#x00634;&#x0064E;&#x00651;&#x00647;&#x00631;&#x00647;&#x0064E;&#x00630;&#x0064E;&#x00627;&#x00645;&#x00650;&#x00646;&#x00633;&#x0064E;&#x00627;&#x00628;&#x00650;&#x00642;&#x0064D;&#x00648;&#x0064E;&#x00642;&#x0062A;&#x0064D;&#x00641;&#x00650;&#x0064A;&#x00627;&#x00644;&#x00631;&#x00650;&#x00651;&#x00626;&#x0064E;&#x00627;&#x00633;&#x00650;&#x0064A;&#x00651;&#x00627;&#x00644;&#x00642;&#x0064E;&#x00635;&#x00631;&#x00650;&#x00639;&#x0064E;&#x00644;&#x0064E;&#x00649;&#x00647;&#x0064F;&#x0062C;&#x0064F;&#x00648;&#x00645;&#x0064D;</td>
<td valign="top" align="left">Yemen has been witnessing strikes for months after demonstrations and marches in support of the ruling regime and those opposing it, demanding its ouster, while President Ali Abdullah Saleh is receiving treatment in Saudi Arabia following an attack on the presidential palace earlier this month.</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<title>6.5 Discussion</title>
<p>Upon examining the performance of diverse ASR models, some significant themes and insights arise concerning their efficacy across various languages and architectural methodologies. The data reveals a wide range of WERs, from an exceptional 0.720% for the suggested Arabic DeepSpeech model to a maximum of 58.87% for Kazakh utilizing Kaldi. Recent improvements in deep learning models, especially Transformer-based architectures such as XLSR-Wav2Vec 2.0 for Turkish, exhibit markedly lower word error rates (0.23%) compared to previous or toolkit-based methodologies. DeepSpeech is a widely utilized model for several languages (Bengali, Russian, German, Tunisian, Arabic), although its efficacy fluctuates, indicating a significant impact of linguistic attributes and dataset quality. The incorporation of various languages, including Arabic, Bengali, German, Hindi, Kazakh, Russian, Tunisian, and Turkish, emphasizes the international endeavor in ASR development while revealing persistent challenges in attaining universal high performance, particularly for languages characterized by intricate phonetics or scarce resources. The efficacy of the built Baidu&#x00027;s Deep Speech model was meticulously assessed using an independent test dataset in our proposed work. This dataset, completely omitted from the model&#x00027;s training and validation phases, functioned as a vital assessment of the model&#x00027;s capacity to generalize to novel, previously unencountered data. Our results indicate that the model attained a WER of 0.3720 and a CER of 0.0568 during training and 0.19 WER and 0.02 CER during the testing phase.</p>
<p>The unsupervised clustering of MFCC features, together with traditional machine learning classification, could be applied to enhance speaker diarization, acoustic scene categorization, or, importantly, Arabic dialect identification from various audio sources. This feature is essential for augmenting customer service analytics, expanding accessibility tools, facilitating more efficient content filtering, and enriching language learning systems. Furthermore, the framework&#x00027;s proven effectiveness with unlabeled data provides a means for creating ASR solutions for additional low-resource languages or specialized fields that lack comprehensive annotated corpora, thus expanding its influence within the speech technology sector. <xref ref-type="table" rid="T6">Table 6</xref> shows the comparison with previous studies.</p>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Comparison table with previous works.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Reference</bold></th>
<th valign="top" align="center"><bold>Year</bold></th>
<th valign="top" align="left"><bold>Model</bold></th>
<th valign="top" align="left"><bold>Language</bold></th>
<th valign="top" align="center"><bold>WER</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Kazakh speech and recognition methods (<xref ref-type="bibr" rid="B20">Karabaliyev and Kolesnikova, 2024</xref>)</td>
<td valign="top" align="center">2024</td>
<td valign="top" align="left">Kaldi <break/>Mozilla DeepSpeech <break/>Google Speech-to-Text API</td>
<td valign="top" align="left">Kazakh speech</td>
<td valign="top" align="center">56.87% <break/>55.36% <break/>52.97%</td>
</tr>
<tr>
<td valign="top" align="left">End-to-end Bengali speech recognition (<xref ref-type="bibr" rid="B33">Nahid et al., 2019</xref>)</td>
<td valign="top" align="center">2019</td>
<td valign="top" align="left">Bidirectional LSTM</td>
<td valign="top" align="left">Bengali speech</td>
<td valign="top" align="center">8.20%</td>
</tr>
<tr>
<td valign="top" align="left">Russian-language speech recognition (<xref ref-type="bibr" rid="B19">Iakushkin et al., 2018</xref>)</td>
<td valign="top" align="center">2018</td>
<td valign="top" align="left">DeepSpeech</td>
<td valign="top" align="left">Russian speech</td>
<td valign="top" align="center">18%</td>
</tr>
<tr>
<td valign="top" align="left">German speech recognition (<xref ref-type="bibr" rid="B43">Xu et al., 2020</xref>)</td>
<td valign="top" align="center">2020</td>
<td valign="top" align="left">DeepSpeech</td>
<td valign="top" align="left">German speech</td>
<td valign="top" align="center">12.3%</td>
</tr>
<tr>
<td valign="top" align="left">German end-to-end speech recognition (<xref ref-type="bibr" rid="B4">Agarwal and Zesch, 2019</xref>)</td>
<td valign="top" align="center">2019</td>
<td valign="top" align="left">DeepSpeech</td>
<td valign="top" align="left">German speech</td>
<td valign="top" align="center">15.1%</td>
</tr>
<tr>
<td valign="top" align="left">Tunisian dialectal end-to-end speech recognition (<xref ref-type="bibr" rid="B28">Messaoudi et al., 2021</xref>)</td>
<td valign="top" align="center">2021</td>
<td valign="top" align="left">DeepSpeech</td>
<td valign="top" align="left">Tunisian speech</td>
<td valign="top" align="center">24.4%</td>
</tr>
<tr>
<td valign="top" align="left">Hindi speech recognition (<xref ref-type="bibr" rid="B25">Kumar et al., 2012</xref>)</td>
<td valign="top" align="center">2012</td>
<td valign="top" align="left">HTK</td>
<td valign="top" align="left">Hindi speech</td>
<td valign="top" align="center">12.99%</td>
</tr>
<tr>
<td valign="top" align="left">Transformer-based Turkish automatic speech recognition (<xref ref-type="bibr" rid="B40">Tasar et al., 2024</xref>)</td>
<td valign="top" align="center">2024</td>
<td valign="top" align="left">XLSR-Wav2Vec 2.0</td>
<td valign="top" align="left">Turkish Speech</td>
<td valign="top" align="center">2.3%</td>
</tr>
<tr>
<td valign="top" align="left">Arabic phonic transcription (<xref ref-type="bibr" rid="B16">Elmahdy et al., 2011</xref>)</td>
<td valign="top" align="center">2011</td>
<td valign="top" align="left">ACA</td>
<td valign="top" align="left">Arabic</td>
<td valign="top" align="center">19%</td>
</tr>
<tr>
<td valign="top" align="left">Arabic autoencoder speech recognition (<xref ref-type="bibr" rid="B29">Mohammed Ameen and Abdulrahman Kadhim, 2023</xref>)</td>
<td valign="top" align="center">2023</td>
<td valign="top" align="left">Deep learning models</td>
<td valign="top" align="left">Arabic</td>
<td valign="top" align="center">4%</td>
</tr>
<tr>
<td valign="top" align="left">Convolutional neural networks to facilitate the continuous recognition of Arabic speech (<xref ref-type="bibr" rid="B38">Sayed et al., 2024</xref>)</td>
<td valign="top" align="center">2024</td>
<td valign="top" align="left">CNN-LSTM</td>
<td valign="top" align="left">Arabic</td>
<td valign="top" align="center">3.63%</td>
</tr>
<tr>
<td valign="top" align="left">Arabic speaker-independent continuous automatic speech recognition (<xref ref-type="bibr" rid="B2">Abushariah et al., 2012</xref>)</td>
<td valign="top" align="center">2012</td>
<td valign="top" align="left">Hidden Markov models</td>
<td valign="top" align="left">Arabic</td>
<td valign="top" align="center">11.27%</td>
</tr>
<tr>
<td valign="top" align="left">Proposed study</td>
<td/>
<td valign="top" align="left">Baidu&#x00027;s Deep Speech</td>
<td valign="top" align="left">Arabic Speech</td>
<td valign="top" align="center">3.7%</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s7">
<title>7 Conclusion</title>
<p>In this study, we examined the effectiveness of using clustering and classification techniques in conjunction with MEL frequency extraction for Arabic audio data processing. This study also briefs on the effectiveness of Baidu&#x00027;s Deep Speech in Automatic speech recognition of the Arabic dataset. Our results demonstrate that MFCCs efficiently capture important features, facilitating the successful clustering of audio segments using K-means or hierarchical clustering algorithms. Additionally, we obtained a low loss of 128.33 for the training dataset and a validation loss of 257.66 by using Baidu&#x00027;s Deep Speech. The WER for the reference is 0.19, indicating that 19% of the words were misidentified. 2% of the characters in the reference were misidentified, according to the CER of 0.02 in the testing phase. The evaluation&#x00027;s findings are encouraging. The model has a respectable level of accuracy regarding Arabic speech recognition.</p>
<sec>
<title>7.1 Future studies</title>
<p>Future studies might investigate applying the existing methods to other widely used Arabic dialects. Potential applications such as assistive technologies for the hearing-impaired, voice-enabled services in Arabic-speaking regions, and integration with NLP pipelines are possible. This would entail developing acoustic models tailored to a particular dialect or investigating transfer learning strategies to modify the current model to accommodate new dialectal data. Also, predicting the next word and character from Arabic text for audio-impaired individuals can be possible from the transcribed data.</p>
</sec>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s8">
<title>Data availability statement</title>
<p>The datasets presented in this article are not readily available due to privacy reasons. Requests to access the datasets should be directed to <email>fawaz.alanzi&#x00040;ku.edu.kw</email>.</p>
</sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>FA-A: Conceptualization, Funding acquisition, Investigation, Project administration, Resources, Software, Supervision, Writing &#x02013; review &#x00026; editing. BS: Conceptualization, Data curation, Formal analysis, Methodology, Software, Validation, Visualization, Writing &#x02013; original draft.</p>
</sec>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research and/or publication of this article. This work is funded by the Kuwait University project number EO 02/22.</p>
</sec>
<ack><p>The authors wish to acknowledge the support provided by the Kuwait University (project number: EO 02/22), which contributed to different aspects of this research.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s11">
<title>Generative AI statement</title>
<p>The author(s) declare that no Gen AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abdul</surname> <given-names>Z. K.</given-names></name> <name><surname>Al-Talabani</surname> <given-names>A. K.</given-names></name></person-group> (<year>2022</year>). <article-title>Mel frequency cepstral coefficient and its applications: a review</article-title>. <source>IEEE Access</source> <volume>10</volume>, <fpage>122136</fpage>&#x02013;<lpage>122158</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3223444</pub-id></citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abushariah</surname> <given-names>M. A-. A. M.</given-names></name> <name><surname>Ainon</surname> <given-names>R. N.</given-names></name> <name><surname>Zainuddin</surname> <given-names>R.</given-names></name> <name><surname>Elshafei</surname> <given-names>M.</given-names></name> <name><surname>Khalifa</surname> <given-names>O. O.</given-names></name></person-group> (<year>2012</year>). <article-title>Arabic speaker-independent continuous automatic speech recognition based on a phonetically rich and balanced speech corpus</article-title>. <source>Int. Arab J. Inf. Technol.</source> <volume>9</volume>, <fpage>84</fpage>&#x02013;<lpage>93</lpage>.</citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Afify</surname> <given-names>M.</given-names></name> <name><surname>Sarikaya</surname> <given-names>R.</given-names></name> <name><surname>Kuo</surname> <given-names>H-. K. J.</given-names></name> <name><surname>Besacier</surname> <given-names>L.</given-names></name> <name><surname>Gao</surname> <given-names>Y.</given-names></name></person-group> (<year>2006</year>). <article-title>On the use of morphological analysis for dialectal Arabic speech recognition</article-title>. <source>Interspeech</source>. 277&#x02013;280. <pub-id pub-id-type="doi">10.21437/Interspeech.2006-87</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Agarwal</surname> <given-names>A.</given-names></name> <name><surname>Zesch</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <source>German End-to-end Speech Recognition Based on DeepSpeech</source>. Konvens.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Agarwal</surname> <given-names>A.</given-names></name> <name><surname>Zesch</surname> <given-names>T.</given-names></name></person-group> (<year>2020</year>). <article-title>LTL-UDE at low-resource speech-to-text shared task: investigating mozilla deepspeech in a low-resource setting</article-title>. <source>SwissText/KONVENS</source> <volume>31</volume>, <fpage>40</fpage>&#x02013;<lpage>47</lpage>.</citation>
</ref>
<ref id="B6">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ahmed</surname> <given-names>B. H. A.</given-names></name> <name><surname>Ghabayen</surname> <given-names>A. S.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Arabic automatic speech recognition enhancement,&#x0201D;</article-title> in <source>2017 Palestinian International Conference on Information and Communication Technology (PICICT)</source> (<publisher-loc>Gaza</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>98</fpage>&#x02013;<lpage>102</lpage>. <pub-id pub-id-type="doi">10.1109/PICICT.2017.12</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Al-Anzi</surname> <given-names>F. S.</given-names></name> <name><surname>Shalini</surname> <given-names>S. T. B.</given-names></name></person-group> (<year>2024</year>). <article-title>Revealing the next word and character in Arabic: an effective blend of long short-term memory networks and ARABERT, (in English)</article-title>. <source>Appl. Sci.</source> <volume>14</volume>:<fpage>10498</fpage>. <pub-id pub-id-type="doi">10.3390/app142210498</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Algihab</surname> <given-names>W.</given-names></name> <name><surname>Alawwad</surname> <given-names>N.</given-names></name> <name><surname>Aldawish</surname> <given-names>A.</given-names></name> <name><surname>AlHumoud</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Arabic speech recognition with deep learning: a review,&#x0201D;</article-title> in <source>International Conference on Human-Computer Interaction</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>), <fpage>15</fpage>&#x02013;<lpage>31</lpage>.</citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alrumiah</surname> <given-names>S. S.</given-names></name> <name><surname>Al-Shargabi</surname> <given-names>A. A.</given-names></name></person-group> (<year>2023</year>). <article-title>A deep diacritics-based recognition model for Arabic speech: quranic verses as case study</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>81348</fpage>&#x02013;<lpage>81360</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3300972</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alsayadi</surname> <given-names>H. A.</given-names></name> <name><surname>Abdelhamid</surname> <given-names>A. A.</given-names></name> <name><surname>Hegazy</surname> <given-names>I.</given-names></name> <name><surname>Fayed</surname> <given-names>Z. T.</given-names></name></person-group> (<year>2021</year>). <article-title>Arabic speech recognition using end-to-end deep learning</article-title>. <source>IET Signal Process</source>. <volume>15</volume>, <fpage>521</fpage>&#x02013;<lpage>534</lpage>. <pub-id pub-id-type="doi">10.1049/sil2.12057</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Al-Zaro</surname> <given-names>S.</given-names></name> <name><surname>Al-Ayyoub</surname> <given-names>M.</given-names></name> <name><surname>Osama</surname> <given-names>A-. K.</given-names></name></person-group> (<year>2025</year>). <article-title>Speaker-independent phoneme-based automatic quranic speech recognition using deep learning</article-title>. <source>IEEE Access</source>. <volume>99</volume>:<fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2025.3589252</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Amodei</surname> <given-names>D.</given-names></name> <name><surname>Ananthanarayanan</surname> <given-names>S.</given-names></name> <name><surname>Anubhai</surname> <given-names>R.</given-names></name> <name><surname>Bai</surname> <given-names>J.</given-names></name> <name><surname>Battenberg</surname> <given-names>E.</given-names></name> <name><surname>Case</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Deep speech 2: End-to-end speech recognition in english and mandarin, in International conference on machine learning</article-title>. <source>PMLR</source> <volume>48</volume>, <fpage>173</fpage>&#x02013;<lpage>182</lpage>.</citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baghdasaryan</surname> <given-names>V. H.</given-names></name></person-group> (<year>2022</year>). <article-title>Armenian speech recognition system: acoustic and language models</article-title>. <source>Int. J. Sci. Adv</source>. <volume>3</volume>, <fpage>719</fpage>&#x02013;<lpage>724</lpage>. <pub-id pub-id-type="doi">10.51542/ijscia.v3i5.7</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Belinkov</surname> <given-names>Y.</given-names></name> <name><surname>Ali</surname> <given-names>A.</given-names></name> <name><surname>Glass</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Analyzing phonetic and graphemic representations in end-to-end automatic speech recognition</article-title>. <source>arXiv</source>. 81&#x02013;85. <pub-id pub-id-type="doi">10.21437/Interspeech.2019-2599</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Dendani</surname> <given-names>B.</given-names></name> <name><surname>Bahi</surname> <given-names>H.</given-names></name> <name><surname>Sari</surname> <given-names>T.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Ch. Chapter 24, speech enhancement based on deep autoencoder for remote arabic speech recognition,&#x0201D;</article-title> in <source>Image and Signal Processing, (Lecture Notes in Computer Science</source>), (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>221</fpage>&#x02013;<lpage>229</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-51935-3_24</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Elmahdy</surname> <given-names>M.</given-names></name> <name><surname>Gruhn</surname> <given-names>R.</given-names></name> <name><surname>Abdennadher</surname> <given-names>S.</given-names></name> <name><surname>Minker</surname> <given-names>W.</given-names></name></person-group> (<year>2011</year>). <article-title>&#x0201C;Rapid phonetic transcription using everyday life natural chat alphabet orthography for dialectal Arabic speech recognition,&#x0201D;</article-title> in <source>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>Prague</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>4936</fpage>&#x02013;<lpage>4939</lpage>. <pub-id pub-id-type="doi">10.1109/ICASSP.2011.5947463</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gupta</surname> <given-names>S.</given-names></name> <name><surname>Jaafar</surname> <given-names>J.</given-names></name> <name><surname>Ahmad</surname> <given-names>W. W.</given-names></name> <name><surname>Bansal</surname> <given-names>A.</given-names></name></person-group> (<year>2013</year>). <article-title>Feature extraction using MFCC</article-title>. <source>Signal Image Process. Int. J</source>. <volume>4</volume>, <fpage>101</fpage>&#x02013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.5121/sipij.2013.4408</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hori</surname> <given-names>T.</given-names></name> <name><surname>Cho</surname> <given-names>J.</given-names></name> <name><surname>Watanabe</surname> <given-names>S.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;End-to-end speech recognition with word-based rnn language models,&#x0201D;</article-title> in <source>2018 IEEE Spoken Language Technology Workshop (SLT)</source> (<publisher-loc>Athens</publisher-loc>), <fpage>389</fpage>&#x02013;<lpage>396</lpage>. <pub-id pub-id-type="doi">10.1109/SLT.2018.8639693</pub-id><pub-id pub-id-type="pmid">32833649</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Iakushkin</surname> <given-names>O. O.</given-names></name> <name><surname>Fedoseev</surname> <given-names>G. A.</given-names></name> <name><surname>Shaleva</surname> <given-names>A. S.</given-names></name> <name><surname>Degtyarev</surname> <given-names>A. B.</given-names></name> <name><surname>Sedova</surname> <given-names>O. S.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Russian-language speech recognition system based on deepspeech,&#x0201D;</article-title> in <source>Proceedings of the VIII International Conference Distributed Computing and Grid-technologies in Science and Education (GRID 2018), Dubna, Moscow region, Russia, September 10&#x02013;14, 2018</source>.</citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karabaliyev</surname> <given-names>Y.</given-names></name> <name><surname>Kolesnikova</surname> <given-names>K.</given-names></name></person-group> (<year>2024</year>). <article-title>Kazakh speech and recognition methods: error analysis and improvement prospects, (in English)</article-title>. <source>Sci. J. Astana IT Univ</source>. <volume>20</volume>, <fpage>62</fpage>&#x02013;<lpage>75</lpage>. <pub-id pub-id-type="doi">10.37943/20DZGH8448</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karpagavalli</surname> <given-names>S.</given-names></name> <name><surname>Chandra</surname> <given-names>E.</given-names></name></person-group> (<year>2016</year>). <article-title>A review on automatic speech recognition architecture and approaches</article-title>. <source>Int. J. Signal Process. Image Process. Pattern Recognit.</source> <volume>9</volume>, <fpage>393</fpage>&#x02013;<lpage>404</lpage>. <pub-id pub-id-type="doi">10.14257/ijsip.2016.9.4.34</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>K&#x000E9;pesi</surname> <given-names>M.</given-names></name> <name><surname>Weruaga</surname> <given-names>L.</given-names></name></person-group> (<year>2006</year>). <article-title>Adaptive chirp-based time-frequency analysis of speech signals</article-title>. <source>Speech Commun.</source> <volume>48</volume>, <fpage>474</fpage>&#x02013;<lpage>492</lpage>. <pub-id pub-id-type="doi">10.1016/j.specom.2005.08.004</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Keshishian</surname> <given-names>M.</given-names></name> <name><surname>Norman-Haignere</surname> <given-names>S.</given-names></name> <name><surname>Mesgarani</surname> <given-names>N.</given-names></name></person-group> (<year>2021</year>). <article-title>Understanding adaptive, multiscale temporal integration in deep speech recognition systems</article-title>. <source>Adv. Neural Inf. Process. Syst</source>. <volume>34</volume>, <fpage>24455</fpage>&#x02013;<lpage>24467</lpage>.</citation>
</ref>
<ref id="B24">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kim</surname> <given-names>S.</given-names></name> <name><surname>Hori</surname> <given-names>T.</given-names></name> <name><surname>Watanabe</surname> <given-names>S.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Joint CTC-attention based end-to-end speech recognition using multi-task learning,&#x0201D;</article-title> in <source>2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source> (<publisher-loc>New Orleans, LA</publisher-loc>), <fpage>4835</fpage>&#x02013;<lpage>4839</lpage>. <pub-id pub-id-type="doi">10.1109/ICASSP.2017.7953075</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kumar</surname> <given-names>K.</given-names></name> <name><surname>Aggarwal</surname> <given-names>R.</given-names></name> <name><surname>Jain</surname> <given-names>A.</given-names></name></person-group> (<year>2012</year>). <article-title>A Hindi speech recognition system for connected words using HTK</article-title>. <source>Int. J. Comp. Syst. Eng.</source> <volume>1</volume>, <fpage>25</fpage>&#x02013;<lpage>32</lpage>. <pub-id pub-id-type="doi">10.1504/IJCSYSE.2012.044740</pub-id><pub-id pub-id-type="pmid">35009967</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>T.</given-names></name> <name><surname>Zhang</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>Z.</given-names></name> <name><surname>Dou</surname> <given-names>H.</given-names></name> <name><surname>Zhang</surname> <given-names>W.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2025</year>). <article-title>Machine learning-assisted wearable sensing systems for speech recognition and interaction</article-title>. <source>Nat. Commun</source>. <volume>16</volume>:<fpage>2363</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-025-57629-5</pub-id><pub-id pub-id-type="pmid">40064879</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Masterson</surname> <given-names>M.</given-names></name></person-group> (<year>2015</year>). <article-title>Baidu&#x00027;s deep speech recognition bests google, apple, and bing</article-title>. <source>Speech Technol. Mag</source>. <volume>20</volume>:<fpage>12</fpage>.</citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Messaoudi</surname> <given-names>A.</given-names></name> <name><surname>Haddad</surname> <given-names>H.</given-names></name> <name><surname>Fourati</surname> <given-names>C.</given-names></name> <name><surname>Hmida</surname> <given-names>M. B.</given-names></name> <name><surname>Elhaj Mabrouk</surname> <given-names>A. B.</given-names></name> <name><surname>Graiet</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Tunisian dialectal end to end speech recognation based on deep speech</article-title>. <source>Procedia Comput. Sci.</source> <volume>189</volume>, <fpage>183</fpage>&#x02013;<lpage>190</lpage>. <pub-id pub-id-type="doi">10.1016/j.procs.2021.05.082</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohammed Ameen</surname> <given-names>Z. J.</given-names></name> <name><surname>Abdulrahman Kadhim</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Deep learning methods for arabic autoencoder speech recognition system for electro-larynx device</article-title>. <source>Adv. Hum. Comp. Interact</source>. <volume>2023</volume>:<fpage>7398538</fpage>. <pub-id pub-id-type="doi">10.1155/2023/7398538</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Morais</surname> <given-names>R.</given-names></name></person-group> (<year>2025</year>). <source>DeepSpeech model</source>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://www.geeksforgeeks.org/deep-learning/speech-recognition-with-deepspeech-using-mozilla-s-deepspeech/">https://www.geeksforgeeks.org/deep-learning/speech-recognition-with-deepspeech-using-mozilla-s-deepspeech/</ext-link></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Musikic</surname> <given-names>N.</given-names></name> <name><surname>Chepeha</surname> <given-names>D. B.</given-names></name> <name><surname>Popovic</surname> <given-names>M. R.</given-names></name></person-group> (<year>2025</year>). <article-title>Surface electromyography-based speech detection amid false triggers for artificial voice systems in laryngectomy patients</article-title>. <source>IEEE Trans. Med. Robot. Bionics</source>. <volume>7</volume>, <fpage>404</fpage>&#x02013;<lpage>415</lpage>. <pub-id pub-id-type="doi">10.1109/TMRB.2025.3527685</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Nagamine</surname> <given-names>T.</given-names></name> <name><surname>Seltzer</surname> <given-names>M. L.</given-names></name> <name><surname>Mesgarani</surname> <given-names>N.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;On the role of nonlinear transformations in deep neural network acoustic models,&#x0201D;</article-title> in <source>Presented at the Interspeech 2016</source> (<publisher-loc>San Francisco, CA</publisher-loc>). <pub-id pub-id-type="doi">10.21437/Interspeech.2016-1406</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nahid</surname> <given-names>M. M. H.</given-names></name> <name><surname>Purkaystha</surname> <given-names>B.</given-names></name> <name><surname>Islam</surname> <given-names>M. S.</given-names></name></person-group> (<year>2019</year>). <article-title>End-to-end Bengali speech recognition using deepspeech</article-title>. <source>J. Eng. Res. Innovation Educ</source> <volume>1</volume>, <fpage>40</fpage>&#x02013;<lpage>49</lpage>.</citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nedal Turab</surname> <given-names>K. K.</given-names></name></person-group> (<year>2014</year>). <article-title>A novel Arabic speech recognition method using neural networks and Gaussian filtering</article-title>. <source>Int. J. Electric. Electron. Comp. Syst</source>. <volume>19</volume>, <fpage>40</fpage>&#x02013;<lpage>49</lpage>.</citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pitton</surname> <given-names>J. W.</given-names></name> <name><surname>Wang</surname> <given-names>K.</given-names></name> <name><surname>Juang</surname> <given-names>B-. H.</given-names></name></person-group> (<year>1996</year>). <article-title>Time-frequency analysis and auditory modeling for automatic recognition of speech</article-title>. <source>Proc. IEEE</source> <volume>84</volume>, <fpage>1199</fpage>&#x02013;<lpage>1215</lpage>. <pub-id pub-id-type="doi">10.1109/5.535241</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Priyank Dubey</surname> <given-names>B. S.</given-names></name></person-group> (<year>2023</year>). <article-title>Deep speech based end-to-end automated speech recognition (ASR) for Indian-English accents</article-title>. <source>arXiv</source>. <pub-id pub-id-type="doi">10.48550/arXiv.2204.00977</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Rabiner</surname> <given-names>L.</given-names></name> <name><surname>Juang</surname> <given-names>B.- H.</given-names></name></person-group> (<year>1993</year>). <source>Fundamentals of Speech Recognition</source>. <publisher-loc>Upper Saddle River, NJ</publisher-loc>: <publisher-name>Prentice-Hall, Inc</publisher-name>.</citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sayed</surname> <given-names>S. A.</given-names></name> <name><surname>Ahmed Abdel Azeem Abul Seoud</surname> <given-names>R.</given-names></name> <name><surname>Abdel Naby</surname> <given-names>H. Y.</given-names></name></person-group> (<year>2024</year>). <article-title>Convolutional neural networks to facilitate the continuous recognition of arabic speech with independent speakers</article-title>. <source>J. Electrical Comp. Eng</source>. <volume>2024</volume>:<fpage>4976944</fpage>. <pub-id pub-id-type="doi">10.1155/2024/4976944</pub-id></citation>
</ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Srivathshan</surname> <given-names>S.</given-names></name> <name><surname>Sree Ramya</surname> <given-names>G.</given-names></name> <name><surname>Bindu Babu</surname> <given-names>P. K.</given-names></name></person-group> (<year>2025</year>). <article-title>Active noise cancellation system using hybrid SF-ANC and FxANFIS algorithms</article-title>. <source>J. Innovative Image Process</source>. <volume>7</volume>, <fpage>119</fpage>&#x02013;<lpage>145</lpage>. <pub-id pub-id-type="doi">10.36548/jiip.2025.1.006</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tasar</surname> <given-names>D. E.</given-names></name> <name><surname>Koruyan</surname> <given-names>K.</given-names></name> <name><surname>Cilgin</surname> <given-names>C.</given-names></name></person-group> (<year>2024</year>). <article-title>Transformer-based Turkish automatic speech recognition, (in English)</article-title>. <source>Acta Infologica</source> <volume>8</volume>, <fpage>1</fpage>&#x02013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.26650/acin.1338604</pub-id></citation>
</ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ullah</surname> <given-names>I.</given-names></name> <name><surname>Zahid</surname> <given-names>H.</given-names></name> <name><surname>Algarni</surname> <given-names>F.</given-names></name> <name><surname>Asghar Khan</surname> <given-names>M.</given-names></name></person-group> (<year>2022</year>). <article-title>Deep learning-based approach for arabic visual speech recognition</article-title>. <source>Comp. Materials Continua</source> <volume>71</volume>, <fpage>85</fpage>&#x02013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.32604/cmc.2022.019450</pub-id></citation>
</ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>Q.</given-names></name> <name><surname>Wu</surname> <given-names>J.</given-names></name> <name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name></person-group> (<year>2024</year>). <article-title>Research on intelligent speech interaction system based on residual neural network and baidu speech platform</article-title>. <source>J. Intelligence Knowl. Eng</source>. <volume>2</volume>:<fpage>71</fpage>. <pub-id pub-id-type="doi">10.62517/jike.202404213</pub-id></citation>
</ref>
<ref id="B43">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>J.</given-names></name> <name><surname>Matta</surname> <given-names>K.</given-names></name> <name><surname>Islam</surname> <given-names>S.</given-names></name> <name><surname>N&#x000FC;rnberger</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;German speech recognition system using deepspeech,&#x0201D;</article-title> in <source>Presented at the Proceedings of the 4th International Conference on Natural Language Processing and Information Retrieval</source> (<publisher-loc>Association for Computing Machinery</publisher-loc>). <fpage>102</fpage>&#x02013;<lpage>106</lpage>. <pub-id pub-id-type="doi">10.1145/3443279.3443313</pub-id></citation>
</ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>K.</given-names></name> <name><surname>Zhou</surname> <given-names>X.</given-names></name></person-group> (<year>2018</year>). <article-title>Unsupervised classification of hydrophone signals with an improved Mel-frequency cepstral coefficient based on measured data analysis</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>124937</fpage>&#x02013;<lpage>124947</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2018.2886802</pub-id></citation>
</ref>
</ref-list>
</back>
</article>