# English Machine Translation Model Based on an Improved Self-Attention Technology

Authors: Wenxia Pan
Journal: Scientific Programming
 (2021)

---

## Abstract

English machine translation is a natural language processing research direction that has important scientific research value and practical value in the current artificial intelligence boom. The variability of language, the limited ability to express semantic information, and the lack of parallel corpus resources all limit the usefulness and popularity of English machine translation in practical applications. The self-attention mechanism has received a lot of attention in English machine translation tasks because of its highly parallelizable computing ability, which reduces the model’s training time and allows it to capture the semantic relevance of all words in the context. The efficiency of the self-attention mechanism, however, differs from that of recurrent neural networks because it ignores the position and structure information between context words. The English machine translation model based on the self-attention mechanism uses sine and cosine position coding to represent the absolute position information of words in order to enable the model to use position information between words. This method, on the other hand, can reflect relative distance but does not provide directionality. As a result, a new model of English machine translation is proposed, which is based on the logarithmic position representation method and the self-attention mechanism. This model retains the distance and directional information between words, as well as the efficiency of the self-attention mechanism. Experiments show that the nonstrict phrase extraction method can effectively extract phrase translation pairs from the n-best word alignment results and that the extraction constraint strategy can improve translation quality even further. Nonstrict phrase extraction methods and n-best alignment results can significantly improve the quality of translation translations when compared to traditional phrase extraction methods based on single alignment.


---

## Body

## 1. Introduction

After decades of development and evolution in English machine translation, with the continuous improvement of information technology and computer technology, the research on English machine translation has gradually evolved from the original simple linguistics and computational sciences [1, 2]. It transforms into a comprehensive research field that integrates semantics, mathematics, corpus, computing science, artificial intelligence, and biological sciences. However, the translation quality of English machine translation still cannot reach the level people expect [3]. Especially on the problem of long sentence processing, although computer and other related sciences have made a qualitative leap compared with more than ten years ago, the problem of long sentence processing is still an insurmountable obstacle in the field of English machine translation research [4–6]. It is difficult for long sentences to have a unified and accurate definition because of their different fields and applications. Compared with English machine translation, manual translation is easier to combine the comprehensive background, understand its semantic information, and select the most suitable target language. Translation system capabilities also include other elements such as bilingual knowledge representation, cultural knowledge, and physiological and psychological factors. At present, English machine translation has not reached the level of fully intelligent understanding of semantic information, and it is necessary to continuously give computers the ability to recognize and understand [7, 8].Because the traditional manual translation method is far from meeting the market requirements due to its high cost and slow translation speed, English machine translation came into being in line with the trend of the times [9]. The development of English machine translation technology has been closely following the development of information science, linguistics, and computer science. It is the crown jewel in the field of natural language processing and an important breakthrough and milestone in the field of artificial intelligence. The survey shows that skilled and experienced human translators can complete about 2000 words per 8 hours [10]. This kind of work efficiency cannot meet the growing demand for translation. However, the total amount and speed of translation that an English machine translation system can complete are thousands of times that of human translation [11, 12]. In actual work, English machine translation can shorten delivery time and greatly increase work efficiency. In addition, the translation industry has very high requirements for the professional quality of translators. For some small languages and dialects, there is a shortage of relevant talents. With the help of English machine translation, the translation quality can meet the basic task requirements to make up for the lack of good and bad translators [13–15]. When the number of translations is small, the difference between the cost of manual translation and English machine translation is not particularly obvious. When the workload of translation is increased, the cost of manual translation is much higher than the cost of English machine translation. It takes a very long time and consumes a lot of manpower to train a small language talent with professional knowledge reserves [16].In order to improve the performance of English machine translation, this paper combines the log position representation with the SA mechanism. Specifically, the technical contributions of this article are summarized as follows.First, the model proposed in this paper can achieve better scores in tasks with many long sentences, but the effect is not particularly ideal in tasks with many short sentences. This is because when using logarithms to take relative position expression subscripts, for short sentences, the accuracy between short-distance words is not high enough, and for long sentences, the log function converges slowly and blurs the long-distance in a gradual manner. You can capture the difference in the positional relationship between long-distance words.Second, experiments were carried out for single alignment and N-best alignment. The experimental results show that the nonstrict phrase extraction method is better than the traditional method in the two cases, and the BLEU score has been further improved after the extraction constraint strategy is applied.Third, this article compares the effects of different extraction constraint strategies on the final translation results in detail. Experiments show that the nonstrict phrase extraction method is more suitable for extracting phrases on the N-best alignment, and imposing extraction constraints can further improve the translation quality.


## 2. Related Work

