<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">37112</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.037112</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Multi-Task Learning Model with Data Augmentation for Arabic Aspect-Based Sentiment Analysis</article-title>
<alt-title alt-title-type="left-running-head">Multi-task Learning Model with Data Augmentation for Arabic Aspect-Based Sentiment Analysis</alt-title>
<alt-title alt-title-type="right-running-head">Multi-task Learning Model with Data Augmentation for Arabic Aspect-Based Sentiment Analysis</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Fadel</surname><given-names>Arwa Saif</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><email>afadl@stu.kau.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Abulnaja</surname><given-names>Osama Ahmed</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Saleh</surname><given-names>Mostafa Elsayed</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, Faculty of Computing and Information Technology, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, Faculty of Computer Sciences and Engineering, Hodeidah University</institution>, <country>Yemen</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Arwa Saif Fadel. Email: <email>afadl@stu.kau.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>27</day><month>3</month><year>2023</year></pub-date>
<volume>75</volume>
<issue>2</issue>
<fpage>4419</fpage>
<lpage>4444</lpage>
<history>
<date date-type="received"><day>23</day><month>10</month><year>2022</year></date>
<date date-type="accepted"><day>30</day><month>1</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Fadel et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Fadel et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_37112.pdf"></self-uri>
<abstract>
<p>Aspect-based sentiment analysis (ABSA) is a fine-grained process. Its fundamental subtasks are aspect term extraction (ATE) and aspect polarity classification (APC), and these subtasks are dependent and closely related. However, most existing works on Arabic ABSA content separately address them, assume that aspect terms are preidentified, or use a pipeline model. Pipeline solutions design different models for each task, and the output from the ATE model is used as the input to the APC model, which may result in error propagation among different steps because APC is affected by ATE error. These methods are impractical for real-world scenarios where the ATE task is the base task for APC, and its result impacts the accuracy of APC. Thus, in this study, we focused on a multi-task learning model for Arabic ATE and APC in which the model is jointly trained on two subtasks simultaneously in a single model. This paper integrates the multi-task model, namely Local Cotext Foucse-Aspect Term Extraction and Polarity classification (LCF-ATEPC) and Arabic Bidirectional Encoder Representation from Transformers (AraBERT) as a shred layer for Arabic contextual text representation. The LCF-ATEPC model is based on a multi-head self-attention and local context focus mechanism (LCF) to capture the interactive information between an aspect and its context. Moreover, data augmentation techniques are proposed based on state-of-the-art augmentation techniques (word embedding substitution with constraints and contextual embedding (AraBERT)) to increase the diversity of the training dataset. This paper examined the effect of data augmentation on the multi-task model for Arabic ABSA. Extensive experiments were conducted on the original and combined datasets (merging the original and augmented datasets). Experimental results demonstrate that the proposed Multi-task model outperformed existing APC techniques. Superior results were obtained by AraBERT and LCF-ATEPC with fusion layer (AR-LCF-ATEPC-Fusion) and the proposed data augmentation word embedding-based method (FastText) on the combined dataset.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Arabic aspect extraction</kwd>
<kwd>arabic sentiment classification</kwd>
<kwd>AraBERT</kwd>
<kwd>multi-task learning</kwd>
<kwd>data augmentation</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Aspect-based sentiment analysis (ABSA) plays an important role in sentiment analysis, where the sentiment polarities of a review or comment text are predicted based on the aspect terms [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. The two fundamental subtasks of ABSA are aspect term extraction (ATE) and aspect polarity classification (APC). Aspect terms are the features of reviews about services or products, and APC expresses the sentiment polarities toward the extracted aspect terms (positive, negative, or neutral). For example, the review in Arabic about a hotel, &#x201C;The location of the hotel is great, but the service is bad&#x201D; (&#x201C;<inline-graphic xlink:href="CMC_37112-inline-1.tif"/>&#x201D;), provides positive and negative opinions about a hotel relative to two aspect terms, i.e., &#x201C;location&#x201D; and &#x201C;service,&#x201D; respectively. Note that ATE is treated as a sequence labeling problem, and APC is a classification problem.</p>
<p>Traditional machine learning and deep learning approaches, such as recurrent neural networks (RNN) and their variants, long short-term memory (LSTM), and the gated recurrent unit (GRU) [<xref ref-type="bibr" rid="ref-3">3</xref>], or a combination of traditional methods and deep learning models such as integrating of deep models and dependency rules [<xref ref-type="bibr" rid="ref-4">4</xref>], are frequently used to solve the sentiment analysis, ATE and APC problems. Machine learning requires handcrafted feature extraction methods. However, deep learning methods incur lower costs for feature extraction but require a large dataset to train the models.</p>
<p>Recently, the requirement for large training datasets has been solved using transfer learning based on pre-trained language models (PTM), e.g., Flair [<xref ref-type="bibr" rid="ref-5">5</xref>] and bidirectional encoder representations from transformers (BERT) [<xref ref-type="bibr" rid="ref-6">6</xref>]. PTMs are trained on huge volumes of data transferred to downstream tasks using weights that are learned from PTM as the initial weights in the other tasks.</p>
<p>Most traditional methods separately perform ATE and APC, and some studies have assumed that the aspect terms are given or preidentified [<xref ref-type="bibr" rid="ref-7">7</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>], which is impractical as aspect terms are not preidentified in real-world scenarios. Pipeline solutions design different models for each task, and the output from the ATE model is used as the input to the APC model. ATE and APC tasks are sequentially performed using different models [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. The models are stacked one after another, i.e., one model is used for ATE and another model is employed to classify the extracted aspect terms. The limitation of pipeline methods is that they require two steps to achieve ATE and APC, i.e., the models for the subtasks are independently trained, and the relationship between ATE and APC is not explicitly modeled; thus, error propagation is possible among the steps. Here, an error in the ATE step will propagate to the APC step, negatively impacting the ABSA process&#x2019;s overall performance. In ATE and APC, multi-task learning has overcome these limitations by jointly training a single model, where the aspect term and its polarity are simultaneously extracted. Here, model performance is improved using the similarities between two tasks in multi-task learning. The advantages of multi-task learning are its ability to share knowledge between many tasks and train multiple tasks in parallel using a shared representation, where learning each task can enhance the learning and generalizability of other tasks. Multi-task learning is achieved by optimizing multiple loss functions for multiple tasks in a single model rather than a single task (i.e., the objective functions are altered between tasks).</p>
<p>Data augmentation techniques generate extra data to train machine learning and deep learning models, which is beneficial for models that require a large, labeled dataset to realize sufficient training. Data augmentation improves the generalizability of models and helps avoid overfitting problems. Data augmentation techniques have been successfully applied in computer vision and image classification tasks [<xref ref-type="bibr" rid="ref-13">13</xref>]. However, applying data augmentation techniques in natural language processing (NLP) tasks is a relatively new concept. Several alternative approaches have been proposed, ranging from methods that only slightly modify the data to data generation and paraphrasing methods. For example, data modification can be realized using easy data augmentation (EDA) methods [<xref ref-type="bibr" rid="ref-14">14</xref>]. Word replacement (using dictionaries) is employed to replace an original word in a sentence with synonymous terms, delete some words from the given sentence, or swap random words [<xref ref-type="bibr" rid="ref-15">15</xref>]. Note that removing or swapping words may change the meaning and provide low-quality samples, which will negatively affect performance. Back translation methods employ data paraphrasing. Recent studies have used semantic embedding augmentation based on word embedding techniques, e.g., AraVec [<xref ref-type="bibr" rid="ref-15">15</xref>] and FastText [<xref ref-type="bibr" rid="ref-16">16</xref>]. Semantic embedding methods overcame the limitations of the thesaurus-based method (i.e., WordNET) by suggesting replacement words that are closest to the original words in the vector space. Moreover, generation methods generate new data from the original data using language models, e.g., generation pre-trained transformer (GPT)s [<xref ref-type="bibr" rid="ref-17">17</xref>]. For contextual augmentation, pre-trained language models are utilized for data augmentation, where a random mask where random masked words are predicted based on the context using masked language models [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>The Arabic language&#x2019;s complexity distinguishes it from other languages, such as English. Arabic has a richer inflectional and derivative morphology. There is a limited number of resources and tools for Arabic, so there is a lack of language resources and tools [<xref ref-type="bibr" rid="ref-18">18</xref>,<xref ref-type="bibr" rid="ref-19">19</xref>]. Thus, only a limited number of studies have attempted to develop Arabic ABSA (AABSA) methods. This paper inspired by a previous study [<xref ref-type="bibr" rid="ref-20">20</xref>] that proposed the multi-task learning model Local Context Focus for Aspect Term Extraction and Polarity classification (LCF-ATEPC) for English and Chinese and proved its effectiveness. This paper adopted a multi-task learning model (LCF-ATEPC) and integrated it with AraBERT [<xref ref-type="bibr" rid="ref-21">21</xref>] to extract aspect terms and classify their sentiment polarities in an Arabic dataset. The proposed model employs AraBERTV02 as a contextual representation layer, and the local context focus mechanism (LCF) technique is used to consider the local context for APC [<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<p>Furthermore, the proposed model benefits from state-of-the-art data augmentation methods based on PTM (i.e. contextual and noncontextual), offering better word coverage than the traditional thesaurus-based method (WordNET). Here, we employ two data augmentation techniques to increase diversity in the training dataset. These data augmentation techniques are based on pre-trained word embedding substitution techniques (i.e., FastText and AraVec) and a pre-trained language model (i.e., AraBERT). This paper examined the impact of the proposed data augmentation techniques on the performance of the multi-task model in the ATE and APC tasks. Unlike previous methods that did not augment aspect terms, aspect terms are augmented in the proposed method by applying constraints on how the suggested replacement words are selected.</p>
<p>The primary contributions of this paper are summarized as follows.
<list list-type="bullet">
<list-item><p>This paper proposes a multi-task learning model that integrates LCF-ATEPC and a pre-trained Arabic BERT language model (AraBERT) to realize simultaneous Arabic ATE and APC. To the best of our knowledge, this is the first study to develop a multi-task learning model for the Arabic ATE and APC tasks.</p></list-item>
<list-item><p>This paper introduces two data augmentation strategies using state-of-the-art methods, i.e., word embedding and contextual models to increase training data diversity. Moreover, this paper investigate how the proposed data augmentation strategies can improve the effectiveness of the multi-task model. To the best of our knowledge, this is the first study applying data augmentation to the AABSA task, especially on the Arabic Hotels&#x2019; reviews dataset [<xref ref-type="bibr" rid="ref-23">23</xref>].</p></list-item>
<list-item><p>We evaluate the impact of the proposed data augmentation strategies on the performance of the proposed multi-task model. Experimental results demonstrate that the proposed multi-task model achieved better results using a combination of the original and augmented datasets compared to using only the original dataset (Hotels&#x2019; reviews).</p></list-item>
</list></p>
<p>The remainder of this paper is organized as follows. Section 2 summarizes related work, and Section 3 describes the proposed approaches in detail. The experimental process and settings are described in Section 4, and the experimental results are presented and analyzed in Section 5. Finally, conclusions are given in Section 6.</p>
</sec>
<sec id="s2"><label>2</label><title>Related Work</title>
<sec id="s2_1"><label>2.1</label><title>Aspect-based Sentiment Analysis</title>
<p>ABSA comprises several primary subtasks, i.e., ATE, APC, and aspect category detection. In this section, we focus on the ATE and APC subtasks. In addition, we summarize previous studies on ABSA tasks with a focus on ABSA for the Arabic language.</p>
<sec id="s2_1_1"><label>2.1.1</label><title>Aspect Term Extraction</title>
<p>There are three types of ATE methods that are based on existing techniques, i.e., rule-based or dictionary-based methods, traditional machine learning methods, and more recent approaches based on deep learning and transformers. Automatic or manual extraction of aspect phrases can be realized using rule-based techniques, which depend on specified rules to achieve ATE [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]. Rule-based techniques are highly dependent on external resources that are not supported and unavailable in low-resource languages. Here, more frequent elements, e.g., nouns or noun phrases, are extracted using frequency-based algorithms with less grammatical information [<xref ref-type="bibr" rid="ref-26">26</xref>]. Moreover, previous studies have employed the topic model concept for aspect extraction [<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-28">28</xref>]. Traditional machine learning techniques handle the ATE task as a sequence labeling problem, which has been realized using various machine learning-based methods, e.g., support vector machines (SVM) [<xref ref-type="bibr" rid="ref-29">29</xref>] and conditional random fields (CRF) [<xref ref-type="bibr" rid="ref-30">30</xref>,<xref ref-type="bibr" rid="ref-31">31</xref>]. Furthermore, aspect extraction from e-commerce comments was accomplished by combining traditional methods with machine learning [<xref ref-type="bibr" rid="ref-32">32</xref>].</p>
<p>Recently, studies have attempted to adopt deep learning to the ATE task to reduce the human labor and feature extraction costs incurred by machine learning models. For example, a paper [<xref ref-type="bibr" rid="ref-33">33</xref>] suggested a model with two layers, bidirectional LSTM (BiLSTM)and CRF layers, to extract explicit and unsupervised aspect terms. Moreover, an RNN and CRF have been integrated to enhance the ATE task to identify the aspect boundary [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>]. Previous studies have also enhanced existing conventual neural networks (CNNs) to improve ATE tasks [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-34">34</xref>]. A previous study [<xref ref-type="bibr" rid="ref-35">35</xref>] employed multi-layers of CNN with word embedding to tag each word in the given sentence to determine if it is an aspect or nonaspect. Moreover, attention mechanisms have been used to help models learn representations more effectively by emphasizing words that correlate to the aspects [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-36">36</xref>&#x2013;<xref ref-type="bibr" rid="ref-38">38</xref>]. Recently, with the emergence of transfer learning and the development of contextual embedding and pre-trained language models to improve NLP tasks, many studies have employed contextual embedding to achieve superior results in ABSA. For example, in a previous study [<xref ref-type="bibr" rid="ref-39">39</xref>], many datasets from different domains were combined, and the labels were unified. Here, a fine-tuned BERT model was employed to extract aspects from the multi-domain datasets. Moreover, Lopes et al. [<xref ref-type="bibr" rid="ref-40">40</xref>] utilized BERT for the ATE in Portuguese. Winatmoko et al. [<xref ref-type="bibr" rid="ref-41">41</xref>] extracted aspect terms from Bahasa Indonesian hotel reviews using the multilingual BERT, extra auxiliary label, and CRF as the output layer, and the results demonstrated improved performance.</p>
</sec>
<sec id="s2_1_2"><label>2.1.2</label><title>Aspect Polarity Classification</title>
<p>Various techniques have been proposed for the second subtask of ABSA (APC): Traditional machine learning-based and deep learning-based models. Note that conventional machine learning-based approaches require extensive feature engineering; thus, most recent studies considered deep learning techniques, and various deep learning-based approaches have been proposed to improve APC. For example, Tang et al. [<xref ref-type="bibr" rid="ref-42">42</xref>] proposed two LSTM variants, i.e., Target-Dependent LSTM (TD-LSTM) and Target-Connection LSTM (TC-LSTM). In the ABSA task, the attention mechanism can capture the significance of each context word relative to a target by modeling their semantic correlation [<xref ref-type="bibr" rid="ref-43">43</xref>]. Moreover, certain methods have integrated various other techniques with deep learning methods for the APC task. For example, Meng et al. [<xref ref-type="bibr" rid="ref-44">44</xref>] proposed the CNN-BiLSTM approach. Here, a CNN was employed to obtain a higher-level representation of the sequence, and BiLSTM was used for local and global feature extraction after highlighting the aspect terms using attention, where the attention for each word was calculated to identify words with high weights. A previous study [<xref ref-type="bibr" rid="ref-43">43</xref>] developed a model of LSTM and attention with aspect embedding. Based on a dependency tree and affective common sense, Liang al. [<xref ref-type="bibr" rid="ref-45">45</xref>] constructed a graph convolution network to capture sentiment dependencies with distinct aspects.</p>
<p>The limitations of using a word embedding with deep learning because of its context-free nature (where many words have the same embedding regardless of context) have led to using pre-trained contextual models, and such models have demonstrated superior performance in most recent studies. For example, Li et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] utilized an auxiliary sentence to convert the ABSA issue from a single-sentence classification challenge to a sentence-pair classification task. In [<xref ref-type="bibr" rid="ref-46">46</xref>], they employed a BERT model for text representation with CRF for ABSA in an end-to-end manner. Target-dependent with BERT (TD-BERT) modifies the original version of BERT for aspect classification. They proposed using position rather than using the first token BERT as input for APC [<xref ref-type="bibr" rid="ref-10">10</xref>]. A previous study [<xref ref-type="bibr" rid="ref-47">47</xref>] used a post-training BERT model with a masked language model (MLM) model to extract domain-specific features.</p>
</sec>
<sec id="s2_1_3"><label>2.1.3</label><title>Multi-Task Learning for ABSA</title>
<p>As previously stated, most previous studies individually or sequentially handled the ATE and APC tasks, where independent models were designed for each task. However, ATE and APC are performed jointly in multi-task learning. For example, a previous study [<xref ref-type="bibr" rid="ref-48">48</xref>] proposed a joint model for ATE and APC in an end-to-end network. They conducted experiments using several deep neural networks and word embedding on a German dataset. In addition, Nguyen et al. [<xref ref-type="bibr" rid="ref-49">49</xref>] proposed a unified model that simultaneously handled the ATE and APC tasks based on the BiLSTM and CRF techniques. They evaluated their model on four benchmark datasets from SemEval-2014 [<xref ref-type="bibr" rid="ref-50">50</xref>], SemEval-2015 [<xref ref-type="bibr" rid="ref-51">51</xref>], and SemEval-2016 [<xref ref-type="bibr" rid="ref-23">23</xref>], and the results proved the effectiveness of the model. Wang et al. [<xref ref-type="bibr" rid="ref-52">52</xref>] proposed a multi-task model for aspect extraction and polarity classification based on an attention mechanism. In [<xref ref-type="bibr" rid="ref-53">53</xref>], the researchers introduced a multi-task model using BiLSTM with a self-attention mechanism for the ATE task and a CNN for the APC task. In addition, in [<xref ref-type="bibr" rid="ref-54">54</xref>], the authors proposed a multi-task model based on deep learning for ATE and APC tasks on the Vietnamese dataset for restaurant and hotel domains. Another study [<xref ref-type="bibr" rid="ref-20">20</xref>] employed a fine-tuned BERT model as a multi-task model for ABSA with a self-attention layer on top of the BERT model.</p>
<p>Note that most previously proposed ABSA methods focus on English because of the availability of English resources. Moreover, there are strong NLP tools for English. Thus, the best existing methods for ABSA are adapted or modified to Arabic and other languages. Arabic is a challenging and low-resource language [<xref ref-type="bibr" rid="ref-18">18</xref>]; thus, few methods have been proposed for this language. <xref ref-type="table" rid="table-1">Table 1</xref> lists and compares previous studies that have considered the Arabic language. These studies are compared in terms of the AABSA tasks, proposed models, dataset domains (if a multi-task task model was used), and data augmentation techniques.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Existing Arabic ABSA methods</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Reference</th>
<th align="left">Evaluated task</th>
<th align="left">Dataset domain</th>
<th align="left">Proposed model</th>
<th align="left">Multi-task model</th>
<th align="left">Data augmentation</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-62">62</xref>]</td>
<td align="left">Aspect sentiment classification</td>
<td align="left">Large-scale Arabic Book Review (LABR)</td>
<td align="left">Na&#x00EF;ve Bayes Bernoulli na&#x00EF;ve <break/>Bayes</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-63">63</xref>]</td>
<td align="left">-Aspect category detection</td>
<td align="left">Selected reviews from LABR dataset (1513 reviews)</td>
<td align="left">Lexicon-based approaches</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect category detection</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-64">64</xref>]</td>
<td align="left">Aspect term <break/>extraction</td>
<td align="left">Restaurants, movies, and hotels datasets</td>
<td align="left">N-grams and a PoS tagger <break/>were used to extract aspects</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-65">65</xref>]</td>
<td align="left">-Aspect term <break/>extraction</td>
<td align="left">Arabic news affected readers dataset</td>
<td align="left">-PoS, NER, N-gram for <break/>feature extraction</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Polarity term <break/>extraction</td>
<td/>
<td align="left">-CRF, decision tree, and <break/>Na&#x00EF;ve Bayes and K-nearest neighbors for classifiers</td>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-66">66</xref>]</td>
<td align="left">-Aspect category detection</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">Na&#x00EF;ve Bayes, Decision tree, <break/>and K-nearest neighbors</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect polarity extraction</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td/>
<td align="left">-Sentiment polarity classification</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-67">67</xref>]</td>
<td align="left">-Aspect detection</td>
<td align="left">Arabic airline tweeter</td>
<td align="left">-Word embedding for<break/>feature representation<break/>-SVM for classification</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect-based sentiment detection</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-68">68</xref>]</td>
<td align="left">-Aspect category detection</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">-RNN</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect extraction</td>
<td/>
<td align="left">-SVM</td>
<td/>
<td/>
</tr>
<tr>
<td/>
<td align="left">-Sentiment polarity classification</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-69">69</xref>]</td>
<td align="left">-Aspect term extraction</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">-Bi-LSTM and CRF For <break/>ATE</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect polarity classification</td>
<td/>
<td align="left">-LSTM for APC</td>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-70">70</xref>]</td>
<td align="left">-Aspect extraction</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">-Combination of BiGRU <break/>and CNN and CRF (Bi-GRU-CNN-CRF) for aspect extraction</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Sentiment polarity classification</td>
<td/>
<td>-interactive attention with GRU <break/>for aspect extraction</td>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-71">71</xref>]</td>
<td align="left">-Aspect term extraction</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">-Utilizes BiLSTM as the <break/>encoder-an LSTM as the decoder alongside an <break/>attention mechanism and <break/>CRF</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-72">72</xref>]</td>
<td align="left">-Sentiment polarity classification</td>
<td align="left">Arabic Hotels&#x2019; reviews<break/>Arabic News</td>
<td align="left">Fine-tuned BERT model <break/>with linear layer for classification</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-73">73</xref>]</td>
<td align="left">-Aspect term extraction</td>
<td align="left">Arabic News data set</td>
<td align="left">Combination of BERT, BiLSTM, and CRF</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect category detection</td>
<td/>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-74">74</xref>]</td>
<td align="left">-Aspect extraction</td>
<td align="left">Human Annotated Arabic Dataset of Book Review (HAAD)</td>
<td align="left">Using rule-based and <break/>ontology methods</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-75">75</xref>]</td>
<td align="left">-Aspect extraction</td>
<td align="left">Arabic Hotels&#x2019; reviews</td>
<td align="left">Combination of contextual embedding (AraBERT and Flair) with deep learning and CRF BERT-Flair-<break/>BiLSTM/BiGRU-CRF</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-76">76</xref>]</td>
<td align="left">-Aspect term polarity classification</td>
<td align="left">-Human Annotated <break/>Arabic Dataset of Book Review (HAAD)</td>
<td align="left">Using sequence to sequence <break/>model for normalizing text befor classification</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect category polarity classification</td>
<td>-Arabic Hotels&#x2019; reviews</td>
<td/>
<td/>
<td/>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-77">77</xref>]</td>
<td align="left">-Aspect polarity <break/>classification</td>
<td align="left">-Human Annotated <break/>Arabic Dataset of Book Review (HAAD)<break/>-Arabic Hotels&#x2019; reviews<break/>-Arabic News</td>
<td align="left">Using BERT with liner <break/>layer for aspect sentiment classification</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2717;</td>
</tr>
<tr>
<td align="left">[<xref ref-type="bibr" rid="ref-78">78</xref>]</td>
<td align="left">-Aspect category detection</td>
<td align="left">-Arabic News</td>
<td align="left">Combination of BERT and Temporal conventional network and BiGRU</td>
<td align="left">&#x2717;</td>
<td align="left">&#x2713;</td>
</tr>
<tr>
<td align="left"> Our Proposed study</td>
<td align="left">-Aspect extraction</td>
<td align="left">-Arabic Hotels&#x2019; reviews</td>
<td align="left">multi-task model LCF-APTEPC with AraBERTvo2</td>
<td align="left">&#x2713;</td>
<td align="left">&#x2713;</td>
</tr>
<tr>
<td/>
<td align="left">-Aspect polarity <break/>classification</td>
<td>-A combination of Arabic Hotels&#x2019; reviews and augmented datasets</td>
<td/>
<td/>
<td/>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s2_2"><label>2.2</label><title>Data Augmentation for ASBA</title>
<p>Data augmentation is widely used in image classification [<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-55">55</xref>]. Several data augmentation approaches have been proposed to increase the size of training datasets for various NLP tasks, such as text classification [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-56">56</xref>] named entity recognition [<xref ref-type="bibr" rid="ref-57">57</xref>], and machine translation [<xref ref-type="bibr" rid="ref-58">58</xref>]. However, few studies have investigated data augmentation techniques for ABSA in English or other languages, and we could not identify any previous study that investigated data augmentation for an Arabic ATE and APC.</p>
<p>A previous study [<xref ref-type="bibr" rid="ref-59">59</xref>] used na&#x00EF;ve EDA techniques (e.g., random swap, random deletion, random insertion, and synonym replacement) for data augmentation with some adaptations to be compatible with ABSA. Then, to select accurate words for augmentation, they extended EDA with some adjustments based on word sense disambiguation. Moreover, Li et al. [<xref ref-type="bibr" rid="ref-60">60</xref>] proposed two techniques for synonym replacement. The first technique was based on using part of speech information to determine the tokens to be replaced. Then, using WordNET, they selected the most similar words to the original words and replaced them with synonyms with high cosine similarity. The second method is based on syntactic dependency. Here, in each sentence, the tokens were swapped with the tokens with tokens that have the same part of speech (PoS) and the same label with dependency arc with root. Li et al. [<xref ref-type="bibr" rid="ref-61">61</xref>] introduced the conditional augmentation strategy of ATE; mask sequence to sequence was employed to generate new sentences. Some words from the input sentence are masked and replaced with generated words. They used an encoder to encode the masked word and their label as input (to preserve the original label) and a decoder to reform this input.</p>
<p>Unlike the methods proposed in previous studies, we propose a multi-task learning model that simultaneously handles Arabic ATE and APC tasks. The proposed model evaluated the Arabic Hotels&#x2019; reviews dataset. Additionally, the proposed model implements data augmentation techniques based on word embedding substitution and a pre-trained AraBERT model. The augmented dataset was combined with the original dataset. Finally, we evaluated the impact of data augmentation techniques on the proposed multi-task model.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Proposed Methods</title>
<sec id="s3_1"><label>3.1</label><title>Task Definition</title>
<p>This study aimed to extract ATE from Arabic hotel review text and predict the sentiments of the extracted aspect terms. For instance, consider the following review text: &#x201C;the location is very good, but the service is bad.&#x201D; Here, the model should extract the &#x201C;location&#x201D; and &#x201C;service&#x201D; aspects and their respective sentiment polarities, i.e., positive, negative, or neutral.</p>
<p>Here, to implement multi-task learning, the aspect term and its sentiment polarity are simultaneously retrieved. Thus, the input sequence is tokenized, giving each token two labels. The first label indicates whether the token is part of the aspect term, whereas the second label identifies the aspect term&#x2019;s sentiment polarity.</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Data Preprocessing</title>
<p>The dataset used in this study contains user reviews of hotels. However, the text data include various elements that impact the performance of ATE and APC tasks, e.g., hyperlinks or uniform resource locator (URLs), numbers, English letters, and inappropriate symbols and punctuation. Thus, to reduce noise and the size of the vectors, we removed all unnecessary punctuation marks and special characters (@, &#x0023;, &#x0025;, &#x0026;, &#x002A;,?, ^, !), sequences of English letters, and numbers. The dataset was then reformatted from extensible markup language (XML) format to a text file with two labels, i.e., one label for aspect terms and another label for sentiment polarity. Note that the beginning of aspect (B-ASP) indicates the first word of the aspect term, inside of aspect (I-Asp) indicates a word inside the aspect term, and outside (O) is a nonaspect word. In addition, the sentiment polarity of each aspect term can be positive, negative, or neutral. For example, the following review was annotated as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>: &#x201C;<inline-graphic xlink:href="CMC_37112-inline-2.tif"/>&#x201D; &#x201C;the view of the hotel is great, the food is delicious, but the service is bad.&#x201D;</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Example of two label annotation</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-1.tif"/></fig>
</sec>
<sec id="s3_3"><label>3.3</label><title>Data Augmentation</title>
<p>In the following, we describe the data augmentation techniques employed in the proposed model.</p>
<sec id="s3_3_1"><label>3.3.1</label><title>Word Embedding-Based Data Augmentation</title>
<p>By modifying the original training dataset, data augmentation techniques are used to enrich and increase the training dataset&#x2019;s size and data diversity and improve model performance.</p>
<p>In the proposed model, we employ two substitution techniques based on PTM for data augmentation, i.e., word embedding and contextual augmentation. In word embedding, words can be represented with low-dimensional dense vectors (i.e., most elements are nonzero). Here, the distance and direction of the vectors represent the semantic relationships among words. The closer the words are in meaning, the closer the distance between them. For example, synonyms are observed to be near each other, whereas antonyms are noticeably distant from each other.</p>
<p>This paper uses two word embedding techniques, i.e., FastText and AraVec, to augment the dataset. A general overview of the proposed data augmentation architecture is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The data augmentation algorithm using word embedding is described as follows. First, vectors for each word in the training dataset are obtained using FastText or AraVec (excluding stop words and punctuation).</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>The architecture of word embedding substitution approach</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-2.tif"/></fig>
<p>Here, aspect synonyms are generated as follows: 1) a list of unique aspects is created from the original dataset; 2) a vector is generated for each aspect (in a unique aspect list) using FastText or Word2Vec; 3) words with the highest similarity to each aspect in terms of the cosine similarity of the word embeddings are obtained to create a list of synonyms, where words with higher cosine similarities are selected as synonyms for replacement.</p>
<p>Then, we select accurate, high-quality, and relevant synonyms for the original aspect by placing additional constraints on the words&#x2019; synonyms. First, we select two random words from the aspect synonym list for each aspect in a unique list (extracted by the word embedding) to obtain the top 10 neighbors for each word (if available). Then, we obtain the words present in both lists and add them to the list of synonyms. This technique creates a new synonym list for aspect terms where the original word is replaced by one of these synonyms. If there is no intersection, we add the top three neighbors of the original word. Here, we apply the same method to sentiment polarity terms to enrich the augmented data and improve robustness. We create a synonyms list for other words (nonaspect and nonpolarity) by selecting the top five similar words (nearest neighbors) from the vector space. For augmentation, we randomly replace 30&#x0025; of the words in the review (with one of its synonyms).</p>
<p>This process is repeated five times for each sentence. Consequently, we obtain five times as much data, i.e., we generate 24000 extra reviews) five times the original training dataset). Finally, we combine the original and augmented data. Here, the most important factor to consider is the number of words to be replaced in each review. Thus, we replace 30&#x0025; of each review. Moreover, for selecting accurate synonyms for the original words, we realized that by applying constraints on how to select the replacement words. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows an example sentence before and after data augmentation via FastText, where bold words identify the replacement words proposed by the data augmentation.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Example of data augmentation, replacement words in bold</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-3.tif"/></fig>
</sec>
<sec id="s3_3_2"><label>3.3.2</label><title>Contextual Data Augmentation</title>
<p>The second data augmentation technique is based on contextual augmentation. Here, used AraBERTV02 to mask four random words in the sentence, and then new words are predicted as new replacement words. First, the sentence is tokenized, a single random word from the sentence is then masked (while ignoring sub-tokens after tokenization), and the sentence is regrouped and input to the contextual model to predict the masked word. The suggested new words are based on the context, i.e., the suggested new words are based on the other words in the sentence and the position of the masked token word. Finally, the predicted word from BERT model with the highest score is used to replace the original word.</p>
<p>To preserve the semantic meaning of the sentence, we avoid replacing greater than 50&#x0025; of the words in short sentences, especially those with fewer than five words. This process is repeated with the other three random words and then generates the augmented sentence, and each sentence is augmented five times. Generally, with all augmentation techniques, we found that some suggested word is the same word with an added prefix or suffix that does not make a great notable change in the augmented text.</p>
</sec>
</sec>
<sec id="s3_4"><label>3.4</label><title>Multi-Task Model Architecture</title>
<p>The proposed model was inspired by the success of the multi-task LCF-ATEPC [<xref ref-type="bibr" rid="ref-20">20</xref>] and pre-trained Arabic language AraBERT models. The proposed model employs an LCF-ATEPC model for Arabic ATE and APC tasks. This paper integrated this model with AraBERTv02 for Arabic word representation. This model aims to extract aspect terms from the review text and simultaneously classify their sentiment polarity. The main techniques used in the proposed model are AraBERT and the LCF mechanism for AABSA. The model comprises an embedding layer and two independent pre-trained AraBERT layers for global and local contexts to extract the local and global context features, respectively. In addition, the model contains three more layers: multi-head self-attention (MHSA), interactive learning, and output. The proposed model contains the following main components (see <xref ref-type="fig" rid="fig-4">Fig. 4</xref>).</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Architecture of the proposed multi-task model integrating LCF-ATEPC [<xref ref-type="bibr" rid="ref-20">20</xref>] and AraBERT [<xref ref-type="bibr" rid="ref-21">21</xref>]</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-4.tif"/></fig>
<sec id="s3_4_1"><label>3.4.1</label><title>Embedding Layer</title>
<p>Recall that we reformat the Hotels&#x2019; reviews dataset from XML format to a dual-label dataset. Here, each review is tokenized, and each token is assigned a label to indicate whether the token is an aspect term or not, and the other label indicates the sentiment polarity of the given aspect term. To realize effective feature representation, we employ the AraBERT model [<xref ref-type="bibr" rid="ref-21">21</xref>], which is a pre-trained BERT transformer model, as a shared BERT layer. This model encodes a word using a transformer encoder in a bidirectional manner; it indicates the semantics of the word in the context depending on its semantic relationship with relevant words in the text [<xref ref-type="bibr" rid="ref-21">21</xref>]. Here, a contextual embedding vector is output for each word [<xref ref-type="bibr" rid="ref-79">79</xref>].</p>
<p>In the proposed model, AraBERTv02 is employed to generate two parallel embedding layers. The first layer is used to extract the local context features <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mtext mathvariant="italic">AraBER</mml:mtext></mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, and the second layer is used to extract the global context features <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mtext mathvariant="italic">AraBER</mml:mtext></mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>g</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. Note that fine-tuning of each layer is separately performed according to the joint loss function of multi-task learning. The embedding layers are represented by the following equations:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">AraBER</mml:mtext></mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="italic">AraBER</mml:mtext></mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the local input representation, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the global context representation. In addition, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x00A0;</mml:mtext></mml:math></inline-formula> are the sequence inputs for the local context and global context, respectively.</p>
</sec>
<sec id="s3_4_2"><label>3.4.2</label><title>Multi-Head Self-Attention Mechanism</title>
<p>The attention head h is calculated for each semantic word using several weight matrices and different representations using MHSA, which performs multiple-scale products in parallel and concatenates them. The MHSA technique can avoid feature loss due to the long-distance dependencies between relative words in the sequence during feature learning. It is based on the self-attention mechanism, which is a special type of attention that helps detect relationships between different words in the input that indicate the syntactic and contextual structure of a sentence.</p>
</sec>
<sec id="s3_4_3"><label>3.4.3</label><title>Local Context Focus Mechanism</title>
<p>The LCF mechanism has been used to extract local context features [<xref ref-type="bibr" rid="ref-22">22</xref>]. It is adapted to identify more semantic relative contextual words to aspect terms. Context words that are close to the aspect are more relevant than those that are distant; thus, we adopt the semantic relative distance (SRD) [<xref ref-type="bibr" rid="ref-22">22</xref>]. SRD is key to local context; it is based on threshold &#x03B1;, which determines how many words around the target can be considered local context. For example, if the SRD value is six, each contextual word with an SRD value less than or equal to six words will be considered local context; otherwise, it will be considered global context. The SRD value is calculated as follows.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>S</mml:mi><mml:mi>R</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo><mml:mtext>&#x00A0;</mml:mtext></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:math></disp-formula>where <italic>i</italic> is the word&#x2019;s position in the context, and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msup><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mtext>&#x00A0;</mml:mtext></mml:math></inline-formula> is the central position of the aspect term. In addition, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the aspect length, and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>S</mml:mi><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> represents the distance between the targeted aspect and the <italic>i</italic> th contextual word.</p>
<p>Local context features can be trained using a context dynamic mask (CDM), context dynamic weight (CDW), or a fusion of CDM and CDW [<xref ref-type="bibr" rid="ref-22">22</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>]. CDM masks nonlocal features that are unrelated to the targeted aspect learned by the local AraBERT layer. Here, the features of less semantic words (nonlocal context words) will be masked and assigned zero vectors for feature vectors. Nonlocal contexts are tokens whose SRD for the targeted aspect is greater than a threshold value. Subsequently, the local context outputs are calculated as follows.</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>E</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>r</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>M</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>.</mml:mo><mml:mi>M</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>H</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where &#x03B1; represents the <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>S</mml:mi><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> threshold, <italic>M</italic> is the feature mask matric, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the mask vector of each word, <italic>O</italic> is the zero vector, and <italic>E</italic> is ones vector. In addition, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the local features learned by the local context.</p>
<p>The CDW is another mechanism of the local context that preserves semantically relative features and assigns small weights to less semantic relative features (in terms of the target aspect) based on their SRD. The following equations are used to compute the CDW.</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>E</mml:mi><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>S</mml:mi><mml:mi>R</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo><mml:mi>E</mml:mi></mml:mtd><mml:mtd><mml:mi>r</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2026;</mml:mo><mml:msubsup><mml:mrow><mml:mi>V</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>w</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>E</mml:mi><mml:mi>R</mml:mi><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>.</mml:mo><mml:mi>W</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>H</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>S</mml:mi><mml:mi>R</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> is the SRD between the <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:math></inline-formula> word in the input sequence and the target aspect, and <italic>n</italic> is the number of tokens in the input sequence. The CDW output is <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>.</p>
<p>Here, either the CDM or CDW approach can be used to learn the local context features. In addition, we can employ an approach that fuses the CDM and CWD techniques. After concatenation, the output from fusion layer passes into the linear layer to create the final fusion layer <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. Then, the local context is learned by the MHSA module to improve the relationship between the aspect and the context.</p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>D</mml:mi><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>H</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Here,<inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the bias vector, and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the weight matrix.</p>
</sec>
<sec id="s3_4_4"><label>3.4.4</label><title>Feature Interactive Learning Layer</title>
<p>In the APC process, feature interactive learning is first applied by concatenating the local and global context features (to enrich the feature representation. Then, the learned features are passed to the linear layer and another MHSA encoding. The following equations express these steps.</p>
<p><disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>H</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>u</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where, <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents the global context features learned by model, and <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> represents the local context features. In addition, <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the bias vector, and <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msup><mml:mi>W</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the weight matrix.</p>
</sec>
<sec id="s3_4_5"><label>3.4.5</label><title>Sentiment Polarity Extractor</title>
<p>The sentiment Polarity Extractor represents the last output layer that predicts the sentiment polarity. Head pooling is performed on the output features learning by feature interactive learnings to extract the last hidden state from the position of the first token. Then, the output is given into softmax to classify the sentiment polarity for the aspect term. The following equations express these steps:</p>
<p><disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mtext>&#x00A0;</mml:mtext><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">polarity</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msubsup><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:math></disp-formula></p>
<p>where <italic>c</italic> is the classes &#x007B;positive, negative, neutral&#x007D; and <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">polarity</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is the sentiment polarity of the aspect term.</p>
</sec>
<sec id="s3_4_6"><label>3.4.6</label><title>Aspect Term Extraction</title>
<p>The ATE process is a token-level problem where classification is performed at the token level. Here, the following SoftMax activation function is used to predict the tags of the input sequence.
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:mtext>&#x00A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:math></disp-formula></p>
<p>Note that the cross-entropy loss function is used for both ATE and APC. To jointly train the model on the two subtasks simultaneously, the joint loss function is the sum of the loss functions of each task.
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">ATEPC</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>A</mml:mi><mml:mi>T</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">ATEPC</mml:mtext></mml:mrow><mml:mtext>&#x00A0;</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> means the joint loss function, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>A</mml:mi><mml:mi>T</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> means the loss function of task ATE; <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mi>C</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> means the loss function of task APC.</p>
</sec>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Experiments</title>
<sec id="s4_1"><label>4.1</label><title>Dataset and Experimental Settings</title>
<p>This paper used the benchmark dataset from the SemEval-2016 challenges to evaluate the proposed multi-task model, and the hotel dataset is from the Arabic Hotels domain on subtasks 2 and 3 from the SemEval 2016 task 5. The dataset was annotated at the text level with 2029 reviews divided into 1839 training instances and 425 testing instances, and at the sentence level with 6029 sentences (4082 sentences for training and 1227 sentences for testing), we will use 90&#x0025; of training data for training set 10&#x0025; as a validation set. Additional information about the dataset can be found in the literature [<xref ref-type="bibr" rid="ref-23">23</xref>]. Note that we focused on the sentence-level data in our experiments.</p>
<p>This paper evaluated the proposed model on new training datasets generated by combining the original and augmented datasets using three augmentation methods. Comprising 24005 training and 1227 testing data points, we use the original testing data.</p>
<p>As mentioned in the previous section, we reformatted the original dataset into two labels for each token in the sentence. Here, we employed a beginning, inside, and outside (BIO) annotation strategy for ATE if the word was an aspect term (word or phrase). Note that B-ASP indicates the first word of the aspect term, I-Asp indicates a word inside the aspect term, and O is a nonaspect word. Moreover, the sentiment polarity of each aspect term can be positive, negative, or neutral.</p>
<p>All experiments are implemented on Google Colaboratory (<ext-link ext-link-type="uri" xlink:href="https://colab.research.google.com/">https://colab.research.google.com/</ext-link>) using NVIDIA T4 Tensor Core Graphics Processing Unit. Google Colab enables easier and faster implementation of machine learning algorithms. Here, a Python library was utilized for all implementations. Bert-base-arabertv02 version with 768 embedding dimensions was used as the contextual embedding layer in all experiments. After repeated experiments to discover the optimal settings of different hyperparameters (using different hyperparameters), we observed that the best results are obtained with the hyperparameters shown in <xref ref-type="table" rid="table-2">Table 2</xref> (hyperparameters for the model in all experiments). We tested the model with different learning rates and observed that the best results were obtained when the learning rate was 3&#x2009;&#x00D7;&#x2009;10<sup>&#x2212;5</sup>. Therefore, the learning rate was fixed at 3&#x2009;&#x00D7;&#x2009;10<sup>&#x2212;5</sup> in all experiments. The batch size was set to 16, and the maximum number of epochs was 5. After several experiments, the results in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> demonstrate that varying SRD threshold values slightly affect the results obtained on the experimental dataset. For all experiments, we set the SRD threshold to 5 (the default value of LCF-ATEPC).</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Experimental hyperparameter settings</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Parameter</th>
<th align="left">Values</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Learning rate</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;10<sup>&#x2212;5</sup></td>
</tr>
<tr>
<td align="left">Mini-batch size</td>
<td align="left">16</td>
</tr>
<tr>
<td align="left">Max. number of epochs</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">SRD threshold</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">Hidden size</td>
<td align="left">768</td>
</tr>
<tr>
<td align="left">Max. sequence length</td>
<td align="left">140</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-5"><label>Figure 5</label><caption><title>Impact of SRD threshold on: (a) AR-LCF-ATE-Fusion (b) AR-LCF-ATEPC&#x2013;CDW and (c) AR-LCF-ATEPC&#x2013;CDW (F1_ATE: F1-score for ATE; ACC_APC: accuracy value for APC)</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-5.tif"/></fig>
</sec>
<sec id="s4_2"><label>4.2</label><title>Evaluation</title>
<p>A set of measures can be used to evaluate the performance of text classification models. Precision, Recall, and F1 Score are the most popular performance measurements. These metrics are calculated based on the prediction results provided by the confusion matrix. This matrix quantifies the number of (in)correct predictions made by the model for each class. There are four types of prediction results in the confusion matrix when considering an individual class label <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>k</mml:mi></mml:math></inline-formula>:
<list list-type="bullet">
<list-item><p>True Positive (TP): denotes the number of observations that belong to class <italic>k</italic> and were correctly classified as <italic>k</italic>.</p></list-item>
<list-item><p>True Negative (TN): denotes the number of observations that do not belong to class <italic>k</italic> and were not classified as <italic>k</italic>.</p></list-item>
<list-item><p>False Positive (FP): denotes the number of observations that do not belong to class <italic>k</italic> but were incorrectly classified as <italic>k</italic>.</p></list-item>
<list-item><p>False Negative (FN): denotes the number of observations that belong to class <italic>k</italic> but were incorrectly classified as another class.</p></list-item>
</list></p>
<p>The ratio of successfully predicted to total aspect terms or aspect sentiment polarities is called precision, whereas the ratio of correctly predicted to the number of aspect terms in the standard dataset is called recall.</p>
<p>F1 score is a metric that considers the precision and recall taking their harmonic mean. The best value of this score is 1 (best precision and recall), and the worst value is 0 [<xref ref-type="bibr" rid="ref-80">80</xref>]. The precision, recall and F1 score are computed as follows:</p>
<p><disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recal</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recal</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>In the case of APC, the precision, recall and F1-score are computed as follows (they are computed by macro-average per-class metrics):</p>
<p><disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mrow><mml:mtext mathvariant="italic">Precisio</mml:mtext></mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mrow><mml:mtext mathvariant="italic">Recal</mml:mtext></mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:mi>F</mml:mi><mml:msub><mml:mn>1</mml:mn><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Precisio</mml:mtext></mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recal</mml:mtext></mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Precisio</mml:mtext></mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recal</mml:mtext></mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>where <italic>k</italic> &#x2208; [positive, negative, neutral]</p>
<p>The macro average calculates the global scores for these metrics as follows:</p>
<p><disp-formula id="eqn-28"><label>(28)</label><mml:math id="mml-eqn-28" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>3</mml:mn></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>Where <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of classes.</p>
<p>Also, accuracy is used as the evaluation metric for APC. Accuracy was obtained by dividing the number of successfully identified reviews by the total number of reviews.
<disp-formula id="eqn-29"><label>(29)</label><mml:math id="mml-eqn-29" display="block"><mml:mrow><mml:mtext mathvariant="italic">Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Results and Discussion</title>
<sec id="s5_1"><label>5.1</label><title>Performance of Proposed Multi-Task Model on the Original Dataset</title>
<p>Extensive experiments were conducted on the Arabic benchmark dataset from SemEval-2016 Task 5 Arabic Hotels&#x2019; reviews dataset, and the proposed model was applied to this dataset to assess the performance of ATE and APC subtasks. A series of experiments are conducted to verify the proposed AraBERT and LCF-ATEPC with variants of local context layers Fusion, CDW, and CDM (AR-LCF-ATEPC-Fusion, AR-LCF-ATEPC-CDW and AR-LCF-ATEPC-CDM) on Arabic ATE and APC. All models were tested on the same training and testing dataset. <xref ref-type="table" rid="table-3">Table 3</xref> shows the experimental result of the three variants of the proposed model, where Precession (P<sub>ATE</sub>) Recall (R<sub>ATE</sub>) and F1 score (F1<sub>ATE</sub>) represent the evaluation metrics of ATE; Precision (P<sub>APC</sub>) Recall (R<sub>APC</sub>) and F1 score (F1<sub>APC</sub>) and Accuracy (ACC<sub>APC</sub>) represent the evaluation metrics of APC.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>The Experimental Results of LCF-ATEPC &#x002B; AraBERT model</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Model</th>
<th align="center" colspan="3">ATE</th>
<th align="center" colspan="4">APC</th>
</tr>
<tr>
<th align="left">P<sub>ATE</sub></th>
<th align="left">R<sub>ATE</sub></th>
<th align="left">F1<sub>ATE</sub></th>
<th align="left">P<sub>APC</sub></th>
<th align="left">R<sub>APC</sub></th>
<th align="left">F1<sub>APC</sub></th>
<th align="left">ACC<sub>APC</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">AR-LCF-ATEPC_Fusion</td>
<td align="left">75.97</td>
<td align="left">75.90</td>
<td align="left"><bold>75.94</bold></td>
<td align="left">75.09</td>
<td align="left">79.45</td>
<td align="left"><bold>76.74</bold></td>
<td align="left"><bold>91.5</bold></td>
</tr>
<tr>
<td align="left">AR-LCF-ATEPC_ CWD</td>
<td align="left">77.11</td>
<td align="left">73.93</td>
<td align="left">75.48</td>
<td align="left">75.63</td>
<td align="left">77.33</td>
<td align="left">76.4</td>
<td align="left">91.04</td>
</tr>
<tr>
<td align="left">AR-LCF-ATEPC_ CMD</td>
<td align="left">72.64</td>
<td align="left">76.83</td>
<td align="left">74.68</td>
<td align="left">75.89</td>
<td align="left">76.21</td>
<td align="left">76.01</td>
<td align="left">90.55</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As shown in <xref ref-type="table" rid="table-3">Table 3</xref>, for the ATE task, the AR-LCF-ATEPC_Fusion model achieved 75.97&#x0025; of precision, indicating that out of all positive predicted aspect terms, 75.97&#x0025; of them are extracted correctly; the recall score was 75.90&#x0025;, indicating that out of all correct aspect terms in the dataset, 75&#x0025;, 90&#x0025; were correctly extracted by the model. The higher precision achieved by AR-LCF-ATEPC-CDW was 77.11, which means lower false positive; the recall was lowest precession of all models (73.93&#x0025;). However, AR-LCF-ATEPC-CMD achieved the lowest precession (72.64) and outperformed the other models in recall score (76.83&#x0025;). F1 score is considered a better metric than precision and recall when precision and recall results are different as it is a harmonic mean of precision and recall, where it considers false positive and false negative (choosing the best model in this work depends on F1). Therefore, the F1 score provided a better assessment of model performance. Among all models, AR-LCF-ATEPC-Fusion achieved the highest F1 score of 75.94&#x0025;. The second best-performing model was AR-LCF-ATEPC-CDW, with 75.48 of F1 score. AR-LCF-ATEPC-CDM achieved the lowest F1 score of all models.</p>

<p>In terms of APC, <xref ref-type="table" rid="table-3">Table 3</xref> shows that all models achieved good accuracy; the best accuracy (91.5&#x0025;) was achieved by AR-LCF-ATEPC-Fusion model, which indicates that 91.5&#x0025; of aspect sentiment polarities were classified correctly. The precision for all three models was between 75&#x0025;&#x2013;76&#x0025;, indicating that all models can correctly predict 75&#x0025;&#x2013;76&#x0025; of all correct aspect polarities predicted by the mode. AR-LCF-ATEPC-Fusion achieved the highest recall of all the models. Hence, we employed the F1 measure to select the best model among the three models. Among all models, AR-LCF-ATEPC-Fusion achieved the best results for both tasks, achieving an F1 score of 75.94&#x0025; for ATE while achieving an F1 score of 76.74 and an accuracy of 91.5&#x0025; for APC. AR-LCF-ATEPC_CDW was the second-best performing model. However, AR-LCF-ATEPC_CMD performed the worst in both tasks, with an F1 score of 74.36&#x0025; for ATE and an F1 score of 76.07&#x0025;, and an accuracy of 90.93&#x0025; for APC. This is because CDM may lose some important information by masking all words outside the local context. However, CDW assigns low weights to non-local context words that perceive the semantic information in them.</p>

<p>For further performance analysis, the confusion matrix for three models resulting from the experiments is depicted in <xref ref-type="table" rid="table-4 table-5 table-6">Tables 4&#x2013;6</xref>. For the AR-LCF-ATEPC_Fusion model, as shown in <xref ref-type="table" rid="table-4">Table 4</xref>, 93.08&#x0025; of negative aspect terms are accurately classified as negative, while 2.73&#x0025; and 4.19&#x0025; were incorrectly classified as neutral and positive, respectively.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>Confusion matrix of AR-LCF-ATEPC_Fusion model</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th/>
<th align="center" colspan="4">Predicted</th>
</tr>
<tr>
<th align="left"/>
<th align="left"/>
<th align="left">Negative</th>
<th align="left">Neutral</th>
<th align="left">Positive</th>
</tr>
</thead>
<tbody>
<tr>
<th align="center">Actual</th>
<td align="left">Negative</td>
<td align="left">93.08&#x0025;</td>
<td align="left">2.73&#x0025;</td>
<td align="left">4.19&#x0025;</td>
</tr>
<tr>
<td/>
<td align="left">Neutral</td>
<td align="left">9.1&#x0025;</td>
<td align="left">52.27&#x0025;</td>
<td align="left">38.63</td>
</tr>
<tr>
<td/>
<td align="left">Positive</td>
<td align="left">2.9&#x0025;</td>
<td align="left">4.1&#x0025;</td>
<td align="left">93&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-5"><label>Table 5</label><caption><title>Confusion matrix of AR-LCF-ATEPC_CDW model</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th/>
<th align="center" colspan="4">Predicted</th>
</tr>
<tr>
<th align="left"/>
<th align="left"/>
<th align="left">Negative</th>
<th align="left">Neutral</th>
<th align="left">Positive</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<th align="center" rowspan="3">Actual</th>
<td align="left">Negative</td>
<td align="left">94.37&#x0025;</td>
<td align="left">1.88&#x0025;</td>
<td align="left">3.75&#x0025;</td>
</tr>
<tr>
<td align="left">Neutral</td>
<td align="left">18.18&#x0025;</td>
<td align="left">45.45&#x0025;</td>
<td align="left">36.36&#x0025;</td>
</tr>
<tr>
<td align="left">Positive</td>
<td align="left">3.29&#x0025;</td>
<td align="left">4.54&#x0025;</td>
<td align="left">92.17&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-6"><label>Table 6</label><caption><title>Confusion matrix of AR-LCF-ATEPC_CDM model</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th/>
<th align="center" colspan="4">Predicted</th>
</tr>
<tr>
<th align="left"/>
<th align="left"/>
<th align="left">Negative</th>
<th align="left">Neutral</th>
<th align="left">Positive</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<th align="center" rowspan="3">Actual</th>
<td align="left">Negative</td>
<td align="left">91.79&#x0025;</td>
<td align="left">3.03&#x0025;</td>
<td align="left">5.18&#x0025;</td>
</tr>
<tr>
<td align="left">Neutral</td>
<td align="left">9.84&#x0025;</td>
<td align="left">42.62&#x0025;</td>
<td align="left">47.54&#x0025;</td>
</tr>
<tr>
<td align="left">Positive</td>
<td align="left">2.31&#x0025;</td>
<td align="left">3.47&#x0025;</td>
<td align="left">94.22&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>52.27&#x0025; of the neutral aspect terms are correctly classified as neutral, whereas 47.73&#x0025; of the neutral aspect polarities were incorrectly classified. 93&#x0025; of the positive aspect terms are correctly classified as positive, with only 7&#x0025; was misclassified by AR-LCF-ATEPC-Fusion. As shown in <xref ref-type="table" rid="table-4 table-5 table-6">Tables 4&#x2013;6</xref>, from all confusion matrices for all models, we observed the effectiveness of the model in classifying the positive and negative sentiment polarities; we can notice misclassification of the neutral class; This is because there is insufficient annotated data for this class or the difficulty in constructing sentences that contain natural sentiment.</p>
<p>Regarding APC, we found that using different attention layers allowed the model to capture important information from the concatenated local and global context words and learn more interactive aspects and sentence representations. Thus, the proposed multi-task model outperformed the traditional neural network model. we found that using AraBERT as a shared contextual layer plays an important role in extracting local and global semantic features and generating a better representation where AraBERT is large language model can learn contextualized sentiment features in a bidirectional way. Moreover, AraBERT solves Out of Vocabulary (OVV) issues by splitting the unknown words into known sub-words.</p>
<p>As for the overall models&#x2019; performance, in all experimental results, AR-LCF-ATEPC-Fusion outperformed other models based on LCF and AraBERT for both tasks. This proves the positive effect of concatenating the learned features of CMD and CDW to enrich the features and improve performance. Therefore, AR-LCF-ATEPC-Fusion model will be used for comparison with previous works models and with multi-task model variants on the augmented dataset in terms of F1 for ATE; F1, and accuracy for APC.</p>
<p>To validate the effectiveness of multi-task model, we compared the best multi-task model (AR-LCF-ATEPC-Fusion) with state-of-the-art Deep-based and transformer-based approaches that used the same benchmark dataset: RNN-BiLSTM-CRF [<xref ref-type="bibr" rid="ref-69">69</xref>], BiGRU [<xref ref-type="bibr" rid="ref-70">70</xref>], attention mechanism with neural network [<xref ref-type="bibr" rid="ref-71">71</xref>], BERT [<xref ref-type="bibr" rid="ref-72">72</xref>], and Bert-Flair-BiLSTM/BiGRU-CRF [<xref ref-type="bibr" rid="ref-75">75</xref>], Sequence to Sequence mode for preprocessing and BERT for classification (Seq-seq BERT) [<xref ref-type="bibr" rid="ref-76">76</xref>] and BERT with liner layer (Bert-liner-pair) [<xref ref-type="bibr" rid="ref-77">77</xref>]. The results demonstrated that LCF-ATEPC model outperformed other comparable models. Note none of the previous models for Arabic worked on multitask learning, so the comparisons were with a single task. As shown in <xref ref-type="table" rid="table-7">Table 7</xref>, AR-LCF-ATEPC-Fusion achieved the best results with an F1 score of 75.94&#x0025; for the ATE task, thereby outperforming all comparison models (except our previous single-task ATE method [<xref ref-type="bibr" rid="ref-75">75</xref>]). For the APC task, AR-LCF-ATEPC-Fusion outperformed all comparison models with an accuracy of 91.5&#x0025; and an F1 score of 76.74&#x0025;, improving the accuracy by 2&#x0025;. This proves the effectiveness of the multi-task model to boost performance; the multi-task learning allows the propagation of information between ATE and APC, so they complement each other and can capture the semantic alignment between them to improve performance. In addition, utilizing LCF and AraBERT improved the ATE and APC results by capturing rich and complex features.</p>
<table-wrap id="table-7"><label>Table 7</label><caption><title>Comparison of LCF-ATEPC &#x002B; AraBERT model on the original dataset with existing methods</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Model</th>
<th align="left">F1<sub>ATE</sub></th>
<th align="left">F1<sub>APC</sub></th>
<th align="left">ACC<sub>APC</sub></th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Bi-LSTM-CRF for ATE and LSTM-PC for APC [<xref ref-type="bibr" rid="ref-69">69</xref>]</td>
<td align="left">69.9</td>
<td align="left">-</td>
<td align="left">82.6</td>
</tr>
<tr>
<td align="left">Attention-Based Neural Model [<xref ref-type="bibr" rid="ref-71">71</xref>]</td>
<td align="left">72.8</td>
<td align="left">-</td>
<td align="left">-</td>
</tr>
<tr>
<td align="left">APC using BERT [<xref ref-type="bibr" rid="ref-72">72</xref>]</td>
<td align="left">-</td>
<td align="left">-</td>
<td align="left">89.51</td>
</tr>
<tr>
<td align="left">BiGRU-CNN-CRF for ATE IAN-GRU for APC [<xref ref-type="bibr" rid="ref-70">70</xref>]</td>
<td align="left">70.67</td>
<td align="left">-</td>
<td align="left">83.98</td>
</tr>
<tr>
<td align="left">Flair-BERT-BiLSTM-CRF [<xref ref-type="bibr" rid="ref-75">75</xref>]</td>
<td align="left">79.7</td>
<td align="left">-</td>
<td align="left">-</td>
</tr>
<tr>
<td align="left">Seq-Seq-BERT [<xref ref-type="bibr" rid="ref-76">76</xref>]</td>
<td align="left">-</td>
<td align="left">-</td>
<td align="left">84.65</td>
</tr>
<tr>
<td align="left">BERT-liner-pair [<xref ref-type="bibr" rid="ref-77">77</xref>]</td>
<td align="left">-</td>
<td align="left">-</td>
<td align="left">89.51</td>
</tr>
<tr>
<td align="left">AR-LCF-ATEPC_Fusion</td>
<td align="left"><bold>75.94</bold></td>
<td align="left"><bold>76.74</bold></td>
<td align="left"><bold>91.5</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>For the importance of the SRD threshold to identify the local context, we evaluate the effectiveness of different SRD thresholds, study their impact on model performance, and evaluate the best SRD threshold for all variations of LCF layers (i.e., CDM, CDW, and Fusion) on model performance (<xref ref-type="fig" rid="fig-5">Fig. 5</xref>). Here, we fixed all hyperparameters with SRD<sub>threshold</sub> ranges from 0&#x2013;9. As shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, the highest F-1 score of ATE and the accuracy of APC were obtained via AR-LCF-ATEPC_Fusion model when SRD<sub>threshold&#x2009;</sub>&#x003D;&#x2009;5 and SRD<sub>threshold&#x2009;</sub>&#x003D;&#x2009;1. The highest F1-score of ATE and the accuracy of ATE values of the AR-LCF-ATEPC-CDW method were achieved with as SRD<sub>threshold&#x2009;</sub>&#x003D;&#x2009;8. Finally, the best F1-score of ATE and the accuracy of APC were obtained with SRD<sub>threshold&#x2009;</sub>&#x003D;&#x2009;8. In general, these results demonstrate that varying the SRD<sub>threshold</sub> value has a slight effect on the results obtained on the experimental dataset.</p>

</sec>
<sec id="s5_2"><label>5.2</label><title>Performance of Proposed Multi-Task Model with Augmentation Techniques</title>
<p>The proposed data augmentation techniques based on word and contextual embedding augmentation were evaluated using the proposed LCF-ATEPC model on the three combined datasets. The first two datasets are combinations of the original and augmented datasets generated by word embedding techniques FastText and AraVec, respectively. The third dataset is a combination of the original and augmented dataset generated using AraBERT. The results are shown in <xref ref-type="table" rid="table-8">Table 8</xref> and illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, which explains the effectiveness of the augmented dataset. Here, the effectiveness of each augmentation technique was assessed based on the improvement of the F1-score of ATE and that accuracy and F1-score of APC tasks. To demonstrate the effectiveness of the proposed data augmentation techniques, This paper compared the performance of LCF-ATEPC with and without applying the data augmentation techniques. Extensive experiments were then conducted to verify the performance of the LCF-ATEPC model &#x002B; AraBERTv02, different LCF layers (i.e., fusion, CDW, or CDM), and different data augmentation techniques (i.e., word embedding and AraBERT) in the Arabic ATE and APC tasks. We found that the models based on AR-LCF-ATEPC-Fusion on the combined first dataset (with the augmented dataset by using FastText) achieved the best results. However, AR-LCF-ATEPC-CDW on the combined dataset (augmented dataset using AraBERT) achieved the lowest performance.</p>
<table-wrap id="table-8"><label>Table 8</label><caption><title>Comparison of LCF-ATEPC &#x002B; AraBERT model with and without data augmentation techniques (w/o: without, DA: data augmentation)</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">M<sc>odel</sc></th>
<th align="left">F1<sub>ATE</sub></th>
<th align="left">F1<sub>APC</sub></th>
<th align="left">ACC<sub>APC</sub></th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>F<sc>usion (w/o</sc> DA<sc>)</sc></td>
<td align="left"><sc>75.94</sc></td>
<td align="left"><sc>76.74</sc></td>
<td align="left"><sc>91.5</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>&#x2013;</sc>CDW <sc>(w/o</sc> DA<sc>)</sc></td>
<td align="left"><sc>75.48</sc></td>
<td align="left"><sc>76.45</sc></td>
<td align="left"><sc>91.04</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDM <sc>(w/o</sc> DA<sc>)</sc></td>
<td align="left"><sc>74.68</sc></td>
<td align="left"><sc>76.01</sc></td>
<td align="left"><sc>90.55</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>F<sc>usion(w/</sc>DA F<sc>ast</sc>T<sc>ext)</sc></td>
<td align="left"><bold><sc>78.56</sc></bold></td>
<td align="left"><bold><sc>78.87</sc></bold></td>
<td align="left"><bold><sc>93.18</sc></bold></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDW<sc>(w/</sc>DA F<sc>ast</sc>T<sc>ext)</sc></td>
<td align="left"><sc>77.01</sc></td>
<td align="left"><sc>77.42</sc></td>
<td align="left"><sc>92.2</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDM<sc>(w/</sc>DA F<sc>ast</sc>T<sc>ext)</sc></td>
<td align="left"><sc>76.37</sc></td>
<td align="left"><sc>77.32</sc></td>
<td align="left"><sc>91.2</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>F<sc>usion(w/</sc>DA A<sc>ra</sc>V<sc>ec)</sc></td>
<td align="left"><sc>76.98</sc></td>
<td align="left"><sc>77.49</sc></td>
<td align="left"><sc>91.97</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDW<sc>(w/</sc>DA A<sc>ra</sc>V<sc>ec)</sc></td>
<td align="left"><sc>76.37</sc></td>
<td align="left"><sc>77.29</sc></td>
<td align="left"><sc>92.2</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDM<sc>(w/</sc>DA A<sc>ra</sc>V<sc>ec)</sc></td>
<td align="left"><sc>76.66</sc></td>
<td align="left"><sc>77.13</sc></td>
<td align="left"><sc>91.44</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>F<sc>usion(w/</sc>DA A<sc>ra</sc>BERT<sc>)</sc></td>
<td align="left"><sc>77.98</sc></td>
<td align="left"><sc>77.62</sc></td>
<td align="left"><sc>92.36</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDW<sc>(w/</sc>DA A<sc>ra</sc>BERT<sc>)</sc></td>
<td align="left"><sc>76.37</sc></td>
<td align="left"><sc>77.33</sc></td>
<td align="left"><sc>91.2</sc></td>
</tr>
<tr>
<td align="left">AR<sc>-</sc>LCF<sc>-</sc>ATEPC<sc>-</sc>CDM<sc>(w/</sc>DA A<sc>ra</sc>BERT<sc>)</sc></td>
<td align="left"><sc>76.66</sc></td>
<td align="left"><sc>77.03</sc></td>
<td align="left"><sc>91.44</sc></td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6"><label>Figure 6</label><caption><title>Comparison of LCF-ATEPC &#x002B; AraBERT model with and without data augmentation techniques</title></caption><graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_37112-fig-6.tif"/></fig>
<p>AR-LCF-ATEPC-Fusion achieved the best results with the FastText-based data augmentation, achieving an F1-score of 78.56&#x0025; for the ATE task. In addition, it achieved an accuracy of 93.18&#x0025; and F1-score of 78.87&#x0025; for the APC task, and it outperformed the existing methods and best model without data augmentation (AR-LCF-ATEPC-Fusion) with improvement in accuracy (1.48&#x0025;) and F1-score (2.05), that prove the effectiveness of utilizing data augmentation with Multi-task model to improve the performance. However, the AR-LCF-ATEPC-Fusion model with AraBERT-based data augmentation was found to be the second-best data augmentation technique among all techniques in terms of the F1-score for the ATE task and accuracy value and F1-score for the APC task.</p>
<p>In contrast to our expectations, we found that the AraBERT-based data augmentation did not obtain the best results as the FastText data augmentation technique (i.e., word embedding). This may have occurred as a result of the fact that words with very different meanings can be predicted and used in a given context, thereby adding some noisy examples. We carefully selected the word suggestions for replacement with original words with the highest score and manually evaluated most of the examples. However, when using word embedding for data augmentation, we compared each original word directly with the candidate replacements and found that we could add constraints to select more accurate words. In addition, we observed a slight performance improvement with the AR-LCF-ATEPC-Fusion model with AraVec-based data augmentation. The other models, i.e., the AR-LCF-ATEPC-CDW and AR-LCF-ATEPC-CDM models, with all augmented data, obtained results that also showed a slight performance improvement compared to those on the original dataset.</p>
</sec>
</sec>
<sec id="s6"><label>6</label><title>Conclusion and Future Work</title>
<p>Existing methods treat the Arabic ATE and APC separately as single tasks or solve the problem in a pipeline manner (using independent models for each task). This paper proposes a multi-task learning model to address the Arabic ATE and APC tasks. The proposed model employs the multi-task learning LCF-ATEPC model with AraBERTv02 as a shared layer for text representation. In addition, the multi-task model employs the MHSA and local context mechanisms. To increase the diversity of the training dataset, this paper apply several data augmentation methods to generate additional training data automatically. The proposed data augmentation technique is based on word embedding substitution and a pre-trained language model (i.e., AraBERTV02). In an extensive set of experiments, we evaluated the proposed multi-task model on the common Arabic Hotels&#x2019; reviews dataset. Thereafter, we evaluated the proposed model on the combined dataset of the original and augmented datasets. This paper found that the proposed multi-task model outperformed previous methods on the same dataset by achieving the best accuracy of APC. In addition, we found that the FastText-based data augmentation technique (i.e., word embedding) with AR-LCF-ATEPC-Fusion improved the ATE performance by increasing the F1-score from 75.94&#x0025; to 78.56&#x0025; and improved APC performance by increasing the accuracy values from 91.5&#x0025; to 93.18&#x0025; and an F1-score from 76.74 to 78.87. In the future, we plan to employ multi-task learning with different Arabic domains; and utilize data augmentation with different Arabic domains to reduce the time and effort required to collect new datasets, particularly for models that require large training datasets.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>The authors received no funding for this study.</p></sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p></sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Banjar</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Daud</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Abbasi</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Dawood</surname></string-name></person-group>, &#x201C;<article-title>Aspect-based sentiment analysis for polarity estimation of customer reviews on twitter</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>67</volume>, no. <issue>2</issue>, pp. <fpage>2203</fpage>&#x2013;<lpage>2225</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Bensoltane</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Zaki</surname></string-name></person-group>, &#x201C;<article-title>Aspect-based sentiment analysis: An overview in the use of arabic language</article-title>,&#x201D; <source>Artificial Intelligence Review</source>, vol. <volume>56</volume>, no. <issue>3</issue>, pp. <fpage>2325</fpage>&#x2013;<lpage>2363</lpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Hochreiter</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Schmidhuber</surname></string-name></person-group>, &#x201C;<article-title>Long short-term memory</article-title>,&#x201D; <source>Neural Computation</source>, vol. <volume>9</volume>, no. <issue>8</issue>, pp. <fpage>1735</fpage>&#x2013;<lpage>1780</lpage>, <year>1997</year>; <pub-id pub-id-type="pmid">9377276</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Diwali</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Dashtipour</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Saeedi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gogate</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Arabic sentiment analysis using dependency-based rules and deep neural networks</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>127</volume>, pp. <fpage>109377</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Akbik</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Blythe</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Vollgraf</surname></string-name></person-group>, &#x201C;<article-title>Contextual string embeddings for sequence labeling for sequence labeling</article-title>,&#x201D; in <conf-name>Proc. of the 27th Int. Conf. on Computational Llinguistics</conf-name>, <conf-loc>Santa Fe, New Mexico, USA</conf-loc>, pp. <fpage>1638</fpage>&#x2013;<lpage>1649</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Devlin</surname></string-name>, <string-name><given-names>M. W.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Toutanova</surname></string-name></person-group>, &#x201C;<article-title>BERT: Pre-training of deep bidirectional transformers for language understanding</article-title>,&#x201D; in <conf-name>Proc. of the 2019 Conf. of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</conf-name>, <conf-loc>Minneapolis, Minnesota, USA</conf-loc>, pp. <fpage>4171</fpage>&#x2013;<lpage>4186</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bing</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Lam</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Aspect term extraction with history attention and selective transformation</article-title>,&#x201D; in <conf-name>Proc. of the 27th Int. Joint Conf. on Artificial Intelligence</conf-name>, <conf-loc>Stockholm, Sweden</conf-loc>, pp. <fpage>4194</fpage>&#x2013;<lpage>4200</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Gandhi</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Attar</surname></string-name></person-group>, &#x201C;<article-title>Extracting aspect terms using CRF and Bi-LSTM models</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>167</volume>, no. <issue>2019</issue>, pp. <fpage>2486</fpage>&#x2013;<lpage>2495</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Song</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>Target-dependent sentiment classification with BERT</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>154290</fpage>&#x2013;<lpage>154299</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Qiu</surname></string-name></person-group>, &#x201C;<article-title>Utilizing BERT for aspect-based sentiment analysis via constructing auxiliary sentence</article-title>,&#x201D; in <conf-name>Proc. the North American Chapter of the Association for Computational Linguistics: Human Language Technologies(NAACL)</conf-name>, <conf-loc>Minneapolis, Minnesota, USA</conf-loc>, pp. <fpage>380</fpage>&#x2013;<lpage>385</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bing</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Lam</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Shi</surname></string-name></person-group>, &#x201C;<article-title>Transformation networks for target-oriented sentiment classification</article-title>,&#x201D; in <conf-name>Proc. the 56th Annual Meeting of the Association for Computational Linguistic</conf-name>, <conf-loc>Melbourne, Australia</conf-loc>, pp. <fpage>1109</fpage>&#x2013;<lpage>1114</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Lv</surname></string-name></person-group>, &#x201C;<article-title>Open-domain targeted sentiment analysis via span-based extraction and classification</article-title>,&#x201D; in <conf-name>Pro. of the 57th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts</conf-name>, <conf-loc>Florence, Italy</conf-loc>, pp. <fpage>537</fpage>&#x2013;<lpage>546</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Miko&#x0142;ajczyk</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Grochowski</surname></string-name></person-group>, &#x201C;<article-title>Data augmentation for improving deep learning in image classification problem</article-title>,&#x201D; in <conf-name>2018 Int. Interdisciplinary PhD Workshop (IIPhDW)</conf-name>, <conf-loc>Swinouj&#x015B;cie, Poland</conf-loc>, pp. <fpage>117</fpage>&#x2013;<lpage>122</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wei</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Zou</surname></string-name></person-group>, &#x201C;<article-title>Eda: Easy data augmentation techniques for boosting performance on text classification tasks</article-title>,&#x201D; <comment>arXiv preprint arXiv:1901.11196</comment>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Sutskever</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Distributed representations of Words and phrases and their compositionality tomas</article-title>,&#x201D; <comment>arXiv preprint arXiv:1310.4546</comment>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Radford</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Child</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Luan</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Amodei</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Language models are unsupervised multitask learners</article-title>,&#x201D; <source>OpenAI Blog</source>, vol. <volume>1</volume>, no. <issue>8</issue>, pp. <fpage>9</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>El-Masri</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Altrabsheh</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Mansour</surname></string-name></person-group>, &#x201C;<article-title>Successes and challenges of arabic sentiment analysis research: A literature review</article-title>,&#x201D; <source>Social Network Analysis and Mining</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>22</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. H.</given-names> <surname>Alwaneen</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Azmi</surname></string-name>, <string-name><given-names>H. A.</given-names> <surname>Aboalsamh</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Arabic question answering system: A survey</article-title>,&#x201D; <source>Artificial Intelligence Review</source>, vol. <volume>55</volume>, no. <issue>1</issue>, pp. <fpage>207</fpage>&#x2013;<lpage>253</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Oueslati</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ben HajHmida</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Ounelli</surname></string-name></person-group>, &#x201C;<article-title>A review of sentiment analysis research in arabic language</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>112</volume>, pp. <fpage>408</fpage>&#x2013;<lpage>430</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Song</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>A Multi-task learning model for Chinese-oriented aspect polarity classification and aspect term extraction</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>419</volume>, pp. <fpage>344</fpage>&#x2013;<lpage>356</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Antoun</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Baly</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Hajj</surname></string-name></person-group>, &#x201C;<article-title>AraBERT: Transformer-based model for arabic language understanding</article-title>,&#x201D; in <conf-name>Proc. of the 12th Language Resources and Evaluation Conf. (LREC 2020 Workshop)</conf-name>, <conf-loc>Marseille, France</conf-loc>, pp. <fpage>9</fpage>&#x2013;<lpage>15</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Han</surname></string-name></person-group>, &#x201C;<article-title>Lcf: A local context focus mechanism for aspect-based sentiment classification</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>9</volume>, no. <issue>16</issue>, pp. <fpage>3389</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Pontiki</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Galanis</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Papageorgiou</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Androutsopoulos</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Manandhar</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>SemEval-2016 task 5: Aspect based sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 10th Int. Workshop on Semantic Evaluation (SemEval-2016)</conf-name>, <conf-loc>San Diego, California, USA</conf-loc>, pp. <fpage>19</fpage>&#x2013;<lpage>30</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Poria</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name>, <string-name><given-names>L. -W.</given-names> <surname>Ku</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Gui</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Gelbukh</surname></string-name></person-group>, &#x201C;<article-title>A Rule-based approach to aspect extraction from product reviews</article-title>,&#x201D; in <conf-name>Proc. of the Second Workshop on Natural Language Processing for Social Media (SocialNLP)</conf-name>, <conf-loc>Dublin, Ireland</conf-loc>, pp. <fpage>28</fpage>&#x2013;<lpage>37</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. A.</given-names> <surname>Rana</surname></string-name> and <string-name><given-names>Y. N.</given-names> <surname>Cheah</surname></string-name></person-group>, &#x201C;<article-title>A Two-fold rule-based model for aspect extraction</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>89</volume>, pp. <fpage>273</fpage>&#x2013;<lpage>285</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Scaffidi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Bierhoff</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Felker</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ng</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Red opal: Product-feature scoring from reviews</article-title>,&#x201D; in <conf-name>Proc. of the 8th ACM Conf. on Electronic Commerce</conf-name>, <conf-loc>San Diego, California, USA</conf-loc>, pp. <fpage>182</fpage>&#x2013;<lpage>191</lpage>, <year>2007</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Yan</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Kim</surname></string-name></person-group>, &#x201C;<article-title>An LDA and synonym lexicon based approach to product feature extraction from online consumer product reviews</article-title>,&#x201D; <source>Journal of Electronic Commerce Research</source>, vol. <volume>14</volume>, no. <issue>4</issue>, pp. <fpage>304</fpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. T.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Durrani</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Khalid</surname></string-name></person-group>, &#x201C;<article-title>Aspect-based sentiment analysis on a large-scale data: Topic models are the preferred solution</article-title>,&#x201D; <source>Bahria University Journal of Information &#x0026; Communication Technologies</source>, vol. <volume>8</volume>, no. <issue>2</issue>, pp. <fpage>22</fpage>&#x2013;<lpage>27</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. S.</given-names> <surname>Manek</surname></string-name>, <string-name><given-names>P. D.</given-names> <surname>Shenoy</surname></string-name>, <string-name><given-names>M. C.</given-names> <surname>Mohan</surname></string-name> and <string-name><given-names>K. R.</given-names> <surname>Venugopal</surname></string-name></person-group>, &#x201C;<article-title>Aspect term extraction for sentiment analysis in large movie reviews using gini index feature selection method and SVM classifier</article-title>,&#x201D; <source>World Wide Web</source>, vol. <volume>20</volume>, no. <issue>2</issue>, pp. <fpage>135</fpage>&#x2013;<lpage>154</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Xiang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>He</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Zheng</surname></string-name></person-group>, &#x201C;<article-title>Aspect term extraction based on MFE-CRF</article-title>,&#x201D; <source>Information</source>, vol. <volume>9</volume>, no. <issue>8</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Wen</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name></person-group>, &#x201C;<article-title>Aspect term extraction of E-commerce comments based on model ensemble</article-title>,&#x201D; in <conf-name>Proc. 2017 14th Int. Computer Conf. on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)</conf-name>, <conf-loc>Chengdu, China</conf-loc>, pp. <fpage>24</fpage>&#x2013;<lpage>27</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Rietzler</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Stabinger</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Opitz</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Engl</surname></string-name></person-group>, &#x201C;<article-title>Adapt or get left behind: Domain adaptation through BERT language model finetuning for aspect-target sentiment classification</article-title>,&#x201D; in <conf-name>Proc. of the 12th Language Resources and Evaluation Conf.</conf-name>, <conf-loc>Marseille, France</conf-loc>, pp. <fpage>4933</fpage>&#x2013;<lpage>4941</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Giannakopoulos</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Musat</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Hossmann</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Baeriswyl</surname></string-name></person-group>, &#x201C;<article-title>Unsupervised aspect term extraction with b-lstm &#x0026; crf using automatically labelled datasets</article-title>,&#x201D; <comment>arXiv preprint arXiv:1709.05094</comment>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Barnaghi</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Kontonatsios</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Bessis</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Korkontzelos</surname></string-name></person-group>, &#x201C;<article-title>Aspect extraction from reviews using convolutional neural networks and embeddings</article-title>,&#x201D; in <conf-name>Proc. of 24th Int. Conf. on Applications of Natural Language to Information Systems, (NLDB 2019)</conf-name>, <conf-loc>Salford, UK</conf-loc>, pp. <fpage>409</fpage>&#x2013;<lpage>415</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shu</surname></string-name> and <string-name><given-names>S. Y.</given-names> <surname>Philip</surname></string-name></person-group>, &#x201C;<article-title>Double embeddings and CNN-based sequence labeling for aspect extraction</article-title>,&#x201D; in <conf-name>Proc. of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</conf-name>, <conf-loc>Melbourne, Australia</conf-loc>, pp. <fpage>592</fpage>&#x2013;<lpage>598</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bing</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Recurrent attention network on memory for aspect sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 2017 Conf. on Empirical Methods in Natural Language Processing</conf-name>, <conf-loc>Copenhagen, Denmark</conf-loc>, pp. <fpage>452</fpage>&#x2013;<lpage>461</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S. J.</given-names> <surname>Pan</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Dahlmeier</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Xiao</surname></string-name></person-group>, &#x201C;<article-title>Coupled multi-layer attentions for co-extraction of aspect and opinion terms</article-title>,&#x201D; in <conf-name>Proc. of the Thirty-First Association for the Advancement of Artificial Intelligence (AAAI) Conf. on Artificial Intelligence</conf-name>, <conf-loc>San Francisco, California, USA</conf-loc>, pp. <fpage>3316</fpage>&#x2013;<lpage>3322</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>A. S.</given-names> <surname>Veerubhotla</surname></string-name>, <string-name><given-names>V. T.</given-names> <surname>Narapareddy</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Aruru</surname></string-name>, <string-name><given-names>L. B. M.</given-names> <surname>Neti</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Aspect term extraction for opinion mining using a hierarchical self-attention network</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>465</volume>, pp. <fpage>195</fpage>&#x2013;<lpage>204</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. N.</given-names> <surname>Dos Santos</surname></string-name>, <string-name><given-names>R. M.</given-names> <surname>Marcacini</surname></string-name> and <string-name><given-names>S. O.</given-names> <surname>Rezende</surname></string-name></person-group>, &#x201C;<article-title>Multi-domain aspect extraction using bidirectional encoder representations from transformers</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>91604</fpage>&#x2013;<lpage>91613</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Lopes</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Correa</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Freitas</surname></string-name></person-group>, &#x201C;<article-title>Exploring BERT for aspect extraction in Portuguese language</article-title>,&#x201D; in <conf-name>Int. FLAIRS Conf. Proc.</conf-name>, <conf-loc>North Miami Beach, Florida, USA</conf-loc>, vol. <volume>34</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>. <year>2021</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>Y. A.</given-names> <surname>Winatmoko</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Septiandri</surname></string-name> and <string-name><given-names>A. P.</given-names> <surname>Sutiono</surname></string-name></person-group>, &#x201C;<article-title>Aspect and opinion term extraction for hotel reviews using transfer learning and auxiliary labels</article-title>,&#x201D; <comment>arXiv preprint arXiv:1909.11879</comment>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Qin</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Feng</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Effective LSTMs for target-dependent sentiment classification</article-title>,&#x201D; in <conf-name>Proc. of COLING 2016, the 26th Int. Conf. on Computational Linguistics: Technical Papers</conf-name>, <conf-loc>Osaka, Japan</conf-loc>, pp. <fpage>3298</fpage>&#x2013;<lpage>3307</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Zhao</surname></string-name></person-group>, &#x201C;<article-title>Attention-based LSTM for aspect-level sentiment classification</article-title>,&#x201D; in <conf-name>Proc. of the 2016 Conf. on Empirical Methods in Natural Language Processing</conf-name>, <conf-loc>Austin, Texas, USA</conf-loc>, pp. <fpage>606</fpage>&#x2013;<lpage>615</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Meng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Yin</surname></string-name></person-group>, &#x201C;<article-title>Aspect based sentiment analysis with feature enhanced attention CNN-BiLSTM</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>167240</fpage>&#x2013;<lpage>167249</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Liang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Gui</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<article-title>Aspect-based sentiment analysis via affective knowledge enhanced graph convolutional</article-title>,&#x201D; <source>Knowledge-Based Systems</source>, vol. <volume>235</volume>, pp. <fpage>107643</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Bing</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Lam</surname></string-name></person-group>, &#x201C;<article-title>Exploiting BERT for end-to-end aspect-ased sentiment analysis&#x2217;</article-title>,&#x201D; <comment>arXiv preprint arXiv:1910.00883</comment>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shu</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>BERT Post-training for review reading comprehension and aspect-based sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 2019 Conf. of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</conf-name>, <conf-loc>Minneapolis, Minnesota, USA</conf-loc>, vol. <volume>1</volume>, pp. <fpage>2324</fpage>&#x2013;<lpage>2335</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Schmitt</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Steinheber</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Schreiber</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Roth</surname></string-name></person-group>, &#x201C;<article-title>Joint aspect and polarity classification for aspect-based sentiment analysis with end-to-end neural networks</article-title>,&#x201D; in <conf-name>Proc. of the 2018 Conf. on Empirical Methods in Natural Language Processing</conf-name>, <conf-loc>Brussels, Belgium</conf-loc>, pp. <fpage>1109</fpage>&#x2013;<lpage>1114</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Nguyen</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Shirai</surname></string-name></person-group>, &#x201C;<article-title>A joint model of term extraction and polarity classification for aspect-based sentiment analysis</article-title>,&#x201D; in <conf-name>2018 10th Int. Conf. on Knowledge and Systems Engineering (KSE)</conf-name>, <conf-loc>Springer, Cham</conf-loc>, pp. <fpage>323</fpage>&#x2013;<lpage>328</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Pontiki</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Galanis</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Pavlopoulos</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Papageorgiou</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Androutsopoulos</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Semeval-2014 task 4: Aspect based sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 8th Int. Workshop on Semantic Evaluation</conf-name>, <conf-loc>Dublin, Ireland</conf-loc>, pp. <fpage>27</fpage>&#x2013;<lpage>35</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-51"><label>[51]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Pontiki</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Galanis</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Papageorgiou</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Manandhar</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Androutsopoulos</surname></string-name></person-group>, &#x201C;<article-title>Semeval-2015 task 12: Aspect based sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 9th Int. Workshop on Semantic Evaluation (SemEval 2015)</conf-name>, <conf-loc>Denver, Colorado, USA</conf-loc>, pp. <fpage>486</fpage>&#x2013;<lpage>495</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-52"><label>[52]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Multi-task BERT for aspect-based sentiment analysis</article-title>,&#x201D; in <conf-name>2021 IEEE Int. Conf. on Smart Computing (SMARTCOMP)</conf-name>, <conf-loc>Irvine, CA, USA</conf-loc>, pp. <fpage>383</fpage>&#x2013;<lpage>385</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-53"><label>[53]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. S.</given-names> <surname>Akhtar</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Garg</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Ekbal</surname></string-name></person-group>, &#x201C;<article-title>Multi-task learning for aspect term extraction and aspect sentiment classification</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>398</volume>, pp. <fpage>247</fpage>&#x2013;<lpage>256</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-54"><label>[54]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Van Thin</surname></string-name>, <string-name><given-names>D. -V.</given-names> <surname>Nguyen</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Van Nguyen</surname></string-name>, <string-name><given-names>N. L. -T.</given-names> <surname>Nguyen</surname></string-name> and <string-name><given-names>A. H. -T.</given-names> <surname>Nguyen</surname></string-name></person-group>, &#x201C;<article-title>Multi-task learning for aspect and polarity recognition on Vietnamese datasets</article-title>,&#x201D; in <conf-name>16th Int. Conf. of the Pacific Association for Computational Linguistics</conf-name>, <conf-loc>Springer</conf-loc>, <conf-loc>Singapore</conf-loc>, pp. <fpage>169</fpage>&#x2013;<lpage>180</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-55"><label>[55]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Ciregan</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Meier</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Schmidhuber</surname></string-name></person-group>, &#x201C;<article-title>Multi-column deep neural networks for image classification</article-title>,&#x201D; in <conf-name>2012 IEEE Conf. on Computer Vision and Pattern Recognition (CVRP)</conf-name>, <conf-loc>Providence, RI, USA</conf-loc>, pp. <fpage>3642</fpage>&#x2013;<lpage>3649</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-56"><label>[56]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>LeCun</surname></string-name></person-group>, &#x201C;<article-title>Character-level convolutional networks for text classification</article-title>,&#x201D; <source>Advances in Neural Information Processing Systems</source>, vol. <volume>28</volume>, pp. <fpage>649</fpage>&#x2013;<lpage>657</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-57"><label>[57]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. -K.</given-names> <surname>Kung</surname></string-name>, <string-name><given-names>C. -M.</given-names> <surname>Hsieh</surname></string-name>, <string-name><given-names>C. -Y.</given-names> <surname>Ho</surname></string-name>, <string-name><given-names>Y. -C.</given-names> <surname>Tsai</surname></string-name>, <string-name><given-names>H. -Y.</given-names> <surname>Chan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Data-augmented hybrid named entity recognition for disaster management by transfer learning</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>10</volume>, no. <issue>12</issue>, pp. <fpage>4234</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-58"><label>[58]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Fadaee</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bisazza</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Monz</surname></string-name></person-group>, &#x201C;<article-title>Data augmentation for low-resource neural machine translation</article-title>,&#x201D; <comment>arXiv preprint arXiv: 1705.00440</comment>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-59"><label>[59]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Liesting</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Frasincar</surname></string-name> and <string-name><given-names>M. M.</given-names> <surname>Tru&#x015F;c&#x0103;</surname></string-name></person-group>, &#x201C;<article-title>Data augmentation in a hybrid approach for aspect-based sentiment analysis</article-title>,&#x201D; in <conf-name>Proc. of the 36th Annual ACM Symp. on Applied Computing</conf-name>, <conf-loc>New York, NY, USA</conf-loc>, pp. <fpage>828</fpage>&#x2013;<lpage>835</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-60"><label>[60]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Yan</surname></string-name></person-group>, &#x201C;<article-title>Data augmentation for aspect-based sentiment analysis</article-title>,&#x201D; <source>International Journal of Machine Learning and Cybernetics</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>125</fpage>&#x2013;<lpage>133</lpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-61"><label>[61]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Quan</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Ling</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Song</surname></string-name></person-group>, &#x201C;<article-title>Conditional augmentation for aspect term extraction via masked sequence-to-sequence generation</article-title>,&#x201D; in <conf-name>Proc. of the 58th Annual Meeting of the Association for Computational Linguistics</conf-name>, <conf-loc>online</conf-loc>, pp. <fpage>7056</fpage>&#x2013;<lpage>7066</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-62"><label>[62]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Aly</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Atiya</surname></string-name></person-group>, &#x201C;<article-title>Labr: A large scale arabic book reviews dataset</article-title>,&#x201D; in <conf-name>Proc. of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</conf-name>, <conf-loc>Sofia, Bulgaria</conf-loc>, pp. <fpage>494</fpage>&#x2013;<lpage>498</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-63"><label>[63]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Obaidat</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Mohawesh</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Ayyoub</surname></string-name>, <string-name><given-names>A. -S.</given-names> <surname>Mohammad</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Jararweh</surname></string-name></person-group>, &#x201C;<article-title>Enhancing the determination of aspect categories and their polarities in arabic reviews using lexicon-based approaches</article-title>,&#x201D; in <conf-name>2015 IEEE Jordan Conf. on Applied Electrical Engineering and Computing Technologies (AEECT)</conf-name>, <conf-loc>Amman, Jordan</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-64"><label>[64]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ismail</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Alsammak</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Elshishtawy</surname></string-name></person-group>, &#x201C;<article-title>A generic approach for extracting aspects and opinions of arabic reviews</article-title>,&#x201D; in <conf-name>Proc. of the 10th Int. Conf. on Informatics and Systems</conf-name>, <conf-loc>Giza Egypt</conf-loc>, pp. <fpage>173</fpage>&#x2013;<lpage>179</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-65"><label>[65]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Al-Smadi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Ayyoub</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Al-Sarhan</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Jararwell</surname></string-name></person-group>, &#x201C;<article-title>An aspect-based sentiment analysis approach to evaluating arabic news affect on readers</article-title>,&#x201D; <source>Journal of Universal Computer Science</source>, vol. <volume>22</volume>, no. <issue>5</issue>, pp. <fpage>630</fpage>&#x2013;<lpage>649</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-66"><label>[66]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Al-Smadi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Ayyoub</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Jararweh</surname></string-name> and <string-name><given-names>O.</given-names> <surname>Qawasmeh</surname></string-name></person-group>, &#x201C;<article-title>Enhancing aspect-based sentiment analysis of arabic hotels&#x2019; reviews using morphological, syntactic and semantic features</article-title>,&#x201D; <source>Information Processing &#x0026; Management</source>, vol. <volume>56</volume>, no. <issue>2</issue>, pp. <fpage>308</fpage>&#x2013;<lpage>319</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-67"><label>[67]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname>Ashi</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Siddiqui</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Nadeem</surname></string-name></person-group>, &#x201C;<article-title>Pre-trained word embeddings for arabic aspect-based sentiment analysis of airline tweets</article-title>,&#x201D; in <conf-name>Proc. of the Int. Conf. on Advanced Intelligent Systems and Informatics</conf-name>, <conf-loc>Springer, Cham</conf-loc>, pp. <fpage>241</fpage>&#x2013;<lpage>251</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-68"><label>[68]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Al-Smadi</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Qawasmeh</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Ayyoub</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Jararweh</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Gupta</surname></string-name></person-group>, &#x201C;<article-title>Deep recurrent neural network vs. support vector machine for aspect-based sentiment analysis of arabic hotels&#x2019; reviews</article-title>,&#x201D; <source>Journal of Computational Science</source>, vol. <volume>27</volume>, pp. <fpage>386</fpage>&#x2013;<lpage>393</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-69"><label>[69]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Al-Smadi</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Talafha</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Ayyoub</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Jararweh</surname></string-name></person-group>, &#x201C;<article-title>Using long short-term memory deep neural networks for aspect-based sentiment analysis of arabic reviews</article-title>,&#x201D; <source>International Journal of Machine Learning and Cybernetics</source>, vol. <volume>10</volume>, no. <issue>8</issue>, pp. <fpage>2163</fpage>&#x2013;<lpage>2175</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-70"><label>[70]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname>Abdelgwad</surname></string-name>, <string-name><given-names>T. H. A.</given-names> <surname>Soliman</surname></string-name>, <string-name><given-names>A. I.</given-names> <surname>Taloba</surname></string-name> and <string-name><given-names>M. F.</given-names> <surname>Farghaly</surname></string-name></person-group>, &#x201C;<article-title>Arabic aspect based sentiment analysis using bidirectional GRU based models</article-title>,&#x201D; <source>Journal of King Saud University-Computer and Information Sciences</source>, vol. <volume>34</volume>, no. <issue>9</issue>, pp. <fpage>6652</fpage>&#x2013;<lpage>6662</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-71"><label>[71]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>S. Al-Dabet</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Tedmori</surname></string-name>, and <string-name><given-names>M.</given-names> <surname>Al-Smadi</surname></string-name></person-group>, &#x201C;<article-title>Extracting opinion targets using attention-based neural model</article-title>,&#x201D; <source>SN Computer Science</source>, vol. <volume>1</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-72"><label>[72]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname> Abdelgwad</surname></string-name></person-group>, &#x201C;<article-title>Arabic aspect based sentiment analysis using BERT</article-title>,&#x201D; <comment>arXiv preprint arXiv:2107.13290</comment>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-73"><label>[73]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Bensoltane</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Zaki</surname></string-name></person-group>, &#x201C;<article-title>Towards arabic aspect-based sentiment analysis: A transfer learning-based approach</article-title>,&#x201D; <source>Social Network Analysis and Mining</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-74"><label>[74]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Behdenna</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Fatiha</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Belalem</surname></string-name></person-group>, &#x201C;<article-title>Ontology-based approach to enhance explicit aspect extraction in standard arabic reviews</article-title>,&#x201D; <source>International Journal of Computing and Digital Systems</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>277</fpage>&#x2013;<lpage>287</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-75"><label>[75]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. S.</given-names> <surname>Fadel</surname></string-name>, <string-name><given-names>M. E.</given-names> <surname>Saleh</surname></string-name> and <string-name><given-names>O. A.</given-names> <surname>Abulnaja</surname></string-name></person-group>, &#x201C;<article-title>Arabic aspect extraction based on stacked contextualized embedding with deep learning</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>10</volume>, pp. <fpage>30526</fpage>&#x2013;<lpage>30535</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-76"><label>[76]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. E.</given-names> <surname>Chennafi</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Bedlaoui</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Dahou</surname></string-name> and <string-name><given-names>M. A. A.</given-names> <surname>Al-qaness</surname></string-name></person-group>, &#x201C;<article-title>Arabic aspect-based sentiment classification using seq2seq dialect normalization and transformers</article-title>,&#x201D; <source>Knowledge</source>, vol. <volume>2</volume>, no. <issue>3</issue>, pp. <fpage>388</fpage>&#x2013;<lpage>401</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-77"><label>[77]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname>Abdelgwad</surname></string-name>, <string-name><given-names>T. H. A.</given-names> <surname>Soliman</surname></string-name> and <string-name><given-names>A. I.</given-names> <surname>Taloba</surname></string-name></person-group>, &#x201C;<article-title>Arabic aspect sentiment polarity classification using BERT</article-title>,&#x201D; <source>Journal of Big Data</source>, vol. <volume>9</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-78"><label>[78]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Bensoltane</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Zaki</surname></string-name></person-group>, &#x201C;<article-title>Combining BERT with TCN-BiGRU for enhancing arabic aspect category detection</article-title>,&#x201D; <source>Journal of Intelligent &#x0026; Fuzzy Systems.</source>, no. <issue>Preprint</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-79"><label>[79]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Vaswani</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Shazeer</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Parmar</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Uszkoreit</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Jones</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Attention is all you need</article-title>,&#x201D; <source>Advances in Neural Information Processing Systems</source>, vol. <volume>30</volume>, pp. <fpage>5999</fpage>&#x2013;<lpage>6009</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-80"><label>[80]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Minaee</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kalchbrenner</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Nikzad</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Chenaghlu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Deep learning&#x2013;based text classification: A comprehensive review</article-title>,&#x201D; <source>ACM Computing Surveys (CSUR)</source>, vol. <volume>54</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>40</lpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>