Automating Text Naturalness Evaluation of NLG Systems

06/23/2020 ∙ by Erion Çano, et al. ∙ Charles University in Prague 0

Automatic methods and metrics that assess various quality criteria of automatically generated texts are important for developing NLG systems because they produce repeatable results and allow for a fast development cycle. We present here an attempt to automate the evaluation of text naturalness which is a very important characteristic of natural language generation methods. Instead of relying on human participants for scoring or labeling the text samples, we propose to automate the process by using a human likeliness metric we define and a discrimination procedure based on large pretrained language models with their probability distributions. We analyze the text probability fractions and observe how they are influenced by the size of the generative and discriminative models involved in the process. Based on our results, bigger generators and larger pretrained discriminators are more appropriate for a better evaluation of text naturalness. A comprehensive validation procedure with human participants is required as follow up to check how well this automatic evaluation scheme correlates with human judgments.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

NLG (Natural Language Generation) is a research direction that develops techniques and practices for automatically transforming structured data into natural language phrases that are readable for humans. Some of the most common applications of NLG are financial reporting, weather predictions, customer support, etc. Same to other related disciplines such as MT (Machine Translation) or ATS (Abstractive Text Summarization), NLG has surged in the last decade, greatly pushed by the significant advances in language applications of deep neural networks

[45]. In parallel with the data processing, researchers are also exploring possibilities to automate the evaluation of the intelligent text-related systems they propose [14, 11, 48]. An evaluation practice that is becoming popular recently compares method output samples against human-written references of a standard corpus using automatic metrics. Some of the most popular metrics used for MT and ATS include BLEU of Papineni et al. [32], ROUGE of Lin [25] and METEOR of Banerjee and Lavie [5]

. This automatic evaluation practice is appealing for researchers in NLG and NLP (Natural Language Processing) because it is fast and inexpensive to run, does not require domain expertise, and usually yields repeatable and explainable results.

However, when comparing two methods A and B, we usually want to observe more quality aspects of their produced texts and not just accuracy. These other aspects include, e.g., readability, coherence, naturalness, fluency, adequacy or grammaticality. BLEU and the automatic evaluation process have been criticized by several authors [7, 39]. As pointed out by Reiter [36], BLEU is not appropriate for evaluating many quality criteria relevant for NLG systems. Moreover, the results of the automatic evaluation process do not always correlate well with those of human surveys [37]. We would not get any extra information about the text quality aspects of A and B outputs even by adding data efficiency scores in the process [8]. As Novikova et al. [31] suggests, there is a need for novel evaluation metrics that can objectively assess specific text quality characteristics such as human likeliness (naturalness), readability, coherence, etc.

In this paper, we present the proof of concept for a method that can potentially be used to automatically evaluate the human likeliness of NLG outputs. This method conceives the text naturalness evaluation from an adversarial perspective, using a discriminator model that can label each test set output as being human-written (natural) or machine-generated (synthetic). This discriminator will use existing pretrained language models such as BERT or GPT2 and presume that synthetic texts do contain relatively more high-rank words sampled from probability distributions learned by the generator, in contrast to natural texts that usually contain more low-rank words. This way, it will compute the fraction of probabilities (the ratio between the probability of the actual word in a position and the highest rank word for that position) for each word and the average value for the entire text. The latter will be discretized to get the class (h or m) of that text sample.

We start with a review of recent language model applications and observe trends in the ways they are being evaluated. There is actually an increasing trend of automatic evaluations against human-based ones. Later on, in Section 3.1, we propose the h

score to estimate text naturalness. In Sections 

3.2 and 3.3, the discrimination model is described, together with possible shortcomings and a few alternative approaches. Section 4 shows the results of some ATS experiments we conducted, observing the effect of the generator and discriminator sizes on the probability fractions. Finally, we conclude with the follow-up work of the near future.

2 Language Generation Application and Evaluation

2.1 Recent Applications of Language Models

The NLG progress of the last years has been mostly driven by recent advancements in sequence-2-sequence models based on the encoder-decoder framework. The top sequence matching neural networks have been primarily designed for MT and successfully applied for similar tasks like ATS or NLG [4, 41]. Actually, the numerous NLG applications depend on the ability of each model to learn an appropriate language distribution and use it to decode a word (e.g., the highest probability one) at a time for each position generating phrases, sentences, paragraphs or even longer texts.

