# Simulation of English Word Order Sorting Based on Semionline Model and Artificial Intelligence

Authors: Zhange Meng; Nan Li
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

To improve the word order ranking effect of English language retrieval, based on machine learning algorithms, this paper combines a semionline model to construct an artificial intelligence ranking model for English word order based on a semionline model and establishes a semisupervised ELM regression model. Moreover, this paper derives the mathematical model of semisupervised ELM in detail and uses FCM clustering to screen credible samples, ELM collaborative training to mark each other’s samples, and the marked samples to calculate the output weights of semisupervised ELM regression. In addition, based on continuous learning of OSELMR, this paper uses confidence evaluation to screen out credible unlabeled samples, OSELM collaborative training to mark the credible samples with each other, and credible unlabeled samples to calculate the output weight of SSOSELMR. Finally, this paper designs a control experiment to analyze the model algorithm, compares and counts the parameters, and draws a statistical graph. The research results show that the model constructed in this paper is effective.


---

## Body

## 1. Introduction

English has become the universal language in the world, and there will inevitably be problems with English ordering when obtaining information, which also directly affects the terminal experience of nonnative English speakers. To improve the effect of English word order, artificial intelligence models need to be used for auxiliary improvement [1]. Information retrieval research usually covers two issues that need to be solved urgently. One is the understanding of user queries, that is, how to fully understand the user’s information needs as much as possible based on the user’s submitted queries that only contain a few keywords, and provide documents or web pages that meet their needs [2]. The second is the construction of the retrieval model, that is, how to measure the degree of relevance between the user’s query and the web page or document to be retrieved and give a sorted list of results according to the difference in relevance, to meet the user’s information needs [3]. To solve the previously mentioned two problems, information retrieval research is usually carried out from two aspects. On the one hand, research focuses on fully understanding user queries, and on the other hand, research focuses on the reasonable construction of retrieval models. The previously mentioned two researches are complementary, and a full understanding of user queries can enable the retrieval system to more accurately locate user information needs. On this basis, a reasonably constructed retrieval model can mine web pages or documents related to user needs to meet information needs and improve retrieval accuracy and user experience [4].In query expansion or query reduction, the direct addition or deletion of some terms is likely to cause part of the user’s information needs to be missing or offset. To avoid this kind of situation, a common practice is to weigh the query terms. That is, based on the reconstruction of the query, the terms that are more closely related to the user’s information needs are given a higher weight, and the terms that are more ambiguous with the user’s information needs are given a lower weight, so as to fully cover the user’s information needs while taking into account the completeness of the query, and understand the user’s query more accurately [5]. In terms of the retrieval model, the traditional retrieval model aims to construct effective query representation and document representation. It evaluates the relevance between the document and the query by calculating the similarity between the two and then gives a sorted list of documents as the output result of the retrieval system according to the relevance of the document from high to low. Such methods include the vector space model, BM25 model, and query likelihood language model [6]. Next, this article takes the vector space model as an example. The model represents the query and document as vectors of dictionary dimensions. Among them, the dictionary dimension refers to the total number of all terms included in the retrieval data set, and the value of each dimension of the vector is the weight of the term. The weight calculation of this model can adopt such methods as word frequency inverse document frequency [7]. Furthermore, the model calculates the similarity between the query and the document based on the query representation and the document representation and uses this as a basis to evaluate the relevance of the query and different documents to obtain the document ranking list [8]. In recent years, learning to rank (LTR) has been proposed and widely used to construct more effective retrieval models. Different from the traditional retrieval model, the ranking learning model uses a supervised machine learning method as the core algorithm. Moreover, it takes traditional retrieval model scores as document features, takes document ranking as model optimization goal, defines a loss function based on ranking, and obtains the final retrieval model through supervised training [9].


## 2. Related Work

