Search

In order to accurately represent the meaning and pronunciation of Arabic words and sentences, the presence of diacritics plays a crucial role. Over the years, researchers have dedicated significant efforts to enhancing automated diacritization systems. This paper introduces a novel approach for Arabic diacritization utilizing Bidirectional Encoder representations from Transformers (BERT) models. To evaluate the effectiveness of the proposed approach, two publicly available datasets, namely the Arabic Diacritization (AD) dataset and the Tashkeela Processed (TP) dataset, were employed. The performance of the models was assessed using various error metrics, including Diacritic Error Rate (DER) and Word Error Rate (WER). The findings demonstrate the superior performance of BERT in the diacritization process, surpassing all models employed in other diacritization systems. On the AD dataset, the proposed system achieved state-of-the-art (SOTA) syntactic DER and WER of 1.14% and 3.34%, respectively. For morphological diacritization, the best results yielded a DER of 0.92% and a WER of 1.91%. These outcomes reflect a remarkable relative error reduction of over 30% compared to previous research. Additionally, on the TP dataset, the BERT models exhibited a substantial decrease in DER, reducing the benchmark from 4.0% to 1.11%. Furthermore, this study introduces a real-time diacritization system called SUKOUN, which offers diacritized text through a user-friendly website. A comparison with existing automatic diacritization tools, using six example texts, reveals the superior prediction accuracy and preservation of input format provided by SUKOUN. • This study proposes Sukoun (an automated Arabic diacritization system). • Sukoun was validated using two publicly available AD and TP datasets. • Sukoun achieves state-of-the-art results both syntactically and morphologically. • Sukoun outperformed existing Arabic diacritization tools. • Sukoun reduced error rates by over 30%, highlighting the potential of the proposed model. [ABSTRACT FROM AUTHOR]

Image classification, which is a fundamental element of Computer Vision (CV) and Artificial Intelligence (AI), has been researched intensively in numerous domains and embedded in many products. However, with the exponential increase in the number of images and the complexity of the required tasks, deep-learning classification algorithms demand more intensive resources and computational power to train the models and update the massive number of parameters. Quantum computing is a new research technology with a promising capability of exponential speed up and operational parallelization with its unique phenomena including superposition and entanglement. Researchers have already started utilizing Quantum Deep Learning (QDL) and Quantum Machine Learning (QML) in image classification. Yet, to our knowledge, there exists no comprehensive published literature review on quantum image classification. Therefore, this paper analyzes the advances in this field by dividing the studies based on a unique taxonomy, discussing the limitations, summarizing essential aspects of each research, and finally, emphasizing the gaps, challenges, and recommendations. One of the key challenges presented in the paper is that quantum computers are in the Noisy Intermediate-Scale Quantum (NISQ) era, where they contain a limited number of noisy qubits, therefore challenging complex quantum classifiers and complex images from advanced datasets. This research recommends constructing a novel quantum image encoding method that adapts to the available number of qubits and enables RGB images as a critical contribution to the existing research. [ABSTRACT FROM AUTHOR]

Software defect prediction (SDP) plays a significant role in detecting the most likely defective software modules and optimizing the allocation of testing resources. In practice, though, project managers must not only identify defective modules, but also rank them in a specific order to optimize the resource allocation and minimize testing costs, especially for projects with limited budgets. This vital task can be accomplished using Learning to Rank (LTR) algorithm. This algorithm is a type of machine learning methodology that pursues two important tasks: prediction and learning. Although this algorithm is commonly used in information retrieval, it also presents high efficiency for other problems, like SDP. The LTR approach is mainly used in defect prediction to predict and rank the most likely buggy modules based on their bug count or bug density. This research paper conducts a comprehensive comparison study on the behavior of eight selected LTR models using two target variables: bug count and bug density. It also studies the effect of using imbalance learning and feature selection on the employed LTR models. The models are empirically evaluated using Fault Percentile Average. Our results show that using bug count as ranking criteria produces higher scores and more stable results across multiple experiment settings. Moreover, using imbalance learning has a positive impact for bug density, but on the other hand it leads to a negative impact for bug count. Lastly, using the feature selection does not show significant improvement for bug density, while there is no impact when bug count is used. Therefore, we conclude that using feature selection and imbalance learning with LTR does not come up with superior or significant results. [ABSTRACT FROM AUTHOR]