The Transformer architecture introduced by Vaswani et al. [43] was a pivotal leap since it improved both performance and training time. It has been widely implemented in several variants, with OpenNMT being the most popular [22]. Moreover, Transformer blocks are also used to build big pretrained models such as ELMo (Embeddings from Language Models) of Peters et al. [34], BERT (Bidirectional Encoder Representations from Transformers) of Devlin et al. [16] or GPT2 (Generative Pretrained Transformer 2) of Radford et al. [35]. These language models are trained on huge amounts of texts and can be tuned with texts of specific tasks, providing state-of-the-art results in MT, ATS, text classification and more.

Because of this research trend, numerous specific BERT variants have been trained and released continuously. Models such as BioBERT (trained with biomedical texts) of Lee et al. [24], SciBERT (trained with scientific texts) of Beltagy et al. [6], VideoBERT (trained with video frames and their text descriptions) of Sun et al. [40] and similar ones are excelling on their respective tasks. There are also recent studies that have successfully used the original BERT to generate fluent sentences [44].

Since the quality of machine-generated texts has been improved dramatically, it is possible today to use big language models for abusive activities such as spreading fake or misleading news, comments or reviews in the social networks or in the Web [17, 46]. This has created strong incentives for research and development of machine-generated text detection systems [38, 33], especially using the adversarial approach with a discriminator that makes use of a language model generator [18, 46]. Other types of learning models are those trained to discriminate between two or more types of language or detect certain aspects in it. Hate (toxic) speech detection models are similar to synthetic text detectors [47, 28]

. Furthermore, sentiment analysis is an entire research direction that builds models trained with lexical features to sort out positive sentiments from negative ones

[12, 27, 13]. It is interesting to see that the neural networks used to solve these tasks are recently build using language models like BERT [29].

2.2 Text Detection Systems

Several text detection systems proposed recently are being based on pretrained language models. One of them is Grover of Zellers et al. [46] which is a left-to-right language model used for fake news generation and detection. It is based on large Transformers and comes with different model sizes, same as GPT2. The model is trained on RealNews, a large news collection they derived from Common Crawl111

dumps. Authors argue that limiting the generation variance in each decoding step significantly improves the credibility of the synthetic news. They also build a version of their model used as a discriminator and report experiments of paired generator-discriminator models. According to their results, Grover itself is the best detector of its fake news. They also conclude that the size of the discriminator is highly important to get high detection scores.

QE (Quality Estimation) BERT of Kim et al. [21] is another case of using a language model like BERT for evaluating natural language generation (more specifically translation). This model is pretrained with parallel data and fine-tuned from QE data. It is then used to assess the translation quality of other models (using HTER score) in the context of WMT19 QE Shared Task.222 Authors report that QE BERT yields significant improvements on both word-level and sentence-level QE tasks.

Another example is GLTR (Giant Language model Test Room) of Gehrmann et al. [18] which can use any language model such as BERT, small GPT2 (117 M parameters) or large GPT2 (1.5 B parameters) as backend for detecting synthetic texts of various sizes. Based on their observations, the authors assume that synthetic (machine-generated) texts are mostly created by sampling high-rank words from the head of a language distribution model . To assess if a given word is probably sampled from a language distribution, they propose three tests: (i) checking the probability of the given word in relation to the one that was assigned the highest probability ; (ii) checking the relative rank of the given word; (iii) checking the entropy of the predicted distribution. Higher values of these scores indicate more chances that the given word and the entire text is synthetic. They also construct a visual tool that highlights text passages and can be used online.333

2.3 Text Quality Evaluation

Automatically generated texts should be carefully evaluated from several points of view. Various quality criteria are used on MT and other NLG tasks [15]. Accuracy is relatively easy to compute in some of the applications where reference texts are available. It usually assesses the lexical similarity between produced text samples and the reference ones utilizing standard metrics such as BLEU or ROUGE. Grammaticality measures the capability of a model to produce grammatically correct texts, with as few mistakes as possible. It is mostly assessed by counting the different types of errors that are found.