To solve the inconsistency between the original query and the expanded term, the literature proposed to update the query language model with pseudorelevant feedback documents [10]. Moreover, it verified the effectiveness of the model within the framework of two retrieval methods: probabilistic model feedback and KL distance minimization. The literature proposed to predict query performance by calculating the relative entropy of the query language model and the collective language model and used the clarity index to predict the degree of ambiguity of query expression [11]. The literature regarded query expansion as an optimization problem integrating multiple information sources and multiple goals and gave detailed theoretical derivation and comprehensive empirical evaluation [12]. Moreover, it reduced the empirical risk of query expansion from the robustness limitation, which lays an important theoretical foundation for subsequent research on query expansion. Aiming at the problem of parameter adjustment in pseudocorrelation feedback, the literature proposed a pseudocorrelation feedback method based on statistical language models [13]. This method integrates the original query and feedback documents through a single probability mixed model and uses language model parameters as regularization items, thereby effectively avoiding manual selection of parameters, improving the robustness of retrieval results and the generalization ability of the method. The literature proposed to use word vectors to expand the query language model. This model uses word vectors as nonquery word selection and weight evaluation and applies this method to the pseudorelevance feedback process [14]. The experimental results show that this method can select more semantically related expansion words to improve retrieval performance. The literature proposed a probabilistic ranking function based on Bayesian decision theory, which is used to fuse document language models and query language models, and used Markov random chain prediction query language models based on document collections [15].


## 3. Extreme Learning Machine