In recent years, with the development of deep learning (DL), people have gradually begun to introduce deep learning to train a multilayer neural network to complete predetermined tasks [17]. In the field of natural language processing, such as English machine translation, question answering system, and reading comprehension, certain successes have been achieved [18]. The neural machine translation (NMT) system introduces deep learning technology; one of the mainstream technologies is to still retain the framework of statistical English machine translation, but to improve certain intermediate modules through deep learning technology, such as translation models, language models, and order adjustments [19]. Another type of method is to no longer use statistical English machine translation as the framework (no preprocessing such as word alignment is no longer needed, and no human design features are needed), but the end-to-end NMT system framework is proposed by related scholars [20].Generative adversarial network (GAN) is a generative model. The basic idea of GAN is inspired by game theory. First, they get a lot of training samples from the training library, then learn these training cases, and finally generate a probability distribution [21]. The two sides of the game in the GAN model are composed of generative model (GM) and discriminative model (DM). GM captures the distribution of sample data. It is a two-classifier used to estimate the probability that a sample comes from training data. GAN has the potential to generate “infinite” new samples in a distributed manner and has great application value in the fields of artificial intelligence, such as image, visual computing, and voice processing [22, 23]. GAN provides a new direction for unsupervised learning and provides methods and ideas for processing high-dimensional data and complex probability distributions.There are a few initial applications of GAN in the field of natural language processing, mainly because the initial design of GAN requires that both the generation modelG and the discriminant model D deal with continuous data. GAN can be changed by the minor parameters of the GM model. The difference between natural language processing and image processing is that the value of the image is continuous, and small changes can be reflected in the pixels, while in the text sequence, the GM generated data is discrete, and the information given by the corresponding DM is meaningless [24]. In other words, natural language processing is a discrete sequence, GM needs the gradient obtained from DM for training, and the BP algorithm of neural network cannot provide gradient value for GM.Related scholars provide a seed sentence segmentation method for the tree-based English machine translation system [25]. This method first divides the long sentence into shorter clauses, translates the clauses, and merges the subtranslations to generate the full sentence translation. This method analyzes the syntax tree generated by the existing syntax analyzer to realize the segmentation of long sentences and the merging of translations. However, the correctness of the syntax tree is difficult to guarantee. If there is an error in the syntax tree, analysis of the wrong tree will result in error accumulation.Researchers designed and implemented a long sentence processing subsystem [26]. Based on the study of the laws of linguistics, this paper proposes a seven-layer model diagram of the relationship between language units and translation units and proposes a long sentence analysis scheme based on this [27]. The plan first segmented and simplified the long sentence based on linguistic knowledge and used the existing system IMT/EC translation mechanism to translate the clauses one by one; finally, by analyzing the relationship between the clause translations, the subtranslations were merged to obtain the translation of the entire long sentence. The method of this article not only considers the structural characteristics of the long sentence but also considers the grammatical and semantic characteristics of the clauses in the long sentence. However, the segmentation of long sentences only uses limited features such as punctuation and keywords.Relevant scholars have proposed that pattern rules can be used to analyze parameterized text, and pattern rules and parameterized text free grammar are treated separately [28]. Some syntactic and semantic functions are used to parameterize the free grammar of the text. The pattern rules and the free grammar of the parameterized text are in a complementary relationship, so that the long English sentences represented by the patterns can be effectively analyzed. The problems of this method are mainly focused on sentence components such as prepositional phrases and compound noun phrases. Many segmentation points are wrong because it disconnects these phrases [29, 30].


## 3. Method

### 3.1. Position Coding

There is no recursive layer and convolutional layer in the transformer model. Therefore, in order to enable the model to use the position information in the input sequence, the sine and cosine position coding method and the SA mechanism in the Transformer are combined for application. This position coding method uses the sin function and the cos function performs position coding. Its advantage is that the sequence length of the model can be extended. It is essentially an absolute position information coding method. Moreover, the residual connections used around each sublayer also help to transfer location information to higher layers. The calculation method of sine and cosine position coding is as follows:(1)PEpos,2i=sinpos100002i/d⋅cospos1004i/d.(2)PEpos,2i|−1=sinpos2003i/d⋅cospos10003i/4d.Here, pos represents the input position andi represents the dimension; that is, each dimension of the position code has a corresponding sine and cosine function, where formula (1) represents the position code representation of even-numbered dimensions and formula (2) represents the position coded representation of the dimension.Although the position coded representation obtained in this way can reflect the relative distance between words, it lacks directionality, and this position information will be destroyed by the attention mechanism in transformer. Therefore, this paper proposes a new position representation method-logarithmic position representation and combines it with the SA mechanism, so that the model can not only effectively use the advantages of the SA mechanism parallel computing but also accurately capture the words between words.The RNN mechanism and SA mechanism are shown in Figure1. In RNN, although the word encoding of the two words is the same, the state of the hidden layer used to generate the two words is different. For the first word, the hidden state is the initialized state; for the second word, the hidden state is the hidden state that encodes two words. It can be seen that the hidden state mechanism in RNN ensures that the output representation of the same word in different positions is different.Figure 1
Comparison of RNN mechanism and SA mechanism: (a) RNN and (b) SA.
(a)(b)In self-attention, the output of the same word is exactly the same, because the input used to generate the output is exactly the same. This will cause the output representations of the same words at different positions in the same input sequence to be completely consistent, which will not reflect the timing relationship between the words. Therefore, relative position representation (RPR) was proposed. RPR adds a trainable embedding code to the self-attention model, so that the output representation can reflect the timing information of the input. These embedding vectors are used to calculate the attention weight and value between any two wordsxi and xj in the input sequence. Time was added to it. This embedding vector represents the distance between words xi and xj.


### 3.2. Self-Attention Mechanism