Adequacy, on the other hand, rates the amount of meaning that is expressed in a reference sample which is also induced in the respective generated sample. Surveys with human participants and categorical scales are mostly utilized in the process. Clarity and fluency are somehow similar to each other, reflecting how easily is to understand a generated text fragment. They are typically assessed by humans using categorical scales or ranking several alternatives (e.g., produced by alternative models). Finally, human likeliness or naturalness shows the likelihood of a text being natural or written by a human being rather than automatically generated. Besides accuracy, the rest of the above quality criteria are assessed manually by human experts or survey participants.

To have a quantitative view of the text quality evaluation trends, especially in the context of NLG research, in [10] we examined the papers published in the last five INLG conference proceedings. From that survey we noticed an considerable increase in the number of studies (especially those of the last year) using automatic evaluation only. There was also a steady increase in studies using both human and automatic evaluation. Similar facts have been reported by other recent surveys such as the one of Gkatzia and Mahamood [19]. There was an opposite trend about the works that carry human evaluation only. They have been decreasing steadily, same as reported in [3] and [9]. We also noticed that most human evaluations involve a few domain experts or tens of university students. Furthermore, there is a considerable number of studies that report to have used evaluators crowdsourced from Amazon Mechanical Turk444 or similar platforms. The most frequent text quality criteria they consider are accuracy, readability, coherence, and human likeliness.

3 Automating the Human Likeliness Evaluation

3.1 Formalizing the Text Naturalness Score

From the observations reported in the previous section, it is clear that automating the evaluation of certain text quality criteria such as coherence, fluency or human likeliness is highly desirable. Some attempts have developed objective measures of text properties like average word length, mean parse tree height, and the average number of nouns [2, 42]. These measures are combined in formulas to obtain a score for automatically assessing text readability quality criterion. In this work, we present a similar attempt regarding the human likeliness or naturalness of machine-generated texts. The h score we propose reveals the ability of an NLG model to produce text samples that are human-like or written by humans. This property is substantial and highly desired in NLG applications as well as in various surging computerized tasks such as MT, ATS, question answering and more.

The traditional approach assesses text naturalness employing human campaigns or surveys that ask participants to rate the texts using point-based schemes. Likert 5-points scale of is one of the most popular methods in the literature [20, 23]. Our goal is to automate the human likeliness evaluation of any generative model G by considering the task as a binary discrimination problem and computing a metric that we can call the h score. Same as the authors of Grover, we considered an adversarial scenario with a generator that produces text samples and a discriminator that tries to find out if they are natural or synthetic using a language model. Let’s assume we are using a test set of reference samples for the evaluation. We can expect to have , where is the number of texts that are perceived as human-written and is the number of those which are perceived as machine-generated. Same as in [10], we consider the h score and m score of G as the fraction or percentage of its outputs being perceived as human-written or machine-generated. Both metrics can be computed using Equation 1.


Instead of relying on human participants for labeling the texts (marking them as class h or class m) or scoring them (e.g., 1 to 5 as in Likert scale), we suggest automating the task by using a smart discriminator model D. Synthetic texts of today (e.g., the outputs of huge pretrained language models) are very close to those of human professionals. The success of this approach will thus depend on the ability to create a smart discriminator that can recognize such synthetic texts. Using the predictions of D and Equation 1, we calculate the h scores of the methods we wish to evaluate and use it as a model quality indicator. We would normally favor the method which is more capable in fooling the discriminator to think that its text outputs are human-written (resulting in a higher h score).

3.2 A Binary Discrimination Scheme

Our main idea is to adopt the approach of GLTR for constructing the D discriminator of Section 3. Pretrained models such as BERT, GPT-2 small or GPT-2 large will be used to get the language distribution . Same as in [18], we assume that synthetic texts do mostly contain high-rank terms and natural texts include more low-rank terms. We still need to design a numeric scheme for computing and assessing the quantity of high-rank words used in each sample and a discretization scheme to translate that quantity in one of the two h or m categories. We propose to calculate (fraction of probabilities) for each word of the text sample ( word sequence). It is the fraction between the probability of a given word in its position and the highest probability of any language word appearing in that position, given by the language distribution we obtained from the pretrained model. The values of each word will be used to compute the average score of a text sample consisting of words using this formula:

Regarding the discretization, we will need to find a threshold value of the score and then separate h samples from m ones using the scheme of Equation 2:


To find the optimal value, we will need to empirically examine many synthetic and natural texts and their respective scores (e.g., following the recommendations of [1]). After labeling every test sample output of the NLG method G, we can make use of Equation 1 to finally obtain its h score. A higher h score reflects a better ability for producing texts that are perceived as h class (texts with more low-rank words). It is thus an indication that the human likeliness of texts produced by G is high.

3.3 Alternative Schemes

Since the values are continuous, using a single value to separate the categories may not be appropriate. A better alternative could be to use two threshold values for : as a left boundary and as a right boundary. Doing so, we have a better separation of the two intervals for class h () and class m () by a third interval () that constitutes the u (for undefined or unknown) class of samples. In other words, a better approach could be to use the alternative implementation we proposed at [10] which makes use of the following equations:


Once again, to find the optimal and values, several empirical tests using synthetic and natural samples will need to be conducted. The and values will be set based on the average natural text and the average synthetic text scores, together with their respective variances.

Another problem could be a information loss from the discretizations schemes of Equations 2 or 3. Discretizing the continuous and then computing the continuous h score may result in a significant loss of precision. A solution could be to completely avoid the h scores and insted use the values of the test samples to compute the average on the entire test dataset. This approach could be cleaner and simpler, leading to a better quality indicator than the h score. Furthermore, this simpler practice could be adopted more easily, easing the cross-interpretation of the results. Another drawback is the fact that the discrimination scheme could suffer from the word repetitions, grammatically incorrect words, or similar discrepancies. As a result, additional text checkups or preprocessing steps may be required to ensure its validity. Finally, the scores depend on the pretrained backend of D. As a result, the human likeliness reports of certain experiments should also include the specific backend used for the discrimination process.

4 Role of Model Size on Probability Fractions

Since the method and metric we are proposing are completely based on the probability fractions, we tried to learn more about the factors that may influence the scores. More specifically, in this section we examine the role of the generator and discriminator sizes in the scores of the texts they produce and assess.

4.1 Experimental Setup

The results of predictive models based on neural networks are usually sensitive to the size and depth of the given network. We logically expect the model size (especially the number of Transformer layers) to be important in both generator and discriminator modules. A bigger (deeper) generator does usually yield more coherent and stable texts which are closer to natural ones. Similarly, a bigger and deeper discriminator should be more capable in capturing word and phrase contexts. We thus expect it to be more accurate than a smaller one when setting the relative word ranks and values for each position and the entire text sample. To be more concise, we construct the following two null hypotheses:

  • There is no significant difference between generated and reference sample scores, despite using small and large generators.

  • There is no significant difference between generated and reference sample scores, despite using small and large discriminators to compute them.

To confirm or reject these two assumptions, we conducted several experiments with ATS models which read the content of a source text and then learn to generate an abridged abstract of it. We picked the CNN/DailyMail news collection of Nallapati et al. [30] as our benchmark dataset. It is very popular in the literature since it is one of the few large datasets (287 113 train, 13 368 validation, and 11 490 test samples) with multi-sentence sources and summaries. Our goal is to compare the scores of the generated news summaries against those of the gold or reference ones. For this, we used the predictions and reference samples of CNN/DailyMail test split. Since we expect the generated samples to contain relatively more high-rank words, Fpgen (average of the generated samples) should be higher than Fpgold (average of the reference samples) in most of the cases. Moreover, the difference between Fpgen and Fpgold should be higher when using a deeper generator compared to a smaller one. Regarding the role of the discriminator size, we also expect to get a higher difference between Fpgen and Fpgold when using a bigger language model to compute them.

As the smaller discriminator backend, we used GPT2 (small) which is a stacked decoder Transformer with 12 blocks and a total of 117 million parameters. As the bigger backend, we tried BERT, a bidirectional transformer with 24 blocks and a total of 340 million parameters. We would probably have a more fair comparison by using GPT2 small against GPT2 large. Unfortunately, we could not use the latter because of its size (1.5 billion parameters) and computation requirements. The first generator we trained is a text summarizer (here we call it Tsumm) based on a Transformer of four layers in both encoder and decoder, 512 dimensions in each layer, and a total of 81 million training parameters. We used 200K training steps and 8000 warm-up steps, with mini-batches of size 16 and Adam optimizer parameters and .