The artificial neural network is composed of the sensations of analog neurons connected to each other. According to the connection mode of the perceptron, the neural network can be divided into a feedforward neural network and a feedback neural network. The feedforward neural network has a three-layer network structure: input layer, hidden layer, and output layer. Among them, the hidden layer can have several layers. The learning process of the neural network is that the input layer inputs the observation value, the hidden layer trains the observation value to obtain the estimated value of the parameter, and the output layer outputs the target value of the sample. The single hidden layer feedforward neural network is a feedforward neural network with only one hidden layer. The network structure of SLFN is shown in Figure1. For the generality of the analysis, the figure describes the situation where the output layer is a target output.Figure 1
Single hidden layer feedforward neural network.As shown in Figure1, in the standard SLFN, N˜ is the number of hidden layer nodes, G is the activation function, and X is the input sample of the input layer, which has n attributes of gates. wi and bi are the front parameters of the hidden layer, and the subscript i is the i-th node in the hidden layer. For increasing the node SLFN, wi is the weight connecting the input layer node and the i-th node in the hidden layer, and bi is the threshold value of the i-th node in the hidden layer. For the radial base node SLFN, wi is the center of the radial base node, and bi is the influence factor of the radial base node.The output of thei-th node in the hidden layer of the added node SLFN is(1)Gwi,bi,x=gwi⋅x+bi.The output of thei-th node of the hidden layer of the radial basis node SLFN is(2)Gwi,bi,x=gbix−wi.Furthermore, by weighting the output ofN˜ nodes in the hidden layer, the output of the SLFN network is obtained:(3)o=fN˜x=∑i=1N˜βiGwi,bi,x.Among them,βi is the weight connecting the i-th hidden layer node and the output layer node, and wi⋅x represents the inner product of wi and x.The SLFN learning process is to input the observation value of the sample into the input layer, train the attributes of the labeled sample and determine the specific values of the parameterswi, bi, and βi for the target output, and use the trained parameter values to calculate the label value of the unknown label sample and the output layer to output the label value of the sample.ForN mutually independent and different samples xi,ti,(4)xi=xi1,xi2,…,xinT∈Rn,ti=ti1,ti2,…,timT∈Rm.The mathematical model of the standard SLFN with the number of hidden nodes beingN˜ and the activation function being gx is(5)∑j=1N∑i=1N˜βigxj=∑j=1N∑i=1N˜βigwi⋅xj+bi.Among them,(6)wi=wi1,wi2,…,winT,βi=βi1,βi2,…,βimT.The standard SLFN with the number of hidden layer nodesN˜ and the activation number gx can approximate N different samples with zero error; that is, the error between the instantaneous standard output of the standard SLFN and the real is zero:(7)∑j=1N˜oj−tj=0.In other words, there are parametersβi, wi, and bi that make the following true:(8)∑j=1N∑i=1N˜βigwi⋅xj+bi=tj.The mathematical model of the standard SLFN:(9)∑j=1N∑i=1N˜βigwi⋅xj+bi=tj.It is abbreviated as follows:(10)Hβ=T.Among them,(11)Hw1,…,wN˜,b1,…,bN˜,x1,…,xN=gw1⋅x1+b1⋯gwN˜⋅x1+bN˜⋮⋯⋮gw1⋅xN+b1⋯gwN˜⋅xN+bN˜N×N˜,T=t1T⋮tNTN×m.H is called the hidden layer output matrix of SLFN, the column of H is the output value of each hidden layer node corresponding to the input x1,x2,…,xN, and the row of H is the output value of the hidden layer node 1,…,N˜ of each sample.SLFN has the following theorems.Theorem 1.
The activation functiongx of the standard SLFN with the hidden node N˜ is infinitely differentiable in any interval. The input samples are N mutually independent and different samples xi,ti, where xi∈Rn,ti∈Rm. When random numbers on any interval of Rn and R generated by any continuous probability distribution function are assigned to win and bi, there must be a hidden layer output matrix H of the SLFN network that is invertible.(12)Hβ−T=0.Theorem 2.
When there is an infinitely small positive numberε<0, for an infinitely differentiable standard SLFN in any interval, the hidden layer node is n and the activation function is gx, and N mutually independent and different samples xi,ti are input, where xi∈Rn,ti∈Rm, and N˜≤N. When random numbers on any interval of Rn and R generated for any continuous probability distribution function are assigned to wi and bi, there must be(13)HN×N˜βN˜×N−TN×M≤ε.When the activation function of SLFN is infinitely differentiable, for a dataset containing N different samples, the number of hidden layer nodes of SLFN needs to be much smaller than the number of samples, that is,N˜≤N. In addition, activation functions that are infinitely differentiable in any interval include sigmoidal, sine, and cosine.The cost functionE of SLFN is(14)E=∑j=1N∑i=1N˜βigwi⋅xj+bi−tj2.Traditionally, the process of using a dataset to train the SLFN is to specify the values of the parametersβi, wi, and bi, and find the estimated values of β^iw^ib^i that satisfy the following:(15)w^i,b^i,β^=minwi,bi,βHw1,…,wN˜,b1,…,bN˜β−T.WhenH is unknown, the gradient descent algorithm is usually used to find the minimum value of Hβ−T. In the step of using the gradient descent algorithm, wi,βi and bi constitute a vector W, as shown in the following formula, and the parameter values are adjusted iteratively.(16)Wk+1=Wk−η∂EW∂W.Among them,η is the learning rate.The BP algorithm, one of the typical algorithms of feedforward neural networks, calculates the gradient by returning the output value to the input layer. However, there are some problems in the BP algorithm.(1)
When the learning rate is too small, the algorithm converges slowly, and the learning rate is too large, and the algorithm is unstable or even divergent.(2)
BP algorithm has a local minimum solution, and learning will stop at the local minimum solution. When the local minimum solution is far from the global minimum solution, the result is not ideal.(3)
The network may be overtrained and get worse generalization ability. It is necessary to add verification and appropriate stopping conditions to the cost function.(4)
In many applications, the process of gradient descent takes a long time.Traditional SLFN needs to adjust the input weight and hidden layer threshold. According to Theorems1 and 2, when the activation function is infinitely differentiable, the parameters wi and bi can be randomly assigned. Compared with traditional SLFN, all parameters need to be adjusted. In this case, there is no need to iteratively adjust the values of wi and bi. In the initial stage of learning, random values are assigned to the parameters wi and bi, and the output matrix H of the hidden layer remains unchanged. In the subsequent learning process, the values of parameters wi and bi are fixed, and the process of training SLFN is to find the least square solution β^ of the linear system Hβ=T.(17)Hw1,…,wN˜,b1,…,bN˜β−T=minβHw1,…,wN˜,b1,…,bN˜β−T.When the number of input samples is equal to the number of hidden layer nodesN˜=N, the values of input weight wi and hidden layer threshold bi are randomly selected, and the matrix H is square and invertible, and SLFN can approximate the training samples with zero error.However, in most cases, the number of hidden layer nodes is much smaller than the number of training samplesN˜≤N. Currently, H is not a square matrix, and there are no βi, wi, and bi to make(18)Hβ=T.Currently, according to the nature of theHβ=T solution of the linear system, the least square solution with the smallest norm is(19)β^=H+T=HTH−1HTT,whereH+ is the generalized inverse of H.The following important properties of SLFN can be obtained from the previously mentioned description.(1)
The least square solution makes SLFN have the smallest training error. Whenβ^=H+T is the least square solution of the linear system Hβ=T, the training error is the smallest as follows:(20)Hβ^−T=HH+T−T=minβHβ−T.(2)
SLFN has an output weight with the smallest norm.β^=H+T is the least square solution with the smallest norm among all the solutions of the linear system Hβ=T as follows:(21)β^=H+T≤β,∀β=β:Hβ−T≤Hz−T,∀z∈RN˜×N.(3)
The least squares solution with the smallest norm of SLFN is unique.In view of the previously mentioned analysis, an extreme learning machine (ELM) is proposed. The ELM learning process is as follows.The training set is(22)N=xj,tj|xj∈RN,tj∈Rm,j=1,…,N.The activation function isgx, and the number of hidden layer nodes is N˜.(1)
The input weightwi and the hidden layer threshold bi are randomly generated, where i=1,…,N˜.(2)
The hidden layer output matrixH is calculated.(23)H=∑i=1N˜gwiwj+bi.(3)
The output weightβ^=H+T is calculated, where T=t1,…,tNT.According to the different connection modes of hidden layer nodes in ELM, ELM can be divided into increased-node-ELM and RBF-node-ELM. The activation function of the increased node ELM is an arbitrary bounded nonconstant piecewise online function, and the activation function of the RBF node ELM is an arbitrary integrable piecewise function.Therefore, we set the number of hidden layer nodes of the ELM toN˜, use the data set of N samples to train the ELM to obtain the output weight, and use the output weight of the ELM to predict the target output T as follows:(24)Hβ^=T.When the activation function isgx and ELM chooses to add nodes, the hidden layer output matrix of ELM is(25)Hw1,…,wN˜,b1,…,bN˜,x1,…,xN=gw1⋅x1+b1⋯gwu⋅x1+bN˜⋮⋯⋮gw1⋅xN+b1⋯gwu⋅xN+bN˜N×N˜.When the activation function isgx and ELM selects the RBF kernel function, the hidden layer output matrix of ELM is(26)Hw1,…,wN˜,b1,…,bN˜,x1,…,xN=ϕb1w1−w1⋯ϕbN˜w1−wN˜⋮⋯⋮ϕb1wN−w1⋯ϕbN˜wN−wN˜N×N˜.The output weight of ELM is(27)β^=H+T,=HTH−1HTT.Compared with the traditional SLFN, the ELM parameters are randomly generated, and there is no need to manually set the initial value, which reduces manual interference and reduces the time for iterative adjustment of parameters. Practical results prove that ELM has better generalization ability than gradient descent SFLN (such as BP algorithm). In terms of fast learning, especially, the learning time of certain application problems can be completed in a few seconds or even shorter. Additionally, ELM solves the traditional SLFN learning stop conditions, learning steps, and local minimization problems.