The SA mechanism has parallel computing capabilities and modeling flexibility. The multihead attention (MHA) mechanism in the SA mechanism can enable the model to pay attention to the corresponding information from different subspaces. The SA mechanism ignores the position factor of the word in the sentence, and it can explicitly capture the semantic relationship between the current word and all words in the sentence. The MHA mechanism maps the input sequence to different subspaces. These subspaces use the SA mechanism to further enhance the performance of the English machine translation model. The advantages of the SA mechanism are as follows:(1)
There are fewer parameters. Compared with the traditional LSTM model, the SA mechanism has less complexity and fewer parameters, so the requirements for computing power are also lower. (2) It has faster speed. The calculation result of each step of the SA mechanism does not depend on the calculation result of the previous step, which solves the problem that RNN cannot be trained in parallel. (3) It has better effect. The SA mechanism can capture the semantic relationship between global words and effectively solve the problem of weakened long-distance information in RNN.When using the SA mechanism to process each word (i.e., each element in the input sequence), such as when calculatingxi, the SA mechanism can associate it with all words in the sequence and calculate the semantic similarity between them. The advantage of this is that it can help to mine the semantic relationship between all words in the sequence, so as to encode the words more accurately.For the elementzi in the output sequence Z, the input elements xi and xj are linearly transformed and their weighted sum is calculated:(3)zi=∏j=0n−1softmaxKj,TVjQidk−1/2.In the Softmax function, the linear transformation of the input elements enhances the expression ability. The Softmax score determines the size of the attention score expressed by each word at the current position. Here, multiplying the value vectorVj by the Softmax score is to maintain the integrity of the value of the currently focused word and to overwhelm irrelevant words. Then, these weighted value vectors are summed to get the SA output, which will be sent to the feedforward neural network layer for further calculations. The calculation of the Softmax function is as follows:(4)softmaxaij=expaij⋅∏k=0n−1expaik−1.Q, K, and V represent query, key, and value, respectively, which are abstract representations useful for calculating attention scores, and dk is the dimension of key.The SA mechanism usesl attention heads, and the outputs of all attention heads are combined, and then linear transformation is performed to obtain the output of each sublayer. The multihead attention mechanism expands the model’s ability to focus on different positions. For example, if you want to translate “Tom did not come to work because he was ill,” you need to know what “he” refers to. The multihead attention mechanism is suitable for such situations. The multihead attention mechanism provides multiple representation subspaces for the attention layer. The multihead attention mechanism provides multiple sets of Query, Key, and Value. These sets are randomly initialized and generated. After training, each set will be used. The embedding for the input is then put into different representation subspaces. The calculation formula for the output result of the multihead attention mechanism is as follows:(5)multiheadZ=ConcatW0zhead1⋯zheadi.zheadi represents the output vector of the ith attention head. The function of Concat () is to merge the output vectors of all attention heads. WO is the weight matrix generated during model training. As shown in Figure 2, the multihead attention mechanism combines the output of each attention head and then performs a linear transformation to obtain the final output.Figure 2
Multihead attention mechanism.


### 3.3. Improved English Machine Translation Model Construction

In this paper, a new model of English machine translation based on logarithmic position representation and self-attention mechanism is proposed. As shown in Figure3, the model has 7 encoders and 7 decoders as well as an output layer. Attention combined with logarithmic position representation layer and fully connected FFN network layer. In the decoder, there are self-attention combined with logarithmic position representation layer, encoder-decoder attention layer, and fully connected FFN network layer. The output layer contains the linear transformation layer and the Softmax fully connected layer.Figure 3
English machine translation model based on logarithmic position representation and self-attention.Because there are no RNN and CNN in the SA mechanism, the sequence information in the text will be ignored. In order to make full use of the sequence information, a method is proposed in the article extracting the position information of the input elementxi ∈ X = (x1, …, xi); the position information proposed in this paper essentially represents the relative positional relationship between the input elements xi and xj. I construct these input elements as a directed complete graph with xi (i = 1, 2, ..., n) as nodes and eij as edges, and eij contains the relative positional relationship between xi and xj.In this paper, the vector LP is used to represent the logarithmic positional relationship between the input elementsxi and xj. The logarithmic position relationship is added to the model, and the following formula is obtained:(6)zi=∏j=0n−1softmaxLVjQi+Pij,vKj⋅dk−1/2VjQi+LPij,kKj−1.The injection of position information can greatly improve the situation where the encoder in the SA mechanism ignores the hierarchical structure of the input sequence. In specific tasks such as English machine translation, natural language inference, and intelligent question answering systems, location information plays an extremely important role.


## 3.1. Position Coding

There is no recursive layer and convolutional layer in the transformer model. Therefore, in order to enable the model to use the position information in the input sequence, the sine and cosine position coding method and the SA mechanism in the Transformer are combined for application. This position coding method uses the sin function and the cos function performs position coding. Its advantage is that the sequence length of the model can be extended. It is essentially an absolute position information coding method. Moreover, the residual connections used around each sublayer also help to transfer location information to higher layers. The calculation method of sine and cosine position coding is as follows:(1)PEpos,2i=sinpos100002i/d⋅cospos1004i/d.(2)PEpos,2i|−1=sinpos2003i/d⋅cospos10003i/4d.Here, pos represents the input position andi represents the dimension; that is, each dimension of the position code has a corresponding sine and cosine function, where formula (1) represents the position code representation of even-numbered dimensions and formula (2) represents the position coded representation of the dimension.Although the position coded representation obtained in this way can reflect the relative distance between words, it lacks directionality, and this position information will be destroyed by the attention mechanism in transformer. Therefore, this paper proposes a new position representation method-logarithmic position representation and combines it with the SA mechanism, so that the model can not only effectively use the advantages of the SA mechanism parallel computing but also accurately capture the words between words.The RNN mechanism and SA mechanism are shown in Figure1. In RNN, although the word encoding of the two words is the same, the state of the hidden layer used to generate the two words is different. For the first word, the hidden state is the initialized state; for the second word, the hidden state is the hidden state that encodes two words. It can be seen that the hidden state mechanism in RNN ensures that the output representation of the same word in different positions is different.Figure 1
Comparison of RNN mechanism and SA mechanism: (a) RNN and (b) SA.
(a)(b)In self-attention, the output of the same word is exactly the same, because the input used to generate the output is exactly the same. This will cause the output representations of the same words at different positions in the same input sequence to be completely consistent, which will not reflect the timing relationship between the words. Therefore, relative position representation (RPR) was proposed. RPR adds a trainable embedding code to the self-attention model, so that the output representation can reflect the timing information of the input. These embedding vectors are used to calculate the attention weight and value between any two wordsxi and xj in the input sequence. Time was added to it. This embedding vector represents the distance between words xi and xj.


## 3.2. Self-Attention Mechanism

The SA mechanism has parallel computing capabilities and modeling flexibility. The multihead attention (MHA) mechanism in the SA mechanism can enable the model to pay attention to the corresponding information from different subspaces. The SA mechanism ignores the position factor of the word in the sentence, and it can explicitly capture the semantic relationship between the current word and all words in the sentence. The MHA mechanism maps the input sequence to different subspaces. These subspaces use the SA mechanism to further enhance the performance of the English machine translation model. The advantages of the SA mechanism are as follows:(1)
There are fewer parameters. Compared with the traditional LSTM model, the SA mechanism has less complexity and fewer parameters, so the requirements for computing power are also lower. (2) It has faster speed. The calculation result of each step of the SA mechanism does not depend on the calculation result of the previous step, which solves the problem that RNN cannot be trained in parallel. (3) It has better effect. The SA mechanism can capture the semantic relationship between global words and effectively solve the problem of weakened long-distance information in RNN.When using the SA mechanism to process each word (i.e., each element in the input sequence), such as when calculatingxi, the SA mechanism can associate it with all words in the sequence and calculate the semantic similarity between them. The advantage of this is that it can help to mine the semantic relationship between all words in the sequence, so as to encode the words more accurately.For the elementzi in the output sequence Z, the input elements xi and xj are linearly transformed and their weighted sum is calculated:(3)zi=∏j=0n−1softmaxKj,TVjQidk−1/2.In the Softmax function, the linear transformation of the input elements enhances the expression ability. The Softmax score determines the size of the attention score expressed by each word at the current position. Here, multiplying the value vectorVj by the Softmax score is to maintain the integrity of the value of the currently focused word and to overwhelm irrelevant words. Then, these weighted value vectors are summed to get the SA output, which will be sent to the feedforward neural network layer for further calculations. The calculation of the Softmax function is as follows:(4)softmaxaij=expaij⋅∏k=0n−1expaik−1.Q, K, and V represent query, key, and value, respectively, which are abstract representations useful for calculating attention scores, and dk is the dimension of key.The SA mechanism usesl attention heads, and the outputs of all attention heads are combined, and then linear transformation is performed to obtain the output of each sublayer. The multihead attention mechanism expands the model’s ability to focus on different positions. For example, if you want to translate “Tom did not come to work because he was ill,” you need to know what “he” refers to. The multihead attention mechanism is suitable for such situations. The multihead attention mechanism provides multiple representation subspaces for the attention layer. The multihead attention mechanism provides multiple sets of Query, Key, and Value. These sets are randomly initialized and generated. After training, each set will be used. The embedding for the input is then put into different representation subspaces. The calculation formula for the output result of the multihead attention mechanism is as follows:(5)multiheadZ=ConcatW0zhead1⋯zheadi.zheadi represents the output vector of the ith attention head. The function of Concat () is to merge the output vectors of all attention heads. WO is the weight matrix generated during model training. As shown in Figure 2, the multihead attention mechanism combines the output of each attention head and then performs a linear transformation to obtain the final output.Figure 2
Multihead attention mechanism.


## 3.3. Improved English Machine Translation Model Construction