Story: this dog ’s certainly not setting a good example to the youngsters under her charge . yack: gemma the pit bull was filmed at home in california being fed some treats . but in a bid to trick her , her owner throws a broccoli spear into the mix . immediately the canine pulls a look of disgust as she chomps on the vegetable . she then proceeds to spit it out on the floor . let ’s hope the two children she lives with do n’t follow her lead and they learn to love their greens . when she ’s not filling her face , other videos show gemma enjoys sleeping and hanging out with her human family .
Reference: gemma the pit bull was filmed at home in california being fed some treats . but in a bid to trick her , her owner throws a broccoli spear into the mix . she then proceeds to spit it out on the floor
Tsumm: gemma the pit bull was filmed at home in california being fed some treats . her owner throws a broccoli spear into the mix . she then proceed spit it out on the floor .
Bsumm: gemma the pit bull was filmed at home in california being fed some treats . but in a bid to trick her her owner throws a broccoli spear into the mix
Table 1: Summarization example from Tsumm and Bsumm generators.

As the bigger generator, we used the abstractive text summarizer of Liu and Lapata [26]. The authors modify the original BERT to make is suitable for text summarization (encode and manipulate multi-sentence inputs). They overcome the length limit of 512 position embeddings in BERT to process longer source samples. Their BERT variant (they call it BERTSUM) can be used for both extractive and abstractive TS. We used their abstractive summarizer which is an encoder-decoder model with BERTSUM as the encoder and a Transformer of 6 layers as the decoder (we call this Bsumm). To have stability during tuning, the encoder and the decoder are optimized with different learning rates and wormup steps: 0.002, 20000 and 0.1, 10000 respectively. The rest of the parameters are used with the same values as in Tsumm, resulting in a total of about 180 million training parameters. In total, we got four trials: generating with Tsumm and discriminating with GPT2, generating with Tsumm and discriminating with BERT, generating with Bsumm and discriminating with GPT2, and finally, generating with Bsumm and discriminating with BERT.

4.2 Probability Fraction Results

We ran the experiments and obtained the summaries from the two generators on the CNN/DailyMail test split. Tsumm obtained ROUGE-1, ROUGE-2, and ROUGE-L F scores of 38.2 %, 16.3 %, and 35.3 % respectively. The corresponding scores reached by Bsumm were 41.6 %, 19.3 %, and 38.7 %. A story, its reference summary, and the two generated summaries are given in Table 1. As we can see, both Tsumm and Bsumm have produced a coherent and fluent summary (missing only a small portion of the reference one). Table 2

presents the mean and standard deviation

values of the predicted and reference news summary samples in each of the four trials.

We also counted the cases when Fpgen is higher than Fpgold and computed their difference in each of the four setups. The corresponding results are presented in Table 3. In the first trial (Transumm vs. GPT2), we see that Fpgen was higher than Fpgold in only 53.76 % of the cases. Their difference was only 0.012 and there was no statistical significance. However, the picture seems different in the second trial when BERT is used as the discriminator. Here we have Fpgen higher than Fpgold in 58.42 % of the cases and a score difference of 0.072 which was statistically significant. In the third trial (Bertsumm vs. GPT2) we got 68.32 % of the samples having Fpgen higher than Fpgold. The Fpgen - Fpgold value was again statistically significant, despite being only 0.051. The last trial gave us even better results, with The Fpgen greater than Fpgold in 72.64 % of the cases and a difference of 0.08 which was again statistically significant.

GPT2 (117 M)       BERT (340 M)
Generator Fpgen Fpgold Fpgen Fpgold
Tsumm 0.101 (0.093) 0.089 (0.07) 0.336 (0.28) 0.264 (0.245)
Bsumm 0.14 (0.072) 0.089 (0.07) 0.344 (0.159) 0.264 (0.245)
Table 2: Mean of probability fractions for the two generators and the two discriminators (standard deviation in parenthesis).
GPT2 (117 M)         BERT (340 M)
Generator Fpgen >  Fpgold Fpgen - Fpgold Fpgen >  Fpgold Fpgen - Fpgold
Tsumm 53.76 % 0.012 (13.69 %) 58.42 % 0.072(27.08 %)
Bsumm 68.32 % 0.051(42.79 %) 72.64 % 0.08(29.46 %)
Table 3: Difference between the mean probability fractions of the generated sample and the gold one. Values with are statistically significant ().