## 4. Model Building

To describe the algorithm in this paper more vividly, the English word order can be compared to a directed graph set, which is composed of a series of web pages (analogous to the nodes of a directed graph) and hyperlinks (analogous to the arcs of a directed graph). It is particularly noted that the arc has a direction, and its direction represents the incoming chain or the outgoing chain. The directed graphG shown in Figure 2 represents a simple micronetwork, where P1, P2, P3, P4, and P5 represent English words, respectively.Figure 2
Directed graphG.This article uses the algorithm proposed in this article to calculate the PR value of the vocabulary, which is an iterative process in mathematics. The efficiency of the iterative algorithm largely depends on the preset number of iterations, so the number of iterations should be set reasonably according to the web page structure. The algorithm is applied to the network shown in Figure2. The PR value of each word is initialized to 1, and the PR value of each word is calculated after iteration, as shown in Table 1 and Figure 3.Table 1
Iterative process of PR value.
PR (P1)PR (P2)PR (P3)PR (P4)PR (P5)011111110.5750.39441.76020.394421.66270.85810.51621.63550.516231.54170.80670.49441.66570.494441.56730.81760.49891.66200.498951.56420.81630.49841.66410.498461.56590.81700.49871.66460.498771.56640.81720.49881.66520.498881.56690.81740.49891.66550.498991.56710.81760.49891.66570.4989101.56710.81760.49891.66570.4989Figure 3
Statistical diagram of the iterative process of PR value.Through iterative operation, the PR value of the final vocabulary approaches a fixed value. Finally, we found that the PR value of vocabulary P4 is the highest, while the PR values of vocabulary P3 and vocabulary P5 are always the same during the iteration process, because the in-chain and out-chain of these two words are the same. Table1 shows that the algorithm has converged when the number of iterations is 9, and redundant iteration steps will only reduce the efficiency of the algorithm. Therefore, it is very important to set the number of iterations of the PageRank algorithm reasonably.The text is a static structure, and it has no links. Therefore, the first problem is to find a certain connection between the texts, to explain the existence of the link relationship between the texts, so as to measure its importance. The same vocabulary between texts can be regarded as a kind of connection, and the vocabulary intersection between texts can be further regarded as a static link relationship, as shown in Figure4.Figure 4
Link relationship between texts.Among them,Ti and Tj represent two texts, and W1,W2,…,Wn represents the vocabulary intersection between the two texts.Query expansion is two powerful core research techniques in the field of information retrieval. Its purpose is to solve the problem of short query and term mismatch and assist users to better use search engine technology to obtain the relevant information they need more easily and effectively. Query expansion is one of the indispensable processes in the field of short text retrieval, and the quality of its algorithm directly affects retrieval performance. The search result of the original query entered is the data source that generates the new expansion word. The steps of query expansion are briefly explained in Figure5.Figure 5
Implementation steps of query expansion.To improve retrieval efficiency, we need to rewrite the query and add the obtained new query words to the constructed query. The second retrieval of the traditional pseudorelevance feedback related model query uses the same algorithm as the first retrieval and does not distinguish between the newly added extended feature words and the original query words. This has not greatly improved the query accuracy. This paper proposes an improved sorting algorithm to improve the sorting calculation method in terms of content relevance and real-time performance. When calculating the score of the document, the extended word weight factor and time factor are added to improve the retrieval efficiency. The specific algorithm idea is as follows. After the extended feature words are selected in the first retrieval result, each feature word has a corresponding weight, and the weight information is added to the calculation of the second retrieval. At the same time, due to the strong real-time nature of Weibo information, it is necessary to improve the ranking of documents closer to the query time. In addition, the difference between the query time and the creation time of the document is selected as another feature, and the correlation between the query term and the document is calculated based on the previously mentioned features, and the order is sorted according to the obtained weight.


