| { |
| "paper_id": "2022", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T03:29:02.495665Z" |
| }, |
| "title": "A Study on Manual and Automatic Evaluation for Text Style Transfer: The Case of Detoxification", |
| "authors": [ |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Skolkovo Institute of Science and Technology (Skoltech)", |
| "location": {} |
| }, |
| "email": "v.logacheva@skoltech.ru" |
| }, |
| { |
| "first": "Daryna", |
| "middle": [], |
| "last": "Dementieva", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Skolkovo Institute of Science and Technology (Skoltech)", |
| "location": {} |
| }, |
| "email": "daryna.dementieva@skoltech.ru" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Krotova", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Mobile TeleSystems (MTS)", |
| "location": {} |
| }, |
| "email": "i.krotova@mts.ai" |
| }, |
| { |
| "first": "Alena", |
| "middle": [], |
| "last": "Fenogenova", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "fenogenova.a.s@sberbank.ru" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Nikishina", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Skolkovo Institute of Science and Technology (Skoltech)", |
| "location": {} |
| }, |
| "email": "irina.nikishina@skoltech.ru" |
| }, |
| { |
| "first": "Tatiana", |
| "middle": [], |
| "last": "Shavrina", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| }, |
| { |
| "first": "Alexander", |
| "middle": [], |
| "last": "Panchenko", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Skolkovo Institute of Science and Technology (Skoltech)", |
| "location": {} |
| }, |
| "email": "a.panchenko@skoltech.ru" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "It is often difficult to reliably evaluate models which generate text. Among them, text style transfer is a particularly difficult to evaluate, because its success depends on a number of parameters. We conduct an evaluation of a large number of models on a detoxification task. We explore the relations between the manual and automatic metrics and find that there is only weak correlation between them, which is dependent on the type of model which generated text. Automatic metrics tend to be less reliable for better-performing models. However, our findings suggest that, ChrF and BertScore metrics can be used as a proxy for human evaluation of text detoxification to some extent.", |
| "pdf_parse": { |
| "paper_id": "2022", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "It is often difficult to reliably evaluate models which generate text. Among them, text style transfer is a particularly difficult to evaluate, because its success depends on a number of parameters. We conduct an evaluation of a large number of models on a detoxification task. We explore the relations between the manual and automatic metrics and find that there is only weak correlation between them, which is dependent on the type of model which generated text. Automatic metrics tend to be less reliable for better-performing models. However, our findings suggest that, ChrF and BertScore metrics can be used as a proxy for human evaluation of text detoxification to some extent.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "There exist many Natural Language Processing (NLP) tasks whose output is a text (dialogue, summarization, etc.). They often adopt the evaluation techniques from Machine Translation (MT). Namely, researchers often compare the output of a model with a pre-defined reference answer and measure the model quality as the similarity to this reference. The similarity can be computed at the level of words and phrases (e.g. BLEU or METEOR) or be more semantically motivated and compare the embeddings (e.g. BertScore or BLEURT).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "This approach has a number of drawbacks which make it inapplicable to some generation tasks, e.g. style transfer. This is a task of changing a text such that its meaning stays the same and the style changes. Style can refer to any attribute concerning only the form of the text (e.g. degree of formality or politeness) or its content (e.g. sentiment, author features, etc.). When evaluating the output of a style transfer model, we need to pay attention to both the style change and the content preservation. The traditional MT evaluation metrics mainly * Equal contribution check the semantic similarity, which makes them unsuitable for style transfer.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "There exist evaluation metrics (Krishna et al., 2020) which were devised to consider all important aspects of style transfer quality (style, semantic similarity and sometimes fluency). However, they heavily rely on automatic models (e.g. style classifier) whose performance is not perfect. Many works acknowledge the low reliability of such metrics and arrange manual evaluation to get the objective information on the models performance. Unfortunately, such evaluation is laborious and cannot be conducted often, so during development of models researchers still have to resort to automatic metrics.", |
| "cite_spans": [ |
| { |
| "start": 31, |
| "end": 53, |
| "text": "(Krishna et al., 2020)", |
| "ref_id": "BIBREF14" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Although works on style transfer acknowledge that automatic evaluation metrics are unreliable, there is little work on the analysis of their performance. There exist analysis of content preservation metrics (Yamshchikov et al., 2021) and of all style transfer evaluation metrics (Briakou et al., 2021a) . The latter work provides an evaluation where metrics are tested on different systems and different style transfer directions.", |
| "cite_spans": [ |
| { |
| "start": 207, |
| "end": 233, |
| "text": "(Yamshchikov et al., 2021)", |
| "ref_id": "BIBREF39" |
| }, |
| { |
| "start": 279, |
| "end": 302, |
| "text": "(Briakou et al., 2021a)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We further extend this line of research by testing the evaluation metrics on a new style transfer task (detoxification) and a new language (Russian). For this comparison we create a large parallel corpus for detoxification. We compare the performance of models based on different principles, which allows more robust evaluation. Furthermore, since we compare a large number of models, we can understand to what extent the automatic metrics can rank the models correctly. Besides that, due to the large number of tested models we decided to use crowdsourced evaluation instead of experts. We describe our crowdsourcing annotation setup and analyse the performance of crowd workers. Finally, the large-scale evaluation allows us to gain insights on the performance of various style transfer models. The research was based on the data of a competition of detoxification models for the Russian language organized by the authors of this paper. 1", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The style transfer task is formulated as follows. We would like to rewrite a text so that it keeps most of its content, but one particular attribute of this text (denoted as style) changes. The \"style\" can refer to various features of the text such as the level of formality, politeness, simplicity, the presence of bias or the features of the author (e.g. gender or membership in a political party). The task is usually to transfer between two \"opposite\" styles (polite-impolite, positive-negative), but there can exist models which support multiple exclusive or non-exclusive styles.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Style transfer task can be formally defined as follows. We have a set of styles S = {s src , s tg } 2 and two corpora D src = {d src 1 , ..., d src n } and D tg = {d tg 1 , ..., d tg m } in the styles s src and s tg , respectively. Let us also define the following functions. The style of a sentence is measured with \u03c3 :", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "D \u2192 S. A binary function \u03b4 : D \u00d7 D \u2192 {0, 1}", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "indicates the equivalence of meanings of the two styles. Finally, the function \u03b8 : D \u2192 {0, 1} defines if a text belongs to well-formed sentences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Text style transfer task is thus defined as a function \u03b1 : S \u00d7 S \u00d7 D \u2192 D. Given a text d src and its source and target styles s src and s tg it transforms the text to a new text d tg such that:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "\u2022 the style of the text is changed from the source s src to the target s tg :", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "\u03c3(d src ) \u0338 = \u03c3(d tg ), \u03c3(d tg ) = s tg ,", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "\u2022 the contents of the original and the transformed sentences match: \u03b4(d src , d tg ) = 1, \u2022 the resulting sentence is well-formed (fluent):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "\u03b8(d tg ) = 1.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Therefore, a style transfer model has to optimize all three functions. Analogously, to evaluate the performance of a style transfer model, we need to check that all three conditions hold: the style is appropriately changed, the content stayed intact, and the text is fluent. However, these three conditions are often inversely correlated (Pang and Gimpel, 2019) . This makes style transfer evaluation a notoriously difficult problem. Since the three conditions have to be explicitly checked, we cannot adopt the techniques used for the evaluation of other text generation models. In this work we make all evaluation on a detoxification task for which more broad definition of style transfer is fully applicable.", |
| "cite_spans": [ |
| { |
| "start": 338, |
| "end": 361, |
| "text": "(Pang and Gimpel, 2019)", |
| "ref_id": "BIBREF26" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Style Transfer Formulation", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "In earlier works, reference-based evaluation metrics were considered a holistic evaluation technique , by analogy with Machine Translation. Even some recent works (Sudhakar et al., 2019; use BLEU or other metrics such as GLEU as the only means of evaluation. Unfortunately, they often cannot control style. Thus, it became obvious that both content and style have to be directly evaluated.", |
| "cite_spans": [ |
| { |
| "start": 163, |
| "end": 186, |
| "text": "(Sudhakar et al., 2019;", |
| "ref_id": "BIBREF34" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation of Style Transfer", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "Some works settle for mere evaluation of style and content (Malmi et al., 2020; Zhang et al., 2020b) . However, more often these two metrics are combined by computing their geometric or harmonic mean, as first suggested by (Xu et al., 2018) . This technique is often used to get the joint quality score (Riley et al., 2021; Huang et al., 2021; Lai et al., 2021a,b) . Many (although not all) works also evaluate the fluency of the generated text. This is almost exclusively done via computing perplexity of text in terms of a language model (e.g. GPT-2 (Radford et al., 2019) ). The only alternative used in style transfer works is the use of classifier of linguistic acceptability (Krishna et al., 2020) trained on CoLA dataset (Warstadt et al., 2018) . Fluency is sometimes also included to the joint score together with the style and content preservation. (Pang and Gimpel, 2019) compute it as a document-level geometric mean, and (Krishna et al., 2020) multiply the sentence-level scores. In our work we use the latter approach.", |
| "cite_spans": [ |
| { |
| "start": 59, |
| "end": 79, |
| "text": "(Malmi et al., 2020;", |
| "ref_id": "BIBREF25" |
| }, |
| { |
| "start": 80, |
| "end": 100, |
| "text": "Zhang et al., 2020b)", |
| "ref_id": "BIBREF41" |
| }, |
| { |
| "start": 223, |
| "end": 240, |
| "text": "(Xu et al., 2018)", |
| "ref_id": "BIBREF38" |
| }, |
| { |
| "start": 303, |
| "end": 323, |
| "text": "(Riley et al., 2021;", |
| "ref_id": "BIBREF31" |
| }, |
| { |
| "start": 324, |
| "end": 343, |
| "text": "Huang et al., 2021;", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 344, |
| "end": 364, |
| "text": "Lai et al., 2021a,b)", |
| "ref_id": null |
| }, |
| { |
| "start": 546, |
| "end": 574, |
| "text": "GPT-2 (Radford et al., 2019)", |
| "ref_id": null |
| }, |
| { |
| "start": 681, |
| "end": 703, |
| "text": "(Krishna et al., 2020)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 728, |
| "end": 751, |
| "text": "(Warstadt et al., 2018)", |
| "ref_id": "BIBREF37" |
| }, |
| { |
| "start": 933, |
| "end": 955, |
| "text": "(Krishna et al., 2020)", |
| "ref_id": "BIBREF14" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation of Style Transfer", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "The researchers have come to a conclusion that these automatic metrics cannot provide an objective evaluation. It has become a de-facto standard to enhance the automatic evaluation with the human evaluation experiments.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Manual Evaluation of Style Transfer", |
| "sec_num": "2.3" |
| }, |
| { |
| "text": "There are two main human evaluation scenarios. Outputs of two models can be evaluated side by side, in this case the authors report the number of wins of each of the models (i.e. the number of cases where a particular model generated a better text) and the number of ties Li et al., 2019; Cheng et al., 2020) . Alternatively, the outputs of different models are evaluated in-dependently. In this case the assessors evaluate the outputs along three parameters: style, content preservation, and fluency. The parameters are often evaluated in terms of a 1-to-5 scale (Zhou et al., 2020; Madaan et al., 2020; John et al., 2019; Lee et al., 2021; Ma et al., 2021) . Sometimes the style is evaluated in terms of a 7-value scale (from -3 to 3), content preservation takes values from 1 to 6 (Chawla and Yang, 2020; Briakou et al., 2021b) . Other scales are also possible. Besides that, the three individual metrics can be evaluated using the side-by-side scenario (Sudhakar et al., 2019; Lin et al., 2020) .", |
| "cite_spans": [ |
| { |
| "start": 272, |
| "end": 288, |
| "text": "Li et al., 2019;", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 289, |
| "end": 308, |
| "text": "Cheng et al., 2020)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 564, |
| "end": 583, |
| "text": "(Zhou et al., 2020;", |
| "ref_id": "BIBREF42" |
| }, |
| { |
| "start": 584, |
| "end": 604, |
| "text": "Madaan et al., 2020;", |
| "ref_id": "BIBREF24" |
| }, |
| { |
| "start": 605, |
| "end": 623, |
| "text": "John et al., 2019;", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 624, |
| "end": 641, |
| "text": "Lee et al., 2021;", |
| "ref_id": "BIBREF18" |
| }, |
| { |
| "start": 642, |
| "end": 658, |
| "text": "Ma et al., 2021)", |
| "ref_id": "BIBREF23" |
| }, |
| { |
| "start": 784, |
| "end": 807, |
| "text": "(Chawla and Yang, 2020;", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 808, |
| "end": 830, |
| "text": "Briakou et al., 2021b)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 957, |
| "end": 980, |
| "text": "(Sudhakar et al., 2019;", |
| "ref_id": "BIBREF34" |
| }, |
| { |
| "start": 981, |
| "end": 998, |
| "text": "Lin et al., 2020)", |
| "ref_id": "BIBREF21" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Manual Evaluation of Style Transfer", |
| "sec_num": "2.3" |
| }, |
| { |
| "text": "The evaluation was conducted under the scope of a competition of detoxification models for the Russian language . 3 For this competition we created a Russian parallel corpus of toxic sentences and their manually written nontoxic equivalents. We also developed several baselines.", |
| "cite_spans": [ |
| { |
| "start": 114, |
| "end": 115, |
| "text": "3", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Detoxification Competition Details", |
| "sec_num": "3" |
| }, |
| { |
| "text": "We collected a parallel Russian dataset for detoxification for this competition. The corpus was collected via the Yandex.Toloka 4 crowdsourcing platform. We used the data collection setup described by There, the crowd workers were asked to rewrite a sentence so that it preserves its content, but does not sound toxic. Then other crowd workers checked the rewritten sentence for toxicity and semantic similarity with the original one. The platform of Yandex.Toloka has a special mark for cases of inappropriate and toxic content. Thus, all the crowd workers were notified about possible unethical context of the task and we get approvals for the experiment.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Parallel Dataset", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "As it was noted, we need the toxic and corresponding neutral sentences to be semantically similar. Therefore, during the generation of the dataset we ask crowd workers to rewrite the sentence in a non-offensive way and keep its content. If it is impossible to detoxify a sentence, a worker can choose to not change it. Such sentences are not included to the resulting dataset. All the generated detoxified sentences are then checked for the absence of toxicity and semantic similarity to the original sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Parallel Dataset", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "We use Russian toxic sentences from the corpora of user utterances taken from Russian social networks Odnoklassniki (Kaggle, 2019) and Pikabu (Kaggle, 2020) , and from the Russian segment of Twitter (Rubtsova, 2015) . We select only the sentences which were classified as toxic by a pretrained toxicity classifier. The classifier is a ru-BERT model (Kuratov and Arkhipov, 2019) finetuned on the same datasets. Overall, our dataset contains 8,622 sentences. We use 6,947 of them as training data, 800 for validation and 875 for testing models.", |
| "cite_spans": [ |
| { |
| "start": 116, |
| "end": 130, |
| "text": "(Kaggle, 2019)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 142, |
| "end": 156, |
| "text": "(Kaggle, 2020)", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 199, |
| "end": 215, |
| "text": "(Rubtsova, 2015)", |
| "ref_id": null |
| }, |
| { |
| "start": 349, |
| "end": 377, |
| "text": "(Kuratov and Arkhipov, 2019)", |
| "ref_id": "BIBREF15" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Parallel Dataset", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "The competition rules allowed the participants to use the collected dataset and any additional corpora and pre-trained models as long as they are free and publicly available. The participants could also use our baseline models in any way.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Competition Rules", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "We evaluated the participating models both manually and automatically on the test set. We used state-of-the-art techniques for both evaluations. Due to the large amount of manual evaluation we resort to crowdsourcing instead of expert annotation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Competition Rules", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "We provide four baselines for detoxification task: a trivial Duplicate baseline, a rule-based Delete approach, fine-tuning on the ruT5 model and the continuous prompt tuning approach for ruGPT3 model.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Baselines", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "Duplicate This is a trivial baseline which consists in leaving the input text intact. It provides a lower threshold for models.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Baselines", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "Delete Delete is an unsupervised method that eliminates toxic words based on a predefined toxic words vocabulary. The idea is often used on television and other media: rude words are bleeped out or hidden with special characters (usually an asterisk). We provide both the vocabulary and the script that applies it to input sentences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Baselines", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "RuT5 Baseline Another approach is the supervised baseline based on the T5 model. We fine-tune the ruT5-base model 5 on the train part of the provided dataset.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Baselines", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "RuPrompts The third baseline is based on the library ruPrompts 6 for fast language model tuning via automatic prompt search. The method Continuous Prompt Tuning (Konodyuk and Tikhonova, 2021) is to train with gradient descent embeddings corresponding to the prompts, such approach is less expensive to compare with classic fine-tuning of a big language models. In the baseline we tuned the prompts for the ruGPT3-large model. Pre-trained prompts for the baseline is available in huggingface 7 .", |
| "cite_spans": [ |
| { |
| "start": 161, |
| "end": 191, |
| "text": "(Konodyuk and Tikhonova, 2021)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Baselines", |
| "sec_num": "4.1" |
| }, |
| { |
| "text": "We briefly describe the models developed by participants. More details about the participating systems can be found in Team 1 (ruT5-finetune) Authors approach is based on the ruT5 model 8 . It was fine-tuned on the part of competition train data with a learning rate 1e-5 on 15 epochs. Only the samples with fluency, similarity, and accuracy higher than 0.5 were selected from the train set. The best output is selected from 32 generated samples using beam search. It was decided not to use sampling.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 2 (ruGPT3-filter) This team's solution uses a model based on ruGPT3. The authors filtered the dataset released by the organizers with the following heuristics: (i) cosine similarity between the original and transformed sentences ranges from 0.6 to 0.99; (ii) ROUGE-L between the sentences ranges from 0.1 to 0.8; (iii) the transformed sentence length is less or equal to the original sentence length. This dataset was used to fine-tune ruGPT3.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 3 (lewis) solution is based on the LEWIS framework (Reid and Zhong, 2021), a coarse-tofine editor for style transfer that transforms text using Levenshtein edit operation. First, the sequence of coarse-grain Levenshtein edit types (keep, replace, delete or insert) was predicted for each sentence pair. Next, the resulting tags were used to train the conversational RuBERT 9 for the sequence tagging task. The ruT5-base model was trained to fill in the tokens for coarse-grain edit type replace.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 4 (ruGPT3-XL) trained RuGPT3 XL 10 to generate a non-toxic text on the competition train data. The input is the concatenation of the toxic and non-toxic sentences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 5 (RoBERTa-replace) solution is based on the RoBERTa-large 11 . The logistic regression model on the FastText vectors trained on the competition data was used as a toxic words classifier. Toxic tokens were substituted by RoBERTa-large model, where the best candidates were chosen by the cosine similarity between the candidate and the toxic token. In case it was not possible to find an acceptable candidate, the toxic word was removed from the sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 6 (ruT5-clean) used the ruT5-large model 12 improved by data cleaning. The preprocessing stage consitsts of emoticons and smiley filtering and removing duplicate characters. The Levenshtein Transformer (Susanto et al., 2020) was used as an extra step in preprocessing to clean the ruT5-large model output.", |
| "cite_spans": [ |
| { |
| "start": 207, |
| "end": 229, |
| "text": "(Susanto et al., 2020)", |
| "ref_id": "BIBREF35" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 7 (ruT5-large) modified the t5 baseline. RuT5-base was replaced by ruT5-large with beam search used as inference algorithm. 20 candidates were generated for each toxic sentence, the best candidate was selected by the largest J-score metric.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 8 (ruT5-preproc) This solution is based on ruT5-base model with additional pre-and postprocessing of the texts. Team finetuned the ruT5base model on the provided data and used heuristics for text pre/processing.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 9 (adversarial) This team devised an adversarial training setup where the training data was enriched with the artificially generated sentences which attained the highest scores of the automatic metrics.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "Team 10 (ruPrompts-plus) This team advanced over the ruPrompts baseline. The solution is based on RuGPT3-XL (Generative Pretrained Transformer-3 for Russian) 13 adapted to the task via prompt tuning. Using RuGPT3-XL as a frozen backbone, team trains only a sequence of continuous embeddings inserted before and after an input text.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Participants", |
| "sec_num": "4.2" |
| }, |
| { |
| "text": "In our automatic evaluation we follow the state-ofthe-art evaluation strategies. Namely, we replicate the setup of Krishna et al. (2020) . We evaluate the three parameters of style transfer quality: style of a text, content preservation, and fluency of a text. The three metrics are then aggregated to a joint score. We use the following techniques.", |
| "cite_spans": [ |
| { |
| "start": 115, |
| "end": 136, |
| "text": "Krishna et al. (2020)", |
| "ref_id": "BIBREF14" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Style (STA a ) is evaluated with a BERT-based classifier for toxicity detection. We use the same ruBERT-based classifier that was used for preselection (see Section 3.1).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Content (SIM a ) is evaluated as the cosine similarity of embeddings of the source and the transformed sentences. We use embeddings generated by LaBSE model (Feng et al., 2020) because in our preliminary experiments they showed the best performance for Russian. We prefer the embedding distance over BLEU-like metrics, as Yamshchikov et al. 2021showed that embedding-based metrics are better correlated with human judgments than ngram-based metrics such as BLEU. We do not use references for the evaluation of content to mimic the setup where references are unavailable, which is very common for style transfer tasks.", |
| "cite_spans": [ |
| { |
| "start": 157, |
| "end": 176, |
| "text": "(Feng et al., 2020)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Fluency (FL a ) Although fluency is usually evaluated as perplexity, we follow Krishna et al. (2020) and use an acceptability classifier. In this work this classifier was trained on CoLA dataset (Warstadt et al., 2018) . Since there is no such dataset for Russian, we create synthetic examples of corrupted sentences by randomly replacing, deleting or shuffling words in sentences as suggested by Kann et al. (2018) . We choose this method over perplexity, because it ranges from 0 to 1 and its greater values mean higher quality, just like metrics we use for evaluating toxicity and content. This makes it easier to combine the three metrics easier.", |
| "cite_spans": [ |
| { |
| "start": 79, |
| "end": 100, |
| "text": "Krishna et al. (2020)", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 195, |
| "end": 218, |
| "text": "(Warstadt et al., 2018)", |
| "ref_id": "BIBREF37" |
| }, |
| { |
| "start": 397, |
| "end": 415, |
| "text": "Kann et al. (2018)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Joint (J a ) Following Krishna et al. (2020), we combine the three metrics at the sentence level by multiplying them. The document-level score is computed as the average of scores for all sentences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "ChrF We provide an additional reference-based metric which follows the Machine Translation evaluation setup. We choose ChrF (Popovi\u0107, 2015) over BLEU, because it compares character ngrams and is more suitable for languages with rich morphology, such as Russian.", |
| "cite_spans": [ |
| { |
| "start": 124, |
| "end": 139, |
| "text": "(Popovi\u0107, 2015)", |
| "ref_id": "BIBREF28" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "The manual evaluation follows setups used in stateof-the-art works. We separately evaluate the three parameters of the transferred sentences, namely, their style, content, and fluency. We conduct the evaluation via crowdsourcing. For the evaluation we also use Yandex.Toloka platform.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Manual Evaluation", |
| "sec_num": "6" |
| }, |
| { |
| "text": "All three parameters are evaluated at the sentence level in terms of a binary scale, where 0 refers to the bad quality in terms of the parameter and 1 is the good quality. Assessors are given the following guidelines.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation Metrics", |
| "sec_num": "6.1" |
| }, |
| { |
| "text": "Toxicity (STA m ) The toxicity level is defined as:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation Metrics", |
| "sec_num": "6.1" |
| }, |
| { |
| "text": "\u2022 non-toxic (1) -the sentence does not contain any aggression or offence. However, we allow covert aggression and sarcasm. Note also that toxicity should not be mixed with the lack of formality. Even if a sentence is extremely informal, it is non-toxic unless it attacks someone. \u2022 toxic (0) -the sentence contains open aggression and/or swear words (this also applies to meaningless sentences).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation Metrics", |
| "sec_num": "6.1" |
| }, |
| { |
| "text": "In terms of content, sentences should be classified as:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 matching (1) -the output sentence fully preserves the content of the input sentence. Here, we allow some change of sense which is inevitable during detoxification (e.g. replacement with overly general synonyms: idiot becomes person or individual). It should also be noted that content and toxicity dimensions are independent, so if the output sentence is toxic, it can still be good in terms of content. \u2022 different (0) -the sense of the transferred sentence is different from the input. Here, the sense should not be confused with the word overlap. The sentence is different from its original version if its main intent has changed, (cf. I want to go out and I want to sleep).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "The partial loss or change of sense is also considered a mismatch (cf. I want to eat and sleep and I want to eat). Finally, when the transferred sentence is senseless, it should also be considered different.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "Fluency (FL m ) The fluency evaluation is different from the other metrics. We evaluate it along a ternary scale with the following values:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 fluent (1) -sentences with no mistakes, except punctuation and capitalisation errors. \u2022 partially fluent (0.5) -sentences which have orthographic and grammatical mistakes, nonstandard spellings. However, the sentence should be fully intelligible. \u2022 non-fluent (0) -sentences which are difficult or impossible to understand.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "However, since all the input sentences are usergenerated, they are not guaranteed to be fluent in terms of this scale. People often make mistakes, typos and use non-standard spelling variants. We cannot require that a detoxification model fixes them. Therefore, we consider an output of a model fluent if the model did not make less fluent than the original sentence. Thus, we evaluate both the input and the output sentences and define the final fluency score as fluent (1) if the fluency score of the output is greater or equal to that of the input, and non-fluent (0) otherwise.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "Joint Score (J m ) We aggregate the three metrics by multiplying sentence-level scores. Since all scores are binary, the joint score is 1 only if all three metrics are 1. Therefore, it indicates fully acceptable sentences.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Content (SIM m )", |
| "sec_num": null |
| }, |
| { |
| "text": "Each of the three parameters is evaluated in a separate crowdsourcing project. For all the projects, the evaluation was made by only native Russian speakers.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Crowdsourcing Setup", |
| "sec_num": "6.2" |
| }, |
| { |
| "text": "In the toxicity detection task (see Figure 1) we show workers the transferred sentence and ask them if it is offensive. Then, in the content similarity task we show both sentences and ask if they mean the same (see Figure 2 ). Finally, we apply the fluency evaluation task (see Figure 3) to both the source and the target and compute the final fluency score from the source and target scores.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 36, |
| "end": 45, |
| "text": "Figure 1)", |
| "ref_id": null |
| }, |
| { |
| "start": 215, |
| "end": 223, |
| "text": "Figure 2", |
| "ref_id": null |
| }, |
| { |
| "start": 278, |
| "end": 287, |
| "text": "Figure 3)", |
| "ref_id": "FIGREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Crowdsourcing tasks", |
| "sec_num": "6.2.1" |
| }, |
| { |
| "text": "Each sentence in each of the projects is labelled by 10 to 12 workers. We aggregate their result using Dawid-Skene aggregation method (Dawid and Skene, 1979) . It takes into account the dynamically defined reliability of workers. For each example with multiple labels Dawid-Skene method returns the label and its confidence. We use only labels whose confidence is above 90%. The other labels (around 3% of all examples) are later filled by experts.", |
| "cite_spans": [ |
| { |
| "start": 134, |
| "end": 157, |
| "text": "(Dawid and Skene, 1979)", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Crowdsourcing tasks", |
| "sec_num": "6.2.1" |
| }, |
| { |
| "text": "Before admitting users to accomplishing tasks we need make sure they understand them correctly. For that purpose we devise a pipeline of training and exam tasks. First, a user needs to pass training (a set of tasks with a known label and an explanation of the task shown if the user makes a mistake) and exam (same as training, but no explanations are shown). We only admit users whose exam score is above 80%. Similarly, we control their performance with control questions during labelling. We ban users whose performance on these control question is below 70%.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Quality Control", |
| "sec_num": "6.2.2" |
| }, |
| { |
| "text": "Finally, we use other heuristics to control the user performance:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Quality Control", |
| "sec_num": "6.2.2" |
| }, |
| { |
| "text": "\u2022 captcha -prevents workers from using scripts and bots for labelling, \u2022 fast answers -we ban users who accomplish a page of tasks in less than 15 seconds (this usually means that the user is not reading the task and is giving random answers), \u2022 skipped tasks -we ban users who skip 5 or more task pages (this indicates a user who does not understand the task). ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Quality Control", |
| "sec_num": "6.2.2" |
| }, |
| { |
| "text": "In this section, first we present the data, namely the outcome of the shared task on detoxification evaluation. Second, we perform anlysis of correspondance of human and automatic metics. Finally, we conclude with a discussion of assessors's performance and overall difficulty of the task. Table 1 shows the performance of the participating models and our baselines in terms of the automatic metrics. The adversarial example generation turns out to be very effective -it attains the highest scores of all metrics, thus yielding the highest J a score. The next three places in the leaderboard are taken by the models based on our baseline ruT5 system. Notice that the human references are below the majority of models in terms of all metrics except ChrF whose score for the human references is the highest by a large margin. The manual scores (see Table 2 ) provide a completely different result. There, the human references are significantly better than other models, but closely followed by one of ruT5-based systems. However, ruT5-clean (the best-performing participant) is not significantly better than the ruT5 baseline. Interestingly, the adversarial model whose automatic scores are the highest, in fact produces sentences of an very low quality.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 290, |
| "end": 297, |
| "text": "Table 1", |
| "ref_id": "TABREF1" |
| }, |
| { |
| "start": 847, |
| "end": 854, |
| "text": "Table 2", |
| "ref_id": "TABREF3" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Results", |
| "sec_num": "7" |
| }, |
| { |
| "text": "The automatic and manual metrics (Tables 1 and 2) provide very diverse results in terms of participants rankings. This suggests that they are weakly correlated.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 33, |
| "end": 49, |
| "text": "(Tables 1 and 2)", |
| "ref_id": "TABREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Automatic vs Manual Metrics", |
| "sec_num": "7.2" |
| }, |
| { |
| "text": "We check this assumption by computing the Spearman \u03c1 correlations at three different levels: sentence level, system level and system ranking level. At sentence level, we compare automatic metrics for each sentence and then compare them across their manual analogies. For the system level we first compute average scores for each participant and each metric and them uses such vectors of scores to calculate correlations. As for the system ranking level, we use the rank of the system in the ranked system list instead of the scores, which allows to not take the difference of score distributions into account. The last metric is trying to assess the capability of a metric to predict the outcome of a competition.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Automatic vs Manual Metrics", |
| "sec_num": "7.2" |
| }, |
| { |
| "text": "At the system level we compute correlation scores of all metrics. We highlight all high correlations (the absolute value above 0.6) in Table 4 . We clearly see that none of automatic metrics correlate with their manually measured counterparts. On the other hand, there is strong negative correlation between the manual style and automatic content preservation score. Moreover, manual content and fluency metrics are correlated with ChrF score. This suggests that ChrF can be used as an automatic evaluation score. On the other hand, ChrF is not sensitive to sentence style, which means that it can be deceived (for example, the trivial Duplicate baseline performs on par with strong T5-based models in terms of ChrF). However, the power of ChrF was also claimed by (Briakou et al., 2021a) .", |
| "cite_spans": [ |
| { |
| "start": 765, |
| "end": 788, |
| "text": "(Briakou et al., 2021a)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 135, |
| "end": 142, |
| "text": "Table 4", |
| "ref_id": "TABREF5" |
| } |
| ], |
| "eq_spans": [], |
| "section": "System Level Correlations", |
| "sec_num": "7.2.1" |
| }, |
| { |
| "text": "We also compute the correlation of rankings of models produced by different metrics using Spearman's \u03c1 correlation. According to Table 5 , we mostly see weak or no correlation. The rankings by automatic metrics of style, content preservation, and fluency do not correlate with their counterparts produced by manual metrics, apart from the correlation of manual metric of style evaluation (STA m ) and automatic metric of content preservation (SIM a ).", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 129, |
| "end": 136, |
| "text": "Table 5", |
| "ref_id": "TABREF7" |
| } |
| ], |
| "eq_spans": [], |
| "section": "System Ranking Level Correlations", |
| "sec_num": "7.2.2" |
| }, |
| { |
| "text": "Despite that ChrF metric counted as more suitable text generation metric for the Russian Language, additionally we computed correlations for other text generation metrics as BLEU (Papineni et al., 2002) , ROUGE-L (Sutherlin et al., 2011) , and BertScore (Zhang et al., 2020a) . The results are presented in the Table 6 . Unexpectedly, ChrF does not correlated at all with the manually computed manual metrics, according to the ranking evaluation. BertScore, ROUGE-L, BLEU demonstrated quite strong correlations with the manual metrics, which are statistically significant in comparison to the ChrF scores. At the same time, from the Table 6 we can conclude that even the highest correlation numbers (0.661) in our case cannot guarantee high-quality prediction of manual metrics, which still requires further manual evaluation steps.", |
| "cite_spans": [ |
| { |
| "start": 179, |
| "end": 202, |
| "text": "(Papineni et al., 2002)", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 205, |
| "end": 237, |
| "text": "ROUGE-L (Sutherlin et al., 2011)", |
| "ref_id": null |
| }, |
| { |
| "start": 254, |
| "end": 275, |
| "text": "(Zhang et al., 2020a)", |
| "ref_id": "BIBREF40" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 311, |
| "end": 318, |
| "text": "Table 6", |
| "ref_id": "TABREF8" |
| }, |
| { |
| "start": 633, |
| "end": 640, |
| "text": "Table 6", |
| "ref_id": "TABREF8" |
| } |
| ], |
| "eq_spans": [], |
| "section": "System Ranking Level Correlations", |
| "sec_num": "7.2.2" |
| }, |
| { |
| "text": "The sentence-level correlations show a slightly different picture. The highest correlation is seen for the style metric, the Spearman \u03c1 score of automatic and manual judgments is 0.418 (moderate correlation). The manual and automatic sentence-level similarity, fluency, and joint scores show very weak or no correlation: 0.251, 0.015, and 0.141, respectively.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence-level Correlations", |
| "sec_num": "7.2.3" |
| }, |
| { |
| "text": "However, sentence-level correlations between corresponding manual and automatic metrics differ significantly across models (see Figure 4) . We see that automatic and manual toxicity scores are much better correlated for the Delete and RoBERTareplace models, which are the only models to explicitly remove or replace toxic words identified by a classifier or via a manually compiled list of toxic words. These models apparently produce texts which are easy to classify correctly. Conversely, adversarial model and human references are the most difficult to classify. The former deliberately \"fools\" the classifier with artificial examples, while the latter contains non-trivial phrases whose level of toxicity is difficult to grasp automatically.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 128, |
| "end": 137, |
| "text": "Figure 4)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Sentence-level Correlations", |
| "sec_num": "7.2.3" |
| }, |
| { |
| "text": "Analogously, the similarity scores are also better correlated for RoBERTa-replace model which leaves the majority of words intact, so for it similarity boils down to word matching. Instead, T5-based models produce non-trivial paraphrases. These T5 outputs are also difficult to correctly classify for fluency, unlike the models based on word replacements (RoBERTa-replace and Delete). Overall, we see that it is more difficult to correctly classify better-performing models and models based on large pre-trained language models. This suggests that the automatic evaluation might fail exactly where we need it most, i.e. in discriminating between the good models.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Sentence-level Correlations", |
| "sec_num": "7.2.3" |
| }, |
| { |
| "text": "While in many works the human evaluation is considered as undoubtedly reliable, we notice that this is not always true. Human evaluation can suffer from: (i) the low reliability of crowd workers and (ii) the difficulty and subjectivity of the tasks.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Assessors Performance", |
| "sec_num": "7.3" |
| }, |
| { |
| "text": "In crowdsourcing experiments, it is common to give each example for labelling to 3-5 people and aggregate the labels. It our case 3 annotations per sample were not enough. They yielded a labelling with around 10% mistakes. Thus, we collected 10 annotations per sample. Such labelling was more reliable: the error rate did not exceed 3% for style and content and 6% for fluency.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Assessors Performance", |
| "sec_num": "7.3" |
| }, |
| { |
| "text": "To measure the difficulty of the task, we compute inter-annotator agreement coefficient Krippendorff's alpha (Krippendorff, 2011) . It turns out that the agreement is moderate: content: 0.522, 0.448, and 0.394 for style, content, and fluency, respectively. The expert Krippendorff's alpha scores are close: 0.584, 0.458, and 0.463. This confirms that in the experiment with 10 annotations per example the crowd workers are reliable enough, but the task itself is subjective.", |
| "cite_spans": [ |
| { |
| "start": 109, |
| "end": 129, |
| "text": "(Krippendorff, 2011)", |
| "ref_id": "BIBREF13" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Assessors Performance", |
| "sec_num": "7.3" |
| }, |
| { |
| "text": "Interestingly, the style evaluation gains the highest inter-annotator agreement, just as it had the highest correlation between the manual and the automatic labelling. This suggests that that toxicity is more stable and better interpreted by both humans and models.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Assessors Performance", |
| "sec_num": "7.3" |
| }, |
| { |
| "text": "We conducted an evaluation of detoxification models for Russian using both automatic and manual metrics. This allowed us to analyse the relationship between the metrics and assess the suitability of automatic metrics for evaluation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "Our analysis shows that the metrics are overall weakly correlated with the human judgements both at the system and the sentence level. We found that ChrF score has a strong correlation with the joint score of style, content, and fluency. Thus, ChrF could be used as a proxy for manual evaluation, but its lack of correlation with the style score makes this metric vulnerable to attacks. At the system ranking level BertScore metric yielded the best correlation with human judgements.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "We also discovered that the correlation of manual and automatic scores varies for different models. This shows the necessity to consider diverse style transfer models for metrics analysis.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "Overall, although the state-of-the-art evaluation setup for detoxification task (three parameters and the joint score combined from them) is conceptually correct, the current performance of automatic metrics is insufficient to use it as a replacement for manual evaluation. A worse thing is that the automatic metrics produce less reliable for betterperforming models, thus blocking the advance of style transfer models.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "https://www.dialog-21.ru/evaluation/2022/russe 2 Style transfer task can be generalized for S with more than two styles or for continuous styles. We use the binary case for simplicity.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "https://russe.nlpub.org/2022/tox 4 https://toloka.yandex.ru/en", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "https://huggingface.co/sberbank-ai/ruT5-base", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "https://sberbank-ai.github.io/ru-prompts 7 https://huggingface.co/konodyuk/prompt_rugpt3large _detox_russe 8 https://huggingface.co/sberbank-ai/ruT5-base 9 https://huggingface.co/DeepPavlov/rubert-base-casedconversational", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "https://huggingface.co/sberbank-ai/rugpt3xl 11 https://huggingface.co/sberbank-ai/ruRoberta-large 12 https://huggingface.co/sberbank-ai/ruT5-large 13 https://huggingface.co/sberbank-ai/rugpt3xl", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "This work was supported by MTS-Skoltech laboratory on AI.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgements", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Evaluating the evaluation metrics for style transfer: A case study in multilingual formality transfer", |
| "authors": [ |
| { |
| "first": "Eleftheria", |
| "middle": [], |
| "last": "Briakou", |
| "suffix": "" |
| }, |
| { |
| "first": "Sweta", |
| "middle": [], |
| "last": "Agrawal", |
| "suffix": "" |
| }, |
| { |
| "first": "Joel", |
| "middle": [], |
| "last": "Tetreault", |
| "suffix": "" |
| }, |
| { |
| "first": "Marine", |
| "middle": [], |
| "last": "Carpuat", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "1321--1336", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.emnlp-main.100" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Eleftheria Briakou, Sweta Agrawal, Joel Tetreault, and Marine Carpuat. 2021a. Evaluating the evaluation metrics for style transfer: A case study in multilin- gual formality transfer. In Proceedings of the 2021 Conference on Empirical Methods in Natural Lan- guage Processing, pages 1321-1336, Online and Punta Cana, Dominican Republic. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Ol\u00e1, bonjour, salve! XFORMAL: A benchmark for multilingual formality style transfer", |
| "authors": [ |
| { |
| "first": "Eleftheria", |
| "middle": [], |
| "last": "Briakou", |
| "suffix": "" |
| }, |
| { |
| "first": "Di", |
| "middle": [], |
| "last": "Lu", |
| "suffix": "" |
| }, |
| { |
| "first": "Ke", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Joel", |
| "middle": [], |
| "last": "Tetreault", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", |
| "volume": "", |
| "issue": "", |
| "pages": "3199--3216", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.naacl-main.256" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Eleftheria Briakou, Di Lu, Ke Zhang, and Joel Tetreault. 2021b. Ol\u00e1, bonjour, salve! XFORMAL: A bench- mark for multilingual formality style transfer. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, pages 3199-3216, Online. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Semi-supervised formality style transfer using language model discriminator and mutual information maximization", |
| "authors": [ |
| { |
| "first": "Kunal", |
| "middle": [], |
| "last": "Chawla", |
| "suffix": "" |
| }, |
| { |
| "first": "Diyi", |
| "middle": [], |
| "last": "Yang", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Findings of the Association for Computational Linguistics: EMNLP 2020", |
| "volume": "", |
| "issue": "", |
| "pages": "2340--2354", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.findings-emnlp.212" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kunal Chawla and Diyi Yang. 2020. Semi-supervised formality style transfer using language model dis- criminator and mutual information maximization. In Findings of the Association for Computational Lin- guistics: EMNLP 2020, pages 2340-2354, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Contextual text style transfer", |
| "authors": [ |
| { |
| "first": "Yu", |
| "middle": [], |
| "last": "Cheng", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhe", |
| "middle": [], |
| "last": "Gan", |
| "suffix": "" |
| }, |
| { |
| "first": "Yizhe", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Oussama", |
| "middle": [], |
| "last": "Elachqar", |
| "suffix": "" |
| }, |
| { |
| "first": "Dianqi", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Jingjing", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Findings of the Association for Computational Linguistics: EMNLP 2020", |
| "volume": "", |
| "issue": "", |
| "pages": "2915--2924", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.findings-emnlp.263" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yu Cheng, Zhe Gan, Yizhe Zhang, Oussama Elachqar, Dianqi Li, and Jingjing Liu. 2020. Contextual text style transfer. In Findings of the Association for Com- putational Linguistics: EMNLP 2020, pages 2915- 2924, Online. Association for Computational Lin- guistics.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Maximum likelihood estimation of observer errorrates using the em algorithm", |
| "authors": [ |
| { |
| "first": "Alexander", |
| "middle": [], |
| "last": "Philip Dawid", |
| "suffix": "" |
| }, |
| { |
| "first": "Allan M", |
| "middle": [], |
| "last": "Skene", |
| "suffix": "" |
| } |
| ], |
| "year": 1979, |
| "venue": "Journal of the Royal Statistical Society: Series C (Applied Statistics)", |
| "volume": "28", |
| "issue": "1", |
| "pages": "20--28", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alexander Philip Dawid and Allan M Skene. 1979. Maximum likelihood estimation of observer error- rates using the em algorithm. Journal of the Royal Statistical Society: Series C (Applied Statistics), 28(1):20-28.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "RUSSE-2022: Findings of the First Russian Detoxification Task Based on Parallel Corpora", |
| "authors": [ |
| { |
| "first": "Daryna", |
| "middle": [], |
| "last": "Dementieva", |
| "suffix": "" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Nikishina", |
| "suffix": "" |
| }, |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "" |
| }, |
| { |
| "first": "Alena", |
| "middle": [], |
| "last": "Fenogenova", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Dale", |
| "suffix": "" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Krotova", |
| "suffix": "" |
| }, |
| { |
| "first": "Nikita", |
| "middle": [], |
| "last": "Semenov", |
| "suffix": "" |
| }, |
| { |
| "first": "Tatiana", |
| "middle": [], |
| "last": "Shavrina", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexander", |
| "middle": [], |
| "last": "Panchenko", |
| "suffix": "" |
| } |
| ], |
| "year": 2022, |
| "venue": "Computational Linguistics and Intellectual Technologies: papers from the Annual conference \"Dialogue", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daryna Dementieva, Irina Nikishina, Varvara Lo- gacheva, Alena Fenogenova, David Dale, Irina Kro- tova, Nikita Semenov, Tatiana Shavrina, and Alexan- der Panchenko. 2022. RUSSE-2022: Findings of the First Russian Detoxification Task Based on Parallel Corpora. In Computational Linguistics and Intellec- tual Technologies: papers from the Annual confer- ence \"Dialogue\".", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Language-agnostic BERT sentence embedding. CoRR, abs", |
| "authors": [ |
| { |
| "first": "Fangxiaoyu", |
| "middle": [], |
| "last": "Feng", |
| "suffix": "" |
| }, |
| { |
| "first": "Yinfei", |
| "middle": [], |
| "last": "Yang", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Cer", |
| "suffix": "" |
| }, |
| { |
| "first": "Naveen", |
| "middle": [], |
| "last": "Arivazhagan", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fangxiaoyu Feng, Yinfei Yang, Daniel Cer, Naveen Ari- vazhagan, and Wei Wang. 2020. Language-agnostic BERT sentence embedding. CoRR, abs/2007.01852.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "NAST: A non-autoregressive generator with word alignment for unsupervised text style transfer", |
| "authors": [ |
| { |
| "first": "Fei", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "Zikai", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Chen", |
| "middle": [ |
| "Henry" |
| ], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Qihan", |
| "middle": [], |
| "last": "Guo", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiaoyan", |
| "middle": [], |
| "last": "Zhu", |
| "suffix": "" |
| }, |
| { |
| "first": "Minlie", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021", |
| "volume": "", |
| "issue": "", |
| "pages": "1577--1590", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.findings-acl.138" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fei Huang, Zikai Chen, Chen Henry Wu, Qihan Guo, Xiaoyan Zhu, and Minlie Huang. 2021. NAST: A non-autoregressive generator with word alignment for unsupervised text style transfer. In Findings of the Association for Computational Linguistics: ACL- IJCNLP 2021, pages 1577-1590, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Disentangled representation learning for non-parallel text style transfer", |
| "authors": [ |
| { |
| "first": "Vineet", |
| "middle": [], |
| "last": "John", |
| "suffix": "" |
| }, |
| { |
| "first": "Lili", |
| "middle": [], |
| "last": "Mou", |
| "suffix": "" |
| }, |
| { |
| "first": "Hareesh", |
| "middle": [], |
| "last": "Bahuleyan", |
| "suffix": "" |
| }, |
| { |
| "first": "Olga", |
| "middle": [], |
| "last": "Vechtomova", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "424--434", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/P19-1041" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Vineet John, Lili Mou, Hareesh Bahuleyan, and Olga Vechtomova. 2019. Disentangled representation learning for non-parallel text style transfer. In Pro- ceedings of the 57th Annual Meeting of the Associa- tion for Computational Linguistics, pages 424-434, Florence, Italy. Association for Computational Lin- guistics.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Russian language toxic comments", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Kaggle", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "2021--2024", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kaggle. 2019. Russian language toxic comments. https://www.kaggle.com/blackmoon/ russian-language-toxic-comments. Accessed: 2021-03-01.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Toxic russian comments", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Kaggle", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "2021--2024", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kaggle. 2020. Toxic russian comments. https:// www.kaggle.com/alexandersemiletov/ toxic-russian-comments. Accessed: 2021-03-01.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Sentence-level fluency evaluation: References help, but can be spared!", |
| "authors": [ |
| { |
| "first": "Katharina", |
| "middle": [], |
| "last": "Kann", |
| "suffix": "" |
| }, |
| { |
| "first": "Sascha", |
| "middle": [], |
| "last": "Rothe", |
| "suffix": "" |
| }, |
| { |
| "first": "Katja", |
| "middle": [], |
| "last": "Filippova", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the 22nd Conference on Computational Natural Language Learning", |
| "volume": "", |
| "issue": "", |
| "pages": "313--323", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/K18-1031" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Katharina Kann, Sascha Rothe, and Katja Filippova. 2018. Sentence-level fluency evaluation: References help, but can be spared! In Proceedings of the 22nd Conference on Computational Natural Lan- guage Learning, pages 313-323, Brussels, Belgium. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Continuous prompt tuning for russian: how to learn prompts efficiently with rugpt3?", |
| "authors": [ |
| { |
| "first": "Nikita", |
| "middle": [], |
| "last": "Konodyuk", |
| "suffix": "" |
| }, |
| { |
| "first": "Maria", |
| "middle": [], |
| "last": "Tikhonova", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the International Conference on Analysis of Images, Social Networks and Texts", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nikita Konodyuk and Maria Tikhonova. 2021. Continu- ous prompt tuning for russian: how to learn prompts efficiently with rugpt3? In Proceedings of the Inter- national Conference on Analysis of Images, Social Networks and Texts.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Computing krippendorff's alpha-reliability", |
| "authors": [ |
| { |
| "first": "Klaus", |
| "middle": [], |
| "last": "Krippendorff", |
| "suffix": "" |
| } |
| ], |
| "year": 2011, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Klaus Krippendorff. 2011. Computing krippendorff's alpha-reliability.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Reformulating unsupervised style transfer as paraphrase generation", |
| "authors": [ |
| { |
| "first": "Kalpesh", |
| "middle": [], |
| "last": "Krishna", |
| "suffix": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Wieting", |
| "suffix": "" |
| }, |
| { |
| "first": "Mohit", |
| "middle": [], |
| "last": "Iyyer", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "737--762", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.emnlp-main.55" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kalpesh Krishna, John Wieting, and Mohit Iyyer. 2020. Reformulating unsupervised style transfer as para- phrase generation. In Proceedings of the 2020 Con- ference on Empirical Methods in Natural Language Processing (EMNLP), pages 737-762, Online. Asso- ciation for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Adaptation of deep bidirectional multilingual transformers for russian language", |
| "authors": [ |
| { |
| "first": "Yuri", |
| "middle": [], |
| "last": "Kuratov", |
| "suffix": "" |
| }, |
| { |
| "first": "Mikhail", |
| "middle": [], |
| "last": "Arkhipov", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yuri Kuratov and Mikhail Arkhipov. 2019. Adaptation of deep bidirectional multilingual transformers for russian language.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Generic resources are what you need: Style transfer tasks without task-specific parallel training data", |
| "authors": [ |
| { |
| "first": "Huiyuan", |
| "middle": [], |
| "last": "Lai", |
| "suffix": "" |
| }, |
| { |
| "first": "Antonio", |
| "middle": [], |
| "last": "Toral", |
| "suffix": "" |
| }, |
| { |
| "first": "Malvina", |
| "middle": [], |
| "last": "Nissim", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "4241--4254", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.emnlp-main.349" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Huiyuan Lai, Antonio Toral, and Malvina Nissim. 2021a. Generic resources are what you need: Style transfer tasks without task-specific parallel training data. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 4241-4254, Online and Punta Cana, Domini- can Republic. Association for Computational Lin- guistics.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Thank you BART! rewarding pre-trained models improves formality style transfer", |
| "authors": [ |
| { |
| "first": "Huiyuan", |
| "middle": [], |
| "last": "Lai", |
| "suffix": "" |
| }, |
| { |
| "first": "Antonio", |
| "middle": [], |
| "last": "Toral", |
| "suffix": "" |
| }, |
| { |
| "first": "Malvina", |
| "middle": [], |
| "last": "Nissim", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing", |
| "volume": "2", |
| "issue": "", |
| "pages": "484--494", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.acl-short.62" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Huiyuan Lai, Antonio Toral, and Malvina Nissim. 2021b. Thank you BART! rewarding pre-trained models improves formality style transfer. In Proceed- ings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 2: Short Papers), pages 484-494, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "Enhancing content preservation in text style transfer using reverse attention and conditional 99 layer normalization", |
| "authors": [ |
| { |
| "first": "Dongkyu", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhiliang", |
| "middle": [], |
| "last": "Tian", |
| "suffix": "" |
| }, |
| { |
| "first": "Lanqing", |
| "middle": [], |
| "last": "Xue", |
| "suffix": "" |
| }, |
| { |
| "first": "Nevin", |
| "middle": [ |
| "L" |
| ], |
| "last": "Zhang", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing", |
| "volume": "1", |
| "issue": "", |
| "pages": "93--102", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.acl-long.8" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dongkyu Lee, Zhiliang Tian, Lanqing Xue, and Nevin L. Zhang. 2021. Enhancing content preservation in text style transfer using reverse attention and conditional 99 layer normalization. In Proceedings of the 59th An- nual Meeting of the Association for Computational Linguistics and the 11th International Joint Confer- ence on Natural Language Processing (Volume 1: Long Papers), pages 93-102, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Domain adaptive text style transfer", |
| "authors": [ |
| { |
| "first": "Dianqi", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Yizhe", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Zhe", |
| "middle": [], |
| "last": "Gan", |
| "suffix": "" |
| }, |
| { |
| "first": "Yu", |
| "middle": [], |
| "last": "Cheng", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Brockett", |
| "suffix": "" |
| }, |
| { |
| "first": "Bill", |
| "middle": [], |
| "last": "Dolan", |
| "suffix": "" |
| }, |
| { |
| "first": "Ming-Ting", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "3304--3313", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/D19-1325" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dianqi Li, Yizhe Zhang, Zhe Gan, Yu Cheng, Chris Brockett, Bill Dolan, and Ming-Ting Sun. 2019. Do- main adaptive text style transfer. In Proceedings of the 2019 Conference on Empirical Methods in Natu- ral Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3304-3313, Hong Kong, China. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "Delete, retrieve, generate: a simple approach to sentiment and style transfer", |
| "authors": [ |
| { |
| "first": "Juncen", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| }, |
| { |
| "first": "Robin", |
| "middle": [], |
| "last": "Jia", |
| "suffix": "" |
| }, |
| { |
| "first": "He", |
| "middle": [], |
| "last": "He", |
| "suffix": "" |
| }, |
| { |
| "first": "Percy", |
| "middle": [], |
| "last": "Liang", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", |
| "volume": "1", |
| "issue": "", |
| "pages": "1865--1874", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/N18-1169" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Juncen Li, Robin Jia, He He, and Percy Liang. 2018. Delete, retrieve, generate: a simple approach to senti- ment and style transfer. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 1865-1874, New Orleans, Louisiana. Associa- tion for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "Learning to generate multiple style transfer outputs for an input sentence", |
| "authors": [ |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Lin", |
| "suffix": "" |
| }, |
| { |
| "first": "Ming-Yu", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Ming-Ting", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the Fourth Workshop on Neural Generation and Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "10--23", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.ngt-1.2" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kevin Lin, Ming-Yu Liu, Ming-Ting Sun, and Jan Kautz. 2020. Learning to generate multiple style transfer outputs for an input sentence. In Proceedings of the Fourth Workshop on Neural Generation and Transla- tion, pages 10-23, Online. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "ParaDetox: Detoxification with Parallel Data", |
| "authors": [ |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "" |
| }, |
| { |
| "first": "Daryna", |
| "middle": [], |
| "last": "Dementieva", |
| "suffix": "" |
| }, |
| { |
| "first": "Sergey", |
| "middle": [], |
| "last": "Ustyantsev", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniil", |
| "middle": [], |
| "last": "Moskovskiy", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Dale", |
| "suffix": "" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Krotova", |
| "suffix": "" |
| }, |
| { |
| "first": "Nikita", |
| "middle": [], |
| "last": "Semenov", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexander", |
| "middle": [], |
| "last": "Panchenko", |
| "suffix": "" |
| } |
| ], |
| "year": 2022, |
| "venue": "Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "1", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Varvara Logacheva, Daryna Dementieva, Sergey Ustyantsev, Daniil Moskovskiy, David Dale, Irina Krotova, Nikita Semenov, and Alexander Panchenko. 2022. ParaDetox: Detoxification with Parallel Data. In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Dublin, Ireland. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "Collaborative learning of bidirectional decoders for unsupervised text style transfer", |
| "authors": [ |
| { |
| "first": "Yun", |
| "middle": [], |
| "last": "Ma", |
| "suffix": "" |
| }, |
| { |
| "first": "Yangbin", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Xudong", |
| "middle": [], |
| "last": "Mao", |
| "suffix": "" |
| }, |
| { |
| "first": "Qing", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "9250--9266", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.emnlp-main.729" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yun Ma, Yangbin Chen, Xudong Mao, and Qing Li. 2021. Collaborative learning of bidirectional de- coders for unsupervised text style transfer. In Pro- ceedings of the 2021 Conference on Empirical Meth- ods in Natural Language Processing, pages 9250- 9266, Online and Punta Cana, Dominican Republic. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "Politeness transfer: A tag and generate approach", |
| "authors": [ |
| { |
| "first": "Aman", |
| "middle": [], |
| "last": "Madaan", |
| "suffix": "" |
| }, |
| { |
| "first": "Amrith", |
| "middle": [], |
| "last": "Setlur", |
| "suffix": "" |
| }, |
| { |
| "first": "Tanmay", |
| "middle": [], |
| "last": "Parekh", |
| "suffix": "" |
| }, |
| { |
| "first": "Barnabas", |
| "middle": [], |
| "last": "Poczos", |
| "suffix": "" |
| }, |
| { |
| "first": "Graham", |
| "middle": [], |
| "last": "Neubig", |
| "suffix": "" |
| }, |
| { |
| "first": "Yiming", |
| "middle": [], |
| "last": "Yang", |
| "suffix": "" |
| }, |
| { |
| "first": "Ruslan", |
| "middle": [], |
| "last": "Salakhutdinov", |
| "suffix": "" |
| }, |
| { |
| "first": "Alan", |
| "middle": [ |
| "W" |
| ], |
| "last": "Black", |
| "suffix": "" |
| }, |
| { |
| "first": "Shrimai", |
| "middle": [], |
| "last": "Prabhumoye", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "1869--1881", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.acl-main.169" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Aman Madaan, Amrith Setlur, Tanmay Parekh, Barn- abas Poczos, Graham Neubig, Yiming Yang, Ruslan Salakhutdinov, Alan W Black, and Shrimai Prabhu- moye. 2020. Politeness transfer: A tag and generate approach. In Proceedings of the 58th Annual Meet- ing of the Association for Computational Linguistics, pages 1869-1881, Online. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "Unsupervised text style transfer with padded masked language models", |
| "authors": [ |
| { |
| "first": "Eric", |
| "middle": [], |
| "last": "Malmi", |
| "suffix": "" |
| }, |
| { |
| "first": "Aliaksei", |
| "middle": [], |
| "last": "Severyn", |
| "suffix": "" |
| }, |
| { |
| "first": "Sascha", |
| "middle": [], |
| "last": "Rothe", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "8671--8680", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.emnlp-main.699" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Eric Malmi, Aliaksei Severyn, and Sascha Rothe. 2020. Unsupervised text style transfer with padded masked language models. In Proceedings of the 2020 Con- ference on Empirical Methods in Natural Language Processing (EMNLP), pages 8671-8680, Online. As- sociation for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF26": { |
| "ref_id": "b26", |
| "title": "Unsupervised evaluation metrics and learning criteria for non-parallel textual transfer", |
| "authors": [ |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Richard Yuanzhe Pang", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Gimpel", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proceedings of the 3rd Workshop on Neural Generation and Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "138--147", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/D19-5614" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Richard Yuanzhe Pang and Kevin Gimpel. 2019. Un- supervised evaluation metrics and learning criteria for non-parallel textual transfer. In Proceedings of the 3rd Workshop on Neural Generation and Trans- lation, pages 138-147, Hong Kong. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "Bleu: a method for automatic evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Kishore", |
| "middle": [], |
| "last": "Papineni", |
| "suffix": "" |
| }, |
| { |
| "first": "Salim", |
| "middle": [], |
| "last": "Roukos", |
| "suffix": "" |
| }, |
| { |
| "first": "Todd", |
| "middle": [], |
| "last": "Ward", |
| "suffix": "" |
| }, |
| { |
| "first": "Wei-Jing", |
| "middle": [], |
| "last": "Zhu", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "311--318", |
| "other_ids": { |
| "DOI": [ |
| "10.3115/1073083.1073135" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei- Jing Zhu. 2002. Bleu: a method for automatic evalu- ation of machine translation. In Proceedings of the 40th Annual Meeting of the Association for Compu- tational Linguistics, July 6-12, 2002, Philadelphia, PA, USA, pages 311-318. ACL.", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "chrF: character n-gram F-score for automatic MT evaluation", |
| "authors": [ |
| { |
| "first": "Maja", |
| "middle": [], |
| "last": "Popovi\u0107", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the Tenth Workshop on Statistical Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "392--395", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/W15-3049" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Maja Popovi\u0107. 2015. chrF: character n-gram F-score for automatic MT evaluation. In Proceedings of the Tenth Workshop on Statistical Machine Translation, pages 392-395, Lisbon, Portugal. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "Language models are unsupervised multitask learners", |
| "authors": [ |
| { |
| "first": "Alec", |
| "middle": [], |
| "last": "Radford", |
| "suffix": "" |
| }, |
| { |
| "first": "Jeffrey", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Rewon", |
| "middle": [], |
| "last": "Child", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Luan", |
| "suffix": "" |
| }, |
| { |
| "first": "Dario", |
| "middle": [], |
| "last": "Amodei", |
| "suffix": "" |
| }, |
| { |
| "first": "Ilya", |
| "middle": [], |
| "last": "Sutskever", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "OpenAI blog", |
| "volume": "1", |
| "issue": "8", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, Ilya Sutskever, et al. 2019. Language models are unsupervised multitask learners. OpenAI blog, 1(8):9.", |
| "links": null |
| }, |
| "BIBREF30": { |
| "ref_id": "b30", |
| "title": "LEWIS: Levenshtein editing for unsupervised text style transfer", |
| "authors": [ |
| { |
| "first": "Machel", |
| "middle": [], |
| "last": "Reid", |
| "suffix": "" |
| }, |
| { |
| "first": "Victor", |
| "middle": [], |
| "last": "Zhong", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021", |
| "volume": "", |
| "issue": "", |
| "pages": "3932--3944", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.findings-acl.344" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Machel Reid and Victor Zhong. 2021. LEWIS: Lev- enshtein editing for unsupervised text style transfer. In Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021, pages 3932-3944, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF31": { |
| "ref_id": "b31", |
| "title": "TextSETTR: Few-shot text style extraction and tunable targeted restyling", |
| "authors": [ |
| { |
| "first": "Parker", |
| "middle": [], |
| "last": "Riley", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah", |
| "middle": [], |
| "last": "Constant", |
| "suffix": "" |
| }, |
| { |
| "first": "Mandy", |
| "middle": [], |
| "last": "Guo", |
| "suffix": "" |
| }, |
| { |
| "first": "Girish", |
| "middle": [], |
| "last": "Kumar", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Uthus", |
| "suffix": "" |
| }, |
| { |
| "first": "Zarana", |
| "middle": [], |
| "last": "Parekh", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 59th", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.acl-long.293" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Parker Riley, Noah Constant, Mandy Guo, Girish Kumar, David Uthus, and Zarana Parekh. 2021. TextSETTR: Few-shot text style extraction and tun- able targeted restyling. In Proceedings of the 59th", |
| "links": null |
| }, |
| "BIBREF32": { |
| "ref_id": "b32", |
| "title": "Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing", |
| "authors": [], |
| "year": null, |
| "venue": "", |
| "volume": "1", |
| "issue": "", |
| "pages": "3786--3800", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Confer- ence on Natural Language Processing (Volume 1: Long Papers), pages 3786-3800, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF34": { |
| "ref_id": "b34", |
| "title": "transforming\" delete, retrieve, generate approach for controlled text style transfer", |
| "authors": [ |
| { |
| "first": "Akhilesh", |
| "middle": [], |
| "last": "Sudhakar", |
| "suffix": "" |
| }, |
| { |
| "first": "Bhargav", |
| "middle": [], |
| "last": "Upadhyay", |
| "suffix": "" |
| }, |
| { |
| "first": "Arjun", |
| "middle": [], |
| "last": "Maheswaran", |
| "suffix": "" |
| } |
| ], |
| "year": 2019, |
| "venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)", |
| "volume": "", |
| "issue": "", |
| "pages": "3269--3279", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/D19-1322" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Akhilesh Sudhakar, Bhargav Upadhyay, and Arjun Ma- heswaran. 2019. \"transforming\" delete, retrieve, gen- erate approach for controlled text style transfer. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Lan- guage Processing (EMNLP-IJCNLP), pages 3269- 3279, Hong Kong, China. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF35": { |
| "ref_id": "b35", |
| "title": "Lexically constrained neural machine translation with Levenshtein transformer", |
| "authors": [ |
| { |
| "first": "Raymond Hendy", |
| "middle": [], |
| "last": "Susanto", |
| "suffix": "" |
| }, |
| { |
| "first": "Shamil", |
| "middle": [], |
| "last": "Chollampatt", |
| "suffix": "" |
| }, |
| { |
| "first": "Liling", |
| "middle": [], |
| "last": "Tan", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "3536--3543", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.acl-main.325" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Raymond Hendy Susanto, Shamil Chollampatt, and Lil- ing Tan. 2020. Lexically constrained neural machine translation with Levenshtein transformer. In Proceed- ings of the 58th Annual Meeting of the Association for Computational Linguistics, pages 3536-3543, On- line. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF36": { |
| "ref_id": "b36", |
| "title": "Discovery of a potent, selective, and orally available class i phosphatidylinositol 3-kinase (pi3k)/mammalian target of rapamycin (mtor) kinase inhibitor (gdc-0980) for the treatment of cancer", |
| "authors": [ |
| { |
| "first": "Linda", |
| "middle": [], |
| "last": "Daniel P Sutherlin", |
| "suffix": "" |
| }, |
| { |
| "first": "Megan", |
| "middle": [], |
| "last": "Bao", |
| "suffix": "" |
| }, |
| { |
| "first": "Georgette", |
| "middle": [], |
| "last": "Berry", |
| "suffix": "" |
| }, |
| { |
| "first": "Irina", |
| "middle": [], |
| "last": "Castanedo", |
| "suffix": "" |
| }, |
| { |
| "first": "Jenna", |
| "middle": [], |
| "last": "Chuckowree", |
| "suffix": "" |
| }, |
| { |
| "first": "Adrian", |
| "middle": [], |
| "last": "Dotson", |
| "suffix": "" |
| }, |
| { |
| "first": "Lori", |
| "middle": [], |
| "last": "Folks", |
| "suffix": "" |
| }, |
| { |
| "first": "Richard", |
| "middle": [], |
| "last": "Friedman", |
| "suffix": "" |
| }, |
| { |
| "first": "Janet", |
| "middle": [], |
| "last": "Goldsmith", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Gunzner", |
| "suffix": "" |
| } |
| ], |
| "year": 2011, |
| "venue": "Journal of medicinal chemistry", |
| "volume": "54", |
| "issue": "21", |
| "pages": "7579--7587", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daniel P Sutherlin, Linda Bao, Megan Berry, Georgette Castanedo, Irina Chuckowree, Jenna Dotson, Adrian Folks, Lori Friedman, Richard Goldsmith, Janet Gun- zner, et al. 2011. Discovery of a potent, selective, and orally available class i phosphatidylinositol 3-kinase (pi3k)/mammalian target of rapamycin (mtor) kinase inhibitor (gdc-0980) for the treatment of cancer. Jour- nal of medicinal chemistry, 54(21):7579-7587.", |
| "links": null |
| }, |
| "BIBREF37": { |
| "ref_id": "b37", |
| "title": "Neural network acceptability judgments", |
| "authors": [ |
| { |
| "first": "Alex", |
| "middle": [], |
| "last": "Warstadt", |
| "suffix": "" |
| }, |
| { |
| "first": "Amanpreet", |
| "middle": [], |
| "last": "Singh", |
| "suffix": "" |
| }, |
| { |
| "first": "Samuel R", |
| "middle": [], |
| "last": "Bowman", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1805.12471" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alex Warstadt, Amanpreet Singh, and Samuel R Bow- man. 2018. Neural network acceptability judgments. arXiv preprint arXiv:1805.12471.", |
| "links": null |
| }, |
| "BIBREF38": { |
| "ref_id": "b38", |
| "title": "Unpaired sentiment-to-sentiment translation: A cycled reinforcement learning approach", |
| "authors": [ |
| { |
| "first": "Jingjing", |
| "middle": [], |
| "last": "Xu", |
| "suffix": "" |
| }, |
| { |
| "first": "Xu", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| }, |
| { |
| "first": "Qi", |
| "middle": [], |
| "last": "Zeng", |
| "suffix": "" |
| }, |
| { |
| "first": "Xiaodong", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Xuancheng", |
| "middle": [], |
| "last": "Ren", |
| "suffix": "" |
| }, |
| { |
| "first": "Houfeng", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| }, |
| { |
| "first": "Wenjie", |
| "middle": [], |
| "last": "Li", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "1", |
| "issue": "", |
| "pages": "979--988", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/P18-1090" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jingjing Xu, Xu Sun, Qi Zeng, Xiaodong Zhang, Xu- ancheng Ren, Houfeng Wang, and Wenjie Li. 2018. Unpaired sentiment-to-sentiment translation: A cy- cled reinforcement learning approach. In Proceed- ings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 979-988, Melbourne, Australia. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF39": { |
| "ref_id": "b39", |
| "title": "Styletransfer and paraphrase: Looking for a sensible semantic similarity metric", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [], |
| "last": "Ivan", |
| "suffix": "" |
| }, |
| { |
| "first": "Viacheslav", |
| "middle": [], |
| "last": "Yamshchikov", |
| "suffix": "" |
| }, |
| { |
| "first": "Nikolay", |
| "middle": [], |
| "last": "Shibaev", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexey", |
| "middle": [], |
| "last": "Khlebnikov", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tikhonov", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the AAAI Conference on Artificial Intelligence", |
| "volume": "35", |
| "issue": "", |
| "pages": "14213--14220", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ivan P. Yamshchikov, Viacheslav Shibaev, Nikolay Khlebnikov, and Alexey Tikhonov. 2021. Style- transfer and paraphrase: Looking for a sensible se- mantic similarity metric. Proceedings of the AAAI Conference on Artificial Intelligence, 35(16):14213- 14220.", |
| "links": null |
| }, |
| "BIBREF40": { |
| "ref_id": "b40", |
| "title": "Bertscore: Evaluating text generation with BERT", |
| "authors": [ |
| { |
| "first": "Tianyi", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Varsha", |
| "middle": [], |
| "last": "Kishore", |
| "suffix": "" |
| }, |
| { |
| "first": "Felix", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "Kilian", |
| "middle": [ |
| "Q" |
| ], |
| "last": "Weinberger", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoav", |
| "middle": [], |
| "last": "Artzi", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "8th International Conference on Learning Representations", |
| "volume": "2020", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tianyi Zhang, Varsha Kishore, Felix Wu, Kilian Q. Weinberger, and Yoav Artzi. 2020a. Bertscore: Eval- uating text generation with BERT. In 8th Inter- national Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020. OpenReview.net.", |
| "links": null |
| }, |
| "BIBREF41": { |
| "ref_id": "b41", |
| "title": "Parallel data augmentation for formality style transfer", |
| "authors": [ |
| { |
| "first": "Yi", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Tao", |
| "middle": [], |
| "last": "Ge", |
| "suffix": "" |
| }, |
| { |
| "first": "Xu", |
| "middle": [], |
| "last": "Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "3221--3228", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.acl-main.294" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yi Zhang, Tao Ge, and Xu Sun. 2020b. Parallel data augmentation for formality style transfer. In Proceed- ings of the 58th Annual Meeting of the Association for Computational Linguistics, pages 3221-3228, On- line. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF42": { |
| "ref_id": "b42", |
| "title": "Exploring contextual word-level style relevance for unsupervised style transfer", |
| "authors": [ |
| { |
| "first": "Chulun", |
| "middle": [], |
| "last": "Zhou", |
| "suffix": "" |
| }, |
| { |
| "first": "Liangyu", |
| "middle": [], |
| "last": "Chen", |
| "suffix": "" |
| }, |
| { |
| "first": "Jiachen", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Xinyan", |
| "middle": [], |
| "last": "Xiao", |
| "suffix": "" |
| }, |
| { |
| "first": "Jinsong", |
| "middle": [], |
| "last": "Su", |
| "suffix": "" |
| }, |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Guo", |
| "suffix": "" |
| }, |
| { |
| "first": "Hua", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| } |
| ], |
| "year": 2020, |
| "venue": "Proceedings of the 58th", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2020.acl-main.639" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Chulun Zhou, Liangyu Chen, Jiachen Liu, Xinyan Xiao, Jinsong Su, Sheng Guo, and Hua Wu. 2020. Explor- ing contextual word-level style relevance for unsu- pervised style transfer. In Proceedings of the 58th", |
| "links": null |
| }, |
| "BIBREF43": { |
| "ref_id": "b43", |
| "title": "Annual Meeting of the Association for Computational Linguistics", |
| "authors": [], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "7135--7144", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Annual Meeting of the Association for Computational Linguistics, pages 7135-7144, Online. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF44": { |
| "ref_id": "b44", |
| "title": "Multimodal text style transfer for outdoor vision-and-language navigation", |
| "authors": [ |
| { |
| "first": "Wanrong", |
| "middle": [], |
| "last": "Zhu", |
| "suffix": "" |
| }, |
| { |
| "first": "Xin", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| }, |
| { |
| "first": "Tsu-Jui", |
| "middle": [], |
| "last": "Fu", |
| "suffix": "" |
| }, |
| { |
| "first": "An", |
| "middle": [], |
| "last": "Yan", |
| "suffix": "" |
| }, |
| { |
| "first": "Pradyumna", |
| "middle": [], |
| "last": "Narayana", |
| "suffix": "" |
| }, |
| { |
| "first": "Kazoo", |
| "middle": [], |
| "last": "Sone", |
| "suffix": "" |
| }, |
| { |
| "first": "Sugato", |
| "middle": [], |
| "last": "Basu", |
| "suffix": "" |
| }, |
| { |
| "first": "William", |
| "middle": [ |
| "Yang" |
| ], |
| "last": "Wang", |
| "suffix": "" |
| } |
| ], |
| "year": 2021, |
| "venue": "Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume", |
| "volume": "", |
| "issue": "", |
| "pages": "1207--1221", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/2021.eacl-main.103" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Wanrong Zhu, Xin Wang, Tsu-Jui Fu, An Yan, Pradyumna Narayana, Kazoo Sone, Sugato Basu, and William Yang Wang. 2021. Multimodal text style transfer for outdoor vision-and-language navi- gation. In Proceedings of the 16th Conference of the European Chapter of the Association for Computa- tional Linguistics: Main Volume, pages 1207-1221, Online. Association for Computational Linguistics.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "num": null, |
| "uris": null, |
| "type_str": "figure", |
| "text": "Interface of the toxicity detection task. Do these sentences mean the same? I don't f*ckin care about that shit Yes I don't care about that No Interface of the content similarity task. Is this text grammatical? YES, there are no or only minor mistakes I don't care about that. NO, the text is difficult to understand PARTIALLY, there are mistakes, but the text is intelligible" |
| }, |
| "FIGREF1": { |
| "num": null, |
| "uris": null, |
| "type_str": "figure", |
| "text": "Interface of the fluency evaluation task." |
| }, |
| "TABREF1": { |
| "content": "<table/>", |
| "num": null, |
| "type_str": "table", |
| "text": "The performance of the participating models in terms of automatic metrics, sorted by J a metric.", |
| "html": null |
| }, |
| "TABREF3": { |
| "content": "<table><tr><td>Metric STAa</td><td>SIMa</td><td>FLa</td><td>Ja</td><td>ChrF</td></tr><tr><td colspan=\"5\">STAm SIMm -0.046 0.376 -0.776 -0.398 0.278 0.223 0.031 0.190 0.000 0.789 FLm -0.083 -0.032 0.288 0.070 0.619 Jm 0.326 -0.495 -0.211 0.350 0.735</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "text": "Manual evaluation of the participating models, the models are sorted by the J m metric. The figures in bold show the highest value of the metric with the significance level of \u03b1 = 0.05.", |
| "html": null |
| }, |
| "TABREF4": { |
| "content": "<table><tr><td>Metric STAa</td><td>SIMa</td><td>FLa</td><td>Ja</td><td>ChrF</td></tr><tr><td colspan=\"5\">STAm SIMm -0.305 -0.153 -0.042 -0.431 0.276 0.695 -0.888 -0.398 0.305 0.264 FLm -0.237 -0.291 -0.116 -0.425 0.218 Jm 0.595 -0.746 -0.380 0.278 0.367</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "text": "Spearman's correlation coefficient between automatic VS manual metrics on system level. Bold numbers denote the statistically significant correlation (p-value \u2264 0.05).", |
| "html": null |
| }, |
| "TABREF5": { |
| "content": "<table><tr><td>: Pearson's correlation coefficient between auto-matic VS manual metrics on system level. Bold num-bers denote the statistically significant correlation (p-value \u2264 0.05).</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "text": "", |
| "html": null |
| }, |
| "TABREF7": { |
| "content": "<table><tr><td colspan=\"4\">: Spearman's correlation coefficient between au-tomatic VS manual metrics based on system ranking. Bold numbers denote the statistically significant corre-lation (p-value \u2264 0.05).</td></tr><tr><td colspan=\"3\">Metric BertScore ROUGE-L BLEU</td><td>ChrF</td></tr><tr><td>STAm SIMm Flm Jm</td><td>-0.710 0.819 0.796 0.661</td><td colspan=\"2\">-0.550 -0.600 -0.296 0.802 0.863 0.495 0.675 0.700 0.464 0.657 0.546 0.325</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "text": "", |
| "html": null |
| }, |
| "TABREF8": { |
| "content": "<table><tr><td>: Spearman's correlation coefficient between automatic style transfer VS manual metrics based on system ranking. Bold numbers denote the statistically significant correlation (p-value \u2264 0.05).</td></tr></table>", |
| "num": null, |
| "type_str": "table", |
| "text": "", |
| "html": null |
| } |
| } |
| } |
| } |