It is important to note that the values were mostly low which explains the even lower Fpgen - Fpgold differences (percentage in parenthesis). Based on these results, we can safely reject the two null hypotheses listed above and confirm that larger generators do yield higher differences between scores of their generated samples and the human ones. Furthermore, larger discriminators do also provide higher differences between scores of the synthetic samples and the human ones. These results indicate that the probability fractions could be a viable means for automating text naturalness evaluation.

5 Discussion

In this paper, we started by reviewing several applications of language models to automate various text-related tasks. As our main goal is the automation of text naturalness evaluation, we described a method for automatically evaluating this text quality criterion of the NLG systems by computing the human-likeliness score that we propose. It is the average number of human-labeled test samples. Instead of relying on human participants to label those samples, we propose to use a discrimination approach based on large pretrained language models like BERT or GPT2 and the computation of the probability fraction of each word and the entire text. An alternative scheme can be used to discretize the fraction probability values in cases of high information loss from the discriminator.

To have an idea about the role of the generator and the discriminator in the probability fractions and their viability towards our goal, we conducted several experiments involving two text summarization models and two language models used as discriminators. Our results indicate that the probability fractions produced by larger discriminators can potentially lead to more stable and accurate text naturalness assessments. Furthermore, bigger generation models produce more stable probability fractions. In the future, several empirical observations using synthetic and natural samples will be conducted to find the optimal setup of our proposal. We plan to replicate the experiments in similar tasks such as title prediction and question answering. A comprehensive validation of the scheme we proposed by involving human participants who will judge the naturalness of the text samples is also in our schedule. This will check the agreement between automatic predictions and human evaluations.


  • [1]

    Aguilar-Ruiz, J., Bacardit, J., Divina, F.: Experimental evaluation of discretization schemes for rule induction. In: Deb, K. (ed.) Genetic and Evolutionary Computation – GECCO 2004. pp. 828–839. Springer Berlin Heidelberg (2004)

  • [2] Ambati, B.R., Reddy, S., Steedman, M.: Assessing relative sentence complexity using an incremental CCG parser. In: Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics. pp. 1051–1057. Association for Computational Linguistics, San Diego, California (Jun 2016).,
  • [3] Amidei, J., Piwek, P., Willis, A.: Evaluation methodologies in automatic question generation 2013-2018. In: Proceedings of the 11th International Conference on Natural Language Generation. pp. 307–317. Association for Computational Linguistics, Tilburg University, The Netherlands (Nov 2018).,
  • [4] Bahdanau, D., Cho, K., Bengio, Y.: Neural machine translation by jointly learning to align and translate. In: 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings (2015),
  • [5] Banerjee, S., Lavie, A.: METEOR: An automatic metric for MT evaluation with improved correlation with human judgments. In: Proceedings of the ACL Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization. pp. 65–72. Association for Computational Linguistics, Ann Arbor, Michigan (Jun 2005),
  • [6] Beltagy, I., Lo, K., Cohan, A.: SciBERT: A pretrained language model for scientific text. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3615–3620. Association for Computational Linguistics, Hong Kong, China (Nov 2019).,
  • [7] Bojar, O., Kos, K., Mareček, D.: Tackling sparse data issue in machine translation evaluation. In: Proceedings of the ACL 2010 Conference Short Papers. pp. 86–91. Association for Computational Linguistics, Uppsala, Sweden (Jul 2010),
  • [8] Çano, E., Bojar, O.: Efficiency metrics for data-driven models: A text summarization case study. In: Proceedings of the 12th International Conference on Natural Language Generation. pp. 229–239. Association for Computational Linguistics, Tokyo, Japan (Oct–Nov 2019).,
  • [9] Çano, E., Bojar, O.: Keyphrase generation: A multi-aspect survey. In: 2019 25th Conference of Open Innovations Association (FRUCT). pp. 85–94. Helsinki, Finland (Nov 2019).,
  • [10] Çano, E., Bojar, O.: Human or machine: Automating human likeliness evaluation of nlg texts. CoRR abs/2006.03189 (2020),
  • [11] Çano, E., Bojar, O.: Two huge title and keyword generation corpora of research articles. In: Proceedings of The 12th Language Resources and Evaluation Conference. pp. 6663–6671. European Language Resources Association, Marseille, France (may 2020),
  • [12]

    Çano, E., Bojar, O.: Sentiment analysis of czech texts: An algorithmic survey. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: NLPinAI,. pp. 973–979. INSTICC, SciTePress (2019).
  • [13] Çano, E., Morisio, M.: A data-driven neural network architecture for sentiment analysis. Data Technologies and Applications 53(1), 2–19 (2019).,
  • [14] Chen, P., Wu, F., Wang, T., Ding, W.: A semantic qa-based approach for text summarization evaluation. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018. pp. 4800–4807. AAAI Press (2018),
  • [15] Denkowski, M., Lavie, A.: Choosing the Right Evaluation for Machine Translation: an Examination of Annotator and Automatic Metric Performance on Human Judgment Tasks. In: Proceedings of AMTA 2010 (2010)
  • [16] Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). pp. 4171–4186. Association for Computational Linguistics, Minneapolis, Minnesota (Jun 2019).,
  • [17] Fornaciari, T., Poesio, M.: Identifying fake Amazon reviews as learning from crowds. In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. pp. 279–287. Association for Computational Linguistics, Gothenburg, Sweden (Apr 2014).,
  • [18] Gehrmann, S., Strobelt, H., Rush, A.: GLTR: Statistical detection and visualization of generated text. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: System Demonstrations. pp. 111–116. Association for Computational Linguistics, Florence, Italy (Jul 2019).,
  • [19] Gkatzia, D., Mahamood, S.: A snapshot of NLG evaluation practices 2005 - 2014. In: Proceedings of the 15th European Workshop on Natural Language Generation (ENLG). pp. 57–60. Association for Computational Linguistics, Brighton, UK (Sep 2015).,
  • [20] Hastie, H., Belz, A.: A comparative evaluation methodology for nlg in interactive systems. In: Proceedings of LREC’14. pp. 4004–4011. European Language Resources Association (12 2014)
  • [21] Kim, H., Lim, J.H., Kim, H.K., Na, S.H.: Qe bert: Bilingual bert using multi-task learning for neural quality estimation. In: Proceedings of the Fourth Conference on Machine Translation (Volume 3: Shared Task Papers, Day 2). pp. 87–91. Association for Computational Linguistics, Florence, Italy (August 2019),
  • [22]

    Klein, G., Kim, Y., Deng, Y., Senellart, J., Rush, A.: OpenNMT: Open-source toolkit for neural machine translation. In: Proceedings of ACL 2017, System Demonstrations. pp. 67–72. Association for Computational Linguistics, Vancouver, Canada (Jul 2017),
  • [23] van der Lee, C., Gatt, A., van Miltenburg, E., Wubben, S., Krahmer, E.: Best practices for the human evaluation of automatically generated text. In: Proceedings of the 12th International Conference on Natural Language Generation. pp. 355–368. Association for Computational Linguistics, Tokyo, Japan (Oct–Nov 2019).,
  • [24] Lee, J., Yoon, W., Kim, S., Kim, D., Kim, S., So, C.H., Kang, J.: BioBERT: a pre-trained biomedical language representation model for biomedical text mining. Bioinformatics 36(4), 1234–1240 (09 2019).
  • [25] Lin, C.Y.: Rouge: A package for automatic evaluation of summaries. In: Proc. ACL workshop on Text Summarization Branches Out. p. 10 (2004),
  • [26] Liu, Y., Lapata, M.: Text summarization with pretrained encoders. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3730–3740. Association for Computational Linguistics, Hong Kong, China (Nov 2019).,
  • [27]

    Maas, A.L., Daly, R.E., Pham, P.T., Huang, D., Ng, A.Y., Potts, C.: Learning word vectors for sentiment analysis. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies. pp. 142–150. Association for Computational Linguistics, Portland, Oregon, USA (June 2011),
  • [28] Malmasi, S., Zampieri, M.: Detecting hate speech in social media. In: Proceedings of the Recent Advances in Natural Language Processing Conference (RANLP 2017). p. 467–472. Varna, Bulgaria (September 2017).
  • [29]

    Mozafari, M., Farahbakhsh, R., Crespi, N.: A bert-based transfer learning approach for hate speech detection in online social media. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) Complex Networks and Their Applications VIII. pp. 928–940. Springer International Publishing, Cham (2020)

  • [30] Nallapati, R., Zhou, B., dos Santos, C., Gulcehre, C., Xiang, B.: Abstractive text summarization using sequence-to-sequence rnns and beyond. In: Proceedings of The 20th SIGNLL Conference on Computational Natural Language Learning. pp. 280–290. Association for Computational Linguistics (2016).,
  • [31] Novikova, J., Dušek, O., Cercas Curry, A., Rieser, V.: Why we need new evaluation metrics for NLG. In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. pp. 2241–2252. Association for Computational Linguistics, Copenhagen, Denmark (Sep 2017).,
  • [32] Papineni, K., Roukos, S., Ward, T., Zhu, W.J.: Bleu: a method for automatic evaluation of machine translation. In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (2002),
  • [33] Pérez-Rosas, V., Kleinberg, B., Lefevre, A., Mihalcea, R.: Automatic detection of fake news. In: Proceedings of the 27th International Conference on Computational Linguistics. pp. 3391–3401. Association for Computational Linguistics, Santa Fe, New Mexico, USA (Aug 2018),
  • [34] Peters, M., Neumann, M., Iyyer, M., Gardner, M., Clark, C., Lee, K., Zettlemoyer, L.: Deep contextualized word representations. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). pp. 2227–2237. Association for Computational Linguistics, New Orleans, Louisiana (Jun 2018).,
  • [35] Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I.: Language models are unsupervised multitask learners (2018),
  • [36] Reiter, E.: A structured review of the validity of BLEU. Computational Linguistics 44(3), 393–401 (Sep 2018).,
  • [37] Reiter, E., Belz, A.: An investigation into the validity of some metrics for automatically evaluating natural language generation systems. Computational Linguistics 35(4), 529–558 (2009).,
  • [38] Shu, K., Sliva, A., Wang, S., Tang, J., Liu, H.: Fake news detection on social media: A data mining perspective. SIGKDD Explor. Newsl. 19(1), 22–36 (Sep 2017).,
  • [39] Sulem, E., Abend, O., Rappoport, A.: BLEU is not suitable for the evaluation of text simplification. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. pp. 738–744. Association for Computational Linguistics, Brussels, Belgium (Oct-Nov 2018).,
  • [40]

    Sun, C., Myers, A., Vondrick, C., Murphy, K., Schmid, C.: Videobert: A joint model for video and language representation learning. In: 2019 IEEE/CVF International Conference on Computer Vision (ICCV). pp. 7463–7472. Seoul, South Korea (2019)

  • [41] Tu, Z., Lu, Z., Liu, Y., Liu, X., Li, H.: Modeling coverage for neural machine translation. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics. pp. 76–85. Association for Computational Linguistics (2016).,
  • [42] Vajjala, S., Meurers, D.: Assessing the relative reading level of sentence pairs for text simplification. In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL-14). Association for Computational Linguistics, Gothenburg, Sweden (2014),
  • [43] Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30, pp. 5998–6008. Curran Associates, Inc. (2017),
  • [44] Wang, A., Cho, K.: BERT has a mouth, and it must speak: BERT as a Markov random field language model. In: Proceedings of the Workshop on Methods for Optimizing and Evaluating Neural Language Generation. pp. 30–36. Association for Computational Linguistics, Minneapolis, Minnesota (Jun 2019).,
  • [45]

    Young, T., Hazarika, D., Poria, S., Cambria, E.: Recent trends in deep learning based natural language processing [review article]. IEEE Computational Intelligence Magazine

    13(3), 55–75 (Aug 2018).
  • [46] Zellers, R., Holtzman, A., Rashkin, H., Bisk, Y., Farhadi, A., Roesner, F., Choi, Y.: Defending against neural fake news. In: Advances in Neural Information Processing Systems 32, pp. 9054–9065. Curran Associates, Inc. (2019),
  • [47] Zhang, Z., Robinson, D., Tepper, J.: Detecting hate speech on twitter using a convolution-gru based deep neural network. In: Gangemi, A., Navigli, R., Vidal, M.E., Hitzler, P., Troncy, R., Hollink, L., Tordai, A., Alam, M. (eds.) The Semantic Web. pp. 745–760. Springer International Publishing, Cham (2018)
  • [48] Zhou, W., Xu, K.: Learning to compare for better training and evaluation of open domain natural language generation models. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. pp. 9717–9724. AAAI Press (2020),