## 5. Model Performance Test Analysis

By examining the indexes of the NTF-IDF-TR algorithm and the NTF-IDF algorithm, it is verified that the algorithm proposed in this paper has a certain influence on the ranking of the English word order retrieval results. In this experiment, we use Lucene’s own word segmentation tool to segment the text dataset and use the information gain method to extract text features, and the text feature dimension is set to 50. In the display of search results, a threshold can be set in the experiment, and the text will be returned only when the similarity between the query word and the text exceeds this threshold. The algorithm in this paper is named SO.This article examines the operating efficiency of different comparison algorithms. For the same experimental dataset, the same query items are input to examine the operational efficiency of each comparison algorithm. In the experiment, the threshold can also be modified to return a different number of relevant search result entries. The experimental results are shown in Table2 and Figure 6.Table 2
Operating efficiency of different algorithms.
Comparison algorithmTime/sTF-IDF0.2303TF-IDF-QLN0.29694NTF-IDF0.41944SO-NTF-IDF-TR0.69776Figure 6
Statistics diagram of the operating efficiency of different algorithms.It can be seen from Table2 and Figure 6 that SO-NTF-IDF-TR is the most inefficient in terms of operational efficiency. The reason is that the SO-NTF-IDF-TR algorithm not only needs to preprocess the text, feature extraction, term weight calculation, and other common text processing tasks, but it also needs to construct a text correlation matrix based on the vocabulary intersection between texts and perform iterative operations on it to calculate the importance of each text. When the text is longer and contains more vocabulary, the amount of calculation is relatively large, and it takes more time. The difference between TF-IDF, TF-IDF-QLN, and NTF-IDF lies in the number of factors considered when calculating the weight of terms. The more factors considered, the longer the processing time. In addition, when the amount of text contained in the text collection is large, the processing time will increase accordingly.On the premise that the experimental data and related parameters are the same, enter the corresponding query items in the five categories to test each comparison algorithm. Only the texts whose similarity is greater than the set threshold are returned. The corresponding accuracy, recall, andF value of text retrieval in different categories are shown in Table 3. The corresponding statistical graph is shown in Figures 7–9.Table 3
Comparison of accuracy, recall andF value of different algorithms.
Text set categoryEarnacqMoney-fxTradeCrudeTF-IDFNumber of related texts82.534.129.716.5TF-IDFReturns the number of texts135.359.448.428.6Accuracy (%)66.9963.1467.5463.47Recall rate (%)76.5668.9771.9477.66F value (%)71.565.8969.6369.85TF-IDF-QLNNumber of related texts92.439.631.916.5TF-IDF-QLNReturns the number of texts135.361.648.424.2Accuracy (%)75.1370.7372.4974.91Recall rate (%)76.4576.2374.6982.39F value (%)75.2473.3773.0478.43NTF-IDFNumber of related texts85.840.734.116.5NTF-IDFReturns the number of texts122.158.346.223.1Accuracy (%)77.3376.7881.1878.54Recall rate (%)76.4578.657780.96F value (%)76.8977.6678.9879.75SO-NTF-IDF-TRNumber of related texts85.840.734.116.5SO-NTF-IDF-TRReturns the number of texts122.158.346.223.1Accuracy (%)77.3376.7881.1878.54Recall rate (%)76.4578.657780.96F value (%)76.8977.6678.9879.75Figure 7
Accuracy performance.Figure 8
Recall performance.Figure 9
F value performance.The comparative experiment results show that the accuracy, recall andF-value of the SO-NTF-IDF-TR algorithm and the NTF-IDF algorithm are the same. Although the algorithm of this paper is integrated into SO-NTF-IDF-TR, it has nothing to do with user queries and can only change the order of the search result list. Therefore, it has no effect on the returned results of the query. These two algorithms are better than the other two algorithms in the comparison algorithm in terms of retrieval effect. The reason is that the NTF-IDF algorithm considers the length of the query keyword in the calculation of the term weight. Therefore, the weight can be smoothly assigned according to the length of the query key. At the same time, the SO-NTF-IDF-TR algorithm incorporates the algorithm proposed in this article in the display of the search result list, t, and considers the static relationship between the text collections, which can prevent some meaningless texts from appearing in the sorting results, so as to ensure that the improved algorithm in this paper can achieve a better recall rate under the same accuracy rate. Generally, this article has a certain effect on the improvement of the TF-IDF weighting method. The overall performance of the algorithm is better, the precision is higher, and it focuses on returning the most accurate search results to users.When using the SO-NTF-IDF-TR method, its accuracy is improved. The reason is that, for the SO-NTF-IDF-TR algorithm, because it integrates an algorithm that considers the importance of text, the SO-NTF-IDF-TR algorithm often returns text that is closely related to the user’s query in the first few items of the search list. However, as the valueN gradually increases, the accuracy of the SO-NTF-IDF-TR algorithm gradually decreases. This is because as the number of search lists increases, there will be many intrusive texts that are irrelevant to the user’s query or have low similarity in the returned search results. It only contains query keywords, which is not in line with the original intention of the user’s query. Naturally, the accuracy of the returned text is not high. Therefore, when the value of N increases, it will affect the accuracy of the SO-NTF-IDF-TR algorithm.


## 6. Conclusion

This paper sorts the word order and vocabulary of English search and realizes the sorting purpose by constructing an artificial intelligence model. Moreover, this article proposes the SSOSELMR algorithm based on the ELM algorithm. First, for semilabeled data, this paper proposes a semisupervised ELM regression model. Then, for the semilabeled NIP spectral data of the online sequence, this paper further improves the semisupervised ELM regression model and proposes a semisupervised online sequence ELM regression model. The experiment proves that SSOSELMR semisupervised online learning effectively improves the learning ability of traditional NIR-supervised batch mode. Moreover, it introduces the text length factor into the vector space model to improve the lexical item weight measurement method and introduces the text importance measurement to examine the importance of each text in the text collection and reorder the search results. Finally, this paper compares and analyzes the weight calculation method and sorting algorithm proposed in this paper and the improved algorithm proposed by other literature through experiments. The experimental results show that the algorithm proposed in this paper effectively improves the accuracy of text retrieval and, to a certain extent, improves the ranking of the retrieval result list.



---

*Source: 5999853-2022-06-28.xml*