In this paper, a new model of English machine translation based on logarithmic position representation and self-attention mechanism is proposed. As shown in Figure3, the model has 7 encoders and 7 decoders as well as an output layer. Attention combined with logarithmic position representation layer and fully connected FFN network layer. In the decoder, there are self-attention combined with logarithmic position representation layer, encoder-decoder attention layer, and fully connected FFN network layer. The output layer contains the linear transformation layer and the Softmax fully connected layer.Figure 3
English machine translation model based on logarithmic position representation and self-attention.Because there are no RNN and CNN in the SA mechanism, the sequence information in the text will be ignored. In order to make full use of the sequence information, a method is proposed in the article extracting the position information of the input elementxi ∈ X = (x1, …, xi); the position information proposed in this paper essentially represents the relative positional relationship between the input elements xi and xj. I construct these input elements as a directed complete graph with xi (i = 1, 2, ..., n) as nodes and eij as edges, and eij contains the relative positional relationship between xi and xj.In this paper, the vector LP is used to represent the logarithmic positional relationship between the input elementsxi and xj. The logarithmic position relationship is added to the model, and the following formula is obtained:(6)zi=∏j=0n−1softmaxLVjQi+Pij,vKj⋅dk−1/2VjQi+LPij,kKj−1.The injection of position information can greatly improve the situation where the encoder in the SA mechanism ignores the hierarchical structure of the input sequence. In specific tasks such as English machine translation, natural language inference, and intelligent question answering systems, location information plays an extremely important role.


## 4. Results and Discussion

### 4.1. Translation Effect on Single Word Alignment

I compared the final translation quality between nonstrict phrase extraction and strict phrase extraction when no extraction constraints were added. Table1 shows the BLEU scores when using various word alignment and recombination methods for strict phrase extraction.Table 1
BLEU scores for strict phrase extraction in a single alignment.
Alignment and reorganization methodBLEU scoreUnion0.39Intersect0.3Grow0.29Grow-diag0.35Grow-diag-final0.42It can be seen from Table1 that different alignment and recombination methods have a greater impact on the BLEU score of the final translation result. The grow-diag-final method has the highest BLEU score; the grow method has the lowest BLEU score. At the same time, it can be seen from the table that the method of adding the alignment points to the diagonal during the alignment and reorganization process (grow-diag, grow-diag-final, grow-diag-final-and, and union) is obviously better. The method of aligning points to the diagonal (grow, intersect), which shows that the aligning points on the diagonal are useful for phrase extraction. Corresponding to the word alignment of bilingual sentences, it is that most of the word sequences in the sentence tend to be strictly monotonous if the previous word in the source language sentence word sequence corresponds to the previous word in the target language sentence word sequence; then, the next word in the word sequence also tends to correspond to the next word in the word sequence of the target language sentence. In our experiment, the result of the grow method is not as good as the intersect method, which shows that adding horizontal or vertical alignment points in the alignment, and reorganization process is generally useless. Table 2 shows the BLEU scores of nonstrict phrase extraction using various word alignment and recombination methods.Table 2
BLEU scores for nonstrict phrase extraction in a single alignment.
Alignment and reorganization methodBLEU scoreUnion0.43Intersect0.31Grow0.32Grow-diag0.36Grow-diag-final0.43It can be seen from Table2 that the BLEU score of nonstrict phrase extraction is generally better than that of strict phrase extraction (obviously, the intersect results of the two are the same). In nonstrict phrase extraction, the impact of different alignment and recombination methods on the final translation result BLEU score is also different from that in strict phrase extraction: the BLEU score of the union method exceeds that of the grow-diag-final method. Looking at the BLEU score from highest to bottom (union > grow-diag-final > grow-diag-final-and > grow-diag > grow > intersect), the alignment result contains the BLEU score of the alignment reorganization method with more alignment points, which is different from the situation in strict phrase extraction. This shows that in nonstrict phrase extraction, the coverage rate of alignment points has a greater impact on the final result than the accuracy rate. Because the nonstrict phrase extraction itself has a certain antinoise ability, it reduces the requirements for word alignment accuracy and does not require a very complicated alignment and recombination method.On the whole, the extraction constraint strategy can effectively improve the BLEU score. The method based on vocabulary similarity is better than the method based on the intersection of alignment points. The improved self-attention constraint is based on the maximum likelihood under the condition of the alignment point. The comparison method has the highest BLEU score under the union word alignment and reorganization. Among all the methods based on vocabulary similarity, the method based on improved self-attention is less effective. Even under the condition of union and grow-diag-final word alignment and recombination, the BLEU score is worse than the method based on the intersection of alignment points. There is not much improvement effect; the method based on PHI square coefficient has better BLEU scores under various word alignment and recombination conditions; the method based on log-likelihood ratio is BLEU under the conditions of union, grow, and grow-diag word alignment and recombination. The score is better, but the BLEU score under the conditions of grow-diag-final and grow-diag-final-and word alignment and recombination has a large drop, which shows that the log-likelihood ratio constraint is too strict. In these two types of methods, final and final-and processes may include alignment points that are not deterministic alignments, but the log-likelihood ratio constraint regards these alignment points as must be included in phrase extraction. However, the log-likelihood ratio has a better ability to constrain too broad results like union word alignment and recombination.In Figure4, the influence of threshold changes in the constraint extraction strategy based on improved self-attention on the BLEU score of the final translation is shown. From this, we can see that the threshold change has a greater impact on the BLEU score of the final translation result, indicating that the improved self-attention constraint has a greater impact on phrase extraction, which means that this method can form an effective constraint.Figure 4
The relationship between BLEU and threshold under the constraints of improved self-attention method for single alignment: (a) constraints are not based on alignment points, (b) constraints are based on alignment points, and (c) improved self-attention constraints are based on alignment points.
(a)(b)(c)


### 4.2. Translation Effect onn-Best Word Alignment

We take the best alignment numbers as 10, 20, 30, 40, and 50, respectively, for the translation experiment onn-best alignment. We still compare the final translation quality of nonstrict phrase extraction and strict phrase extraction without adding extraction constraints. The BLEU scores of strict phrase extraction using various word alignment and recombination methods are shown in Table 3. Here, the best result on n-best is selected for each word alignment.Table 3
BLEU scores for strict phrase extraction inn-best alignment.
Alignment and reorganization methodBLEUGrow-diag-final-and0.39Grow-diag-final0.41Grow-diag0.37Grow0.33Intersect0.31Union0.25In the alignment and reorganization method, the result ofn-best is not as good as the result of single alignment. This is mainly because these alignment and reorganization methods cover more alignment points on the n-best alignment, and strict phrase extraction can only perform phrase extraction based on the outermost boundary of the alignment, so it is more severely affected by noise. There are certain improvements in other alignment and reorganization methods, mainly because these methods cover fewer alignment points on a single alignment, and many useful alignment points are recalled after being expanded to n-best. However, from a general point of view, the highest BLEU score of strict phrase extraction on the n-best alignment results is still lower than that of a single alignment, indicating that strict phrase extraction is not suitable for the n-best alignment and reorganization used in this article.Figure5 shows the variation of strict phrase extraction with n-best alignment. It can be seen that for all alignment and recombination methods, the BLEU score fluctuates with the increase of n-best alignment, which shows that the strict phrase extraction method can improve the effectiveness of extraction as the alignment number increases.Figure 5
The BLEU score of the simple superposition ofn-best alignment results in strict phrase extraction.Table4 shows the BLEU scores of various word alignment and recombination methods used in nonstrict phrase extraction without extraction constraints. It can be seen that in all word alignment and recombination methods, nonstrict phrase extraction improves the BLEU score on n-best than on single alignment. This shows that the n-best alignment recombination method mentioned in this article is suitable for nonstrict phrase extraction.Table 4
BLEU scores for nonstrict phrase extraction inn-best alignment.
Alignment and reorganization methodBLEUGrow-diag-final-and0.40Grow-diag-final0.42Grow-diag0.36Grow0.34Intersect0.32Union0.26Figure6 further shows the variation of nonstrict phrase extraction with n-best alignment. It can be seen that for most alignment and recombination methods, the BLEU score does not change much with the number of n-best alignments. Therefore, simply using the nonstrict phrase extraction method cannot improve the effectiveness of the extraction with the increase of the number of alignments, but it will not significantly reduce the effectiveness. It is also worth noting that in terms of n-best alignment, the grow-diag-final method is better than the union method. This may be due to the introduction of too many alignment points in the union method, which reduces the effectiveness of phrase extraction.Figure 6
BLEU score of simple superposition ofn-best alignment results in nonstrict phrase extraction.Figure7 shows the relationship between the BLEU score and the n-best alignment under the constraints of the improved self-attention alignment point intersection method. When the number of n-best alignments increases, the BLEU score is not less than 0.445, which shows that the method based on the intersection of alignment points is effective in n-best alignment.Figure 7
The relationship between BLEU andn-best alignment under the constraint of the improved self-attention alignment point intersection method.Figure8 shows the relationship between the BLEU score and the threshold under the improved self-attention constraint in n-best alignment. It can be seen from the figure that for improved self-attention, there is still a difference whether the alignment point has been aligned under n-best alignment. When the threshold is increased, the improved self-attention constraint is relatively maximum based on the BLEU score of the alignment point.Figure 8
The constraint ofn-best alignment in the improved self-attention is based on the BLEU score under the alignment point. (a) Constraints are not based on alignment points, (b) constraints are based on alignment points, and (c) improved self-attention constraints are based on alignment points.
(a)(b)(c)The effect is best when the constraint is based on the existing alignment, the effect is worse when the constraint is strictly based on the existing alignment, and the effect is the worst when the constraint is not based on the existing alignment. Because the log-likelihood method has strong constraints, when there are many alignment points, the constraints strictly based on the existing alignment are too strict, so it becomes worse. The constraints are not strictly based on the existing alignment. The constraints are looser, and the effect is better. When the alignment is not based on the existing alignment, the alignment points other than the existing alignment can be used as constraints, which is equivalent to strengthening the constraints, and the effect is not good. As the threshold increases, the constraint relaxes, and the BLEU score increases strictly according to the existing alignment method, indicating that this restriction is too strict forn-best alignment; the BLEU score that does not strictly follow the existing alignment method increases first, indicating that the degree of restriction is moderate, and only when the threshold is relatively large will it show a downward trend; the BLEU score basically declines without the existing alignment method, and its effect is not as good as the previous two.


## 4.1. Translation Effect on Single Word Alignment

I compared the final translation quality between nonstrict phrase extraction and strict phrase extraction when no extraction constraints were added. Table1 shows the BLEU scores when using various word alignment and recombination methods for strict phrase extraction.Table 1
BLEU scores for strict phrase extraction in a single alignment.
Alignment and reorganization methodBLEU scoreUnion0.39Intersect0.3Grow0.29Grow-diag0.35Grow-diag-final0.42It can be seen from Table1 that different alignment and recombination methods have a greater impact on the BLEU score of the final translation result. The grow-diag-final method has the highest BLEU score; the grow method has the lowest BLEU score. At the same time, it can be seen from the table that the method of adding the alignment points to the diagonal during the alignment and reorganization process (grow-diag, grow-diag-final, grow-diag-final-and, and union) is obviously better. The method of aligning points to the diagonal (grow, intersect), which shows that the aligning points on the diagonal are useful for phrase extraction. Corresponding to the word alignment of bilingual sentences, it is that most of the word sequences in the sentence tend to be strictly monotonous if the previous word in the source language sentence word sequence corresponds to the previous word in the target language sentence word sequence; then, the next word in the word sequence also tends to correspond to the next word in the word sequence of the target language sentence. In our experiment, the result of the grow method is not as good as the intersect method, which shows that adding horizontal or vertical alignment points in the alignment, and reorganization process is generally useless. Table 2 shows the BLEU scores of nonstrict phrase extraction using various word alignment and recombination methods.Table 2
BLEU scores for nonstrict phrase extraction in a single alignment.
Alignment and reorganization methodBLEU scoreUnion0.43Intersect0.31Grow0.32Grow-diag0.36Grow-diag-final0.43It can be seen from Table2 that the BLEU score of nonstrict phrase extraction is generally better than that of strict phrase extraction (obviously, the intersect results of the two are the same). In nonstrict phrase extraction, the impact of different alignment and recombination methods on the final translation result BLEU score is also different from that in strict phrase extraction: the BLEU score of the union method exceeds that of the grow-diag-final method. Looking at the BLEU score from highest to bottom (union > grow-diag-final > grow-diag-final-and > grow-diag > grow > intersect), the alignment result contains the BLEU score of the alignment reorganization method with more alignment points, which is different from the situation in strict phrase extraction. This shows that in nonstrict phrase extraction, the coverage rate of alignment points has a greater impact on the final result than the accuracy rate. Because the nonstrict phrase extraction itself has a certain antinoise ability, it reduces the requirements for word alignment accuracy and does not require a very complicated alignment and recombination method.On the whole, the extraction constraint strategy can effectively improve the BLEU score. The method based on vocabulary similarity is better than the method based on the intersection of alignment points. The improved self-attention constraint is based on the maximum likelihood under the condition of the alignment point. The comparison method has the highest BLEU score under the union word alignment and reorganization. Among all the methods based on vocabulary similarity, the method based on improved self-attention is less effective. Even under the condition of union and grow-diag-final word alignment and recombination, the BLEU score is worse than the method based on the intersection of alignment points. There is not much improvement effect; the method based on PHI square coefficient has better BLEU scores under various word alignment and recombination conditions; the method based on log-likelihood ratio is BLEU under the conditions of union, grow, and grow-diag word alignment and recombination. The score is better, but the BLEU score under the conditions of grow-diag-final and grow-diag-final-and word alignment and recombination has a large drop, which shows that the log-likelihood ratio constraint is too strict. In these two types of methods, final and final-and processes may include alignment points that are not deterministic alignments, but the log-likelihood ratio constraint regards these alignment points as must be included in phrase extraction. However, the log-likelihood ratio has a better ability to constrain too broad results like union word alignment and recombination.In Figure4, the influence of threshold changes in the constraint extraction strategy based on improved self-attention on the BLEU score of the final translation is shown. From this, we can see that the threshold change has a greater impact on the BLEU score of the final translation result, indicating that the improved self-attention constraint has a greater impact on phrase extraction, which means that this method can form an effective constraint.Figure 4
The relationship between BLEU and threshold under the constraints of improved self-attention method for single alignment: (a) constraints are not based on alignment points, (b) constraints are based on alignment points, and (c) improved self-attention constraints are based on alignment points.
(a)(b)(c)


## 4.2. Translation Effect onn-Best Word Alignment

We take the best alignment numbers as 10, 20, 30, 40, and 50, respectively, for the translation experiment onn-best alignment. We still compare the final translation quality of nonstrict phrase extraction and strict phrase extraction without adding extraction constraints. The BLEU scores of strict phrase extraction using various word alignment and recombination methods are shown in Table 3. Here, the best result on n-best is selected for each word alignment.Table 3
BLEU scores for strict phrase extraction inn-best alignment.
Alignment and reorganization methodBLEUGrow-diag-final-and0.39Grow-diag-final0.41Grow-diag0.37Grow0.33Intersect0.31Union0.25In the alignment and reorganization method, the result ofn-best is not as good as the result of single alignment. This is mainly because these alignment and reorganization methods cover more alignment points on the n-best alignment, and strict phrase extraction can only perform phrase extraction based on the outermost boundary of the alignment, so it is more severely affected by noise. There are certain improvements in other alignment and reorganization methods, mainly because these methods cover fewer alignment points on a single alignment, and many useful alignment points are recalled after being expanded to n-best. However, from a general point of view, the highest BLEU score of strict phrase extraction on the n-best alignment results is still lower than that of a single alignment, indicating that strict phrase extraction is not suitable for the n-best alignment and reorganization used in this article.Figure5 shows the variation of strict phrase extraction with n-best alignment. It can be seen that for all alignment and recombination methods, the BLEU score fluctuates with the increase of n-best alignment, which shows that the strict phrase extraction method can improve the effectiveness of extraction as the alignment number increases.Figure 5
The BLEU score of the simple superposition ofn-best alignment results in strict phrase extraction.Table4 shows the BLEU scores of various word alignment and recombination methods used in nonstrict phrase extraction without extraction constraints. It can be seen that in all word alignment and recombination methods, nonstrict phrase extraction improves the BLEU score on n-best than on single alignment. This shows that the n-best alignment recombination method mentioned in this article is suitable for nonstrict phrase extraction.Table 4
BLEU scores for nonstrict phrase extraction inn-best alignment.
Alignment and reorganization methodBLEUGrow-diag-final-and0.40Grow-diag-final0.42Grow-diag0.36Grow0.34Intersect0.32Union0.26Figure6 further shows the variation of nonstrict phrase extraction with n-best alignment. It can be seen that for most alignment and recombination methods, the BLEU score does not change much with the number of n-best alignments. Therefore, simply using the nonstrict phrase extraction method cannot improve the effectiveness of the extraction with the increase of the number of alignments, but it will not significantly reduce the effectiveness. It is also worth noting that in terms of n-best alignment, the grow-diag-final method is better than the union method. This may be due to the introduction of too many alignment points in the union method, which reduces the effectiveness of phrase extraction.Figure 6
BLEU score of simple superposition ofn-best alignment results in nonstrict phrase extraction.Figure7 shows the relationship between the BLEU score and the n-best alignment under the constraints of the improved self-attention alignment point intersection method. When the number of n-best alignments increases, the BLEU score is not less than 0.445, which shows that the method based on the intersection of alignment points is effective in n-best alignment.Figure 7
The relationship between BLEU andn-best alignment under the constraint of the improved self-attention alignment point intersection method.Figure8 shows the relationship between the BLEU score and the threshold under the improved self-attention constraint in n-best alignment. It can be seen from the figure that for improved self-attention, there is still a difference whether the alignment point has been aligned under n-best alignment. When the threshold is increased, the improved self-attention constraint is relatively maximum based on the BLEU score of the alignment point.Figure 8
The constraint ofn-best alignment in the improved self-attention is based on the BLEU score under the alignment point. (a) Constraints are not based on alignment points, (b) constraints are based on alignment points, and (c) improved self-attention constraints are based on alignment points.
(a)(b)(c)The effect is best when the constraint is based on the existing alignment, the effect is worse when the constraint is strictly based on the existing alignment, and the effect is the worst when the constraint is not based on the existing alignment. Because the log-likelihood method has strong constraints, when there are many alignment points, the constraints strictly based on the existing alignment are too strict, so it becomes worse. The constraints are not strictly based on the existing alignment. The constraints are looser, and the effect is better. When the alignment is not based on the existing alignment, the alignment points other than the existing alignment can be used as constraints, which is equivalent to strengthening the constraints, and the effect is not good. As the threshold increases, the constraint relaxes, and the BLEU score increases strictly according to the existing alignment method, indicating that this restriction is too strict forn-best alignment; the BLEU score that does not strictly follow the existing alignment method increases first, indicating that the degree of restriction is moderate, and only when the threshold is relatively large will it show a downward trend; the BLEU score basically declines without the existing alignment method, and its effect is not as good as the previous two.


## 5. Conclusion

This article analyzes the self-attention mechanism ignoring word order structure. Aiming at the problem of not being able to capture the position information of the words in the sentence, the analysis shows that the position of the words in the sentence is very important feature information. It plays an important role in guiding reference disambiguation and semantic analysis. For this problem, this paper proposes a new English machine translation model based on logarithmic position representation and self-attention. This model further enhances the model’s ability to capture word position information by adding logarithmic position representation in the self-attention layer. This performance enhancement is not only reflected in distance but also in directionality. The logarithmic representation method blurs the concept of “long distance” and makes the relative position representation free from the “window.” The experimental results show that the model proposed in the article has better performance than the traditional recurrent neural network English machine translation model and the traditional self-attention English machine translation model in English-to-German and English-to-French English machine translation tasks. This article proposes the idea of using n-best alignment results for phrase extraction. In order to effectively extract phrases from n-best alignment results, a nonstrict phrase extraction method is proposed, focusing on the impact of various extraction constraint strategies in nonstrict phrase extraction methods on the quality of the final translation, mainly including alignment points. Compared with the traditional strict phrase extraction method, the final translation quality of nonstrict phrase extraction in both single alignment andn-best alignment is improved, and it is more suitable for extracting phrases from n-best alignment effectively. However, the error recognition rule base needs to be improved. The error-driven long sentence segmentation method formulates error identification and correction strategies by summarizing the errors in the segmentation results. Fundamentally speaking, these strategies belong to the category of rules. In the future, we will consider formulating a more standardized and complete knowledge representation form to accurately represent each linguistic feature, so as to promote the application of the method.



---

*Source: 2601480-2021-12-23.xml*