<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Overview of the CLEF 2022 SimpleText Task 2: Complexity Spotting in Scientific Abstracts</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Liana</forename><surname>Ermakova</surname></persName>
							<email>liana.ermakova@univ-brest.fr</email>
							<affiliation key="aff0">
								<orgName type="institution" key="instit1">Université de Bretagne Occidentale</orgName>
								<orgName type="institution" key="instit2">HCTI</orgName>
								<address>
									<settlement>Brest</settlement>
									<country key="FR">France</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Irina</forename><surname>Ovchinnikov</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">ManPower Language Solution</orgName>
								<address>
									<country key="IL">Israel</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jaap</forename><surname>Kamps</surname></persName>
							<affiliation key="aff2">
								<orgName type="institution">University of Amsterdam</orgName>
								<address>
									<settlement>Amsterdam</settlement>
									<country key="NL">The Netherlands</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Diana</forename><surname>Nurbakova</surname></persName>
							<affiliation key="aff3">
								<orgName type="institution" key="instit1">University of Lyon</orgName>
								<orgName type="institution" key="instit2">INSA Lyon</orgName>
								<orgName type="institution" key="instit3">CNRS</orgName>
								<orgName type="institution" key="instit4">LIRIS</orgName>
								<address>
									<postCode>UMR5205, F-69621</postCode>
									<settlement>Villeurbanne</settlement>
									<country key="FR">France</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Sílvia</forename><surname>Araújo</surname></persName>
							<affiliation key="aff4">
								<orgName type="institution" key="instit1">Universidade do Minho</orgName>
								<orgName type="institution" key="instit2">CEHUM</orgName>
								<address>
									<postCode>4710-057</postCode>
									<settlement>Braga</settlement>
									<country key="PT">Portugal</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Radia</forename><surname>Hannachi</surname></persName>
							<affiliation key="aff5">
								<orgName type="institution" key="instit1">Université de Bretagne Sud</orgName>
								<orgName type="institution" key="instit2">HCTI</orgName>
								<address>
									<postCode>56321</postCode>
									<settlement>Lorient</settlement>
									<country key="FR">France</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff6">
								<orgName type="department">Evaluation Forum</orgName>
								<address>
									<addrLine>September 5-8</addrLine>
									<postCode>2022</postCode>
									<settlement>Bologna</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Overview of the CLEF 2022 SimpleText Task 2: Complexity Spotting in Scientific Abstracts</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">DCBE22246901010854D0F800BB20A3FD</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T03:29+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>automatic text simplification, terminology, background knowledge, scientific article, science popularization, contextualization, term difficulty (L. Ermakova) https://simpletext-project.com/ (L. Ermakova) 0000-0002-7598-7474 (L. Ermakova)</term>
					<term>0000-0003-1726-3360 (I. Ovchinnikov)</term>
					<term>0000-0002-6614-0087 (J. Kamps)</term>
					<term>0000-0002-6620-7771 (D. Nurbakova)</term>
					<term>0000-0003-4321-4511 (S. Araújo)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This paper provides an overview of the Task 2: What is unclear? of the Automatic Simplification of Scientific Texts (SimpleText) lab, run as part of CLEF 2022. The main aim of the SimpleText lab is to promote a more open scientific information access via automatic text simplification. Task 2 focuses on complexity spotting within scientific texts (passage). Thus, the goal is to detect the terms/concepts that require specific background knowledge for understanding of the passage and to assess their complexity for non-experts. Overall, four runs from four different teams have been submitted to this task. In this paper, we describe the data collection, the task setup, and the evaluation procedure. We also give a brief overview of the participating approaches.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Nowadays, scientific literature has become more available to every citizen thanks to digitalisation. However, an important barrier preventing citizens to access the objective scientific knowledge from the original sources remains present. One of the key issues here is a high complexity of scientific texts to non-experts due to the lack of required background knowledge, including the comprehension of terminology. Even for native speakers it is hard to understand the terminology beyond their area of expertise. Nevertheless, a basic set of terms the general public acquired thanks to secondary and college education allows them to comprehend popular science publications. Comprehension of the term presupposes grasping of the concept it refers to without any definition. To understand the concept, we need to involve it in a structured system in our semantic memory that can require more knowledge than we had learned.</p><p>To help readers to stay up-to-date with scientific advances, text simplification can be used. To facilitate the reading, the traditional methods try to eliminate complex concepts and constructions <ref type="bibr" target="#b0">[1]</ref>. However, it is not always possible, especially in the case of scientific literature. Thus, readers of a popular science publication lean on their experience of processing new information and recognize a case when they need definition or clarification of an unfamiliar term since they do not understand its concept.</p><p>To alleviate the lack of background knowledge that can prevent a proper comprehension <ref type="bibr" target="#b1">[2]</ref>, we argue that a simplification method should provide information, essential to understanding of complex scientific concepts. This is one of the objectives of CLEF 2022 SimpleText lab. Despite some recent efforts that have been done in automatic text simplification (e.g. <ref type="bibr" target="#b2">[3]</ref>), improving scientific text comprehensibility and its adaptation to different audiences in an automatic manner remains an open challenge.</p><p>The CLEF 2022 SimpleText track <ref type="foot" target="#foot_0">1</ref> is an open forum for researchers and practitioners working on the automatic generation of simplified summaries of scientific texts. It is a new evaluation lab that follows up the CLEF 2021 SimpleText Workshop <ref type="bibr" target="#b3">[4]</ref>. The track provides data and benchmarks for discussing the challenges of automatic text simplification proposing the following interconnected tasks: Task 1: What is in (or out)? Select passages to include in a simplified summary, given a query.</p><p>Task 2: What is unclear? Given a passage and a query, rank terms/concepts that are required to be explained for understanding this passage (definitions, context, applications,..).</p><p>Task 3: Rewrite this! Given a query, simplify passages from scientific abstracts.</p><p>This paper focuses on the second task of complexity spotting. We refer for details of the other tasks to the overview papers of Task 1 <ref type="bibr" target="#b4">[5]</ref> and Task 3 <ref type="bibr" target="#b5">[6]</ref>, or the Track overview paper <ref type="bibr" target="#b6">[7]</ref>.</p><p>In the CLEF 2022 edition of SimpleText, a total of 62 teams registered for the SimpleText track. A total of 40 users downloaded data from the server. A total of 9 distinct teams submitted 24 runs, of which 10 runs were updated. The details of statistics on runs submitted for shared tasks are presented in Table <ref type="table" target="#tab_0">1</ref>. As it can be seen, four teams participated in Task 2.</p><p>The rest of this paper is structured in the following way. Section 2 presents a brief overview of related works, including other evaluation initiatives, related tasks and related approaches. We provide a detailed description of the task complexity spotting itself, submitted runs, and the evaluation protocol in Section 3. In Section 4, we discuss the results of the official submissions. We end with Section 5 discussing the results and findings, and lessons for the future.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related work</head><p>According to the Cambridge Dictionary <ref type="bibr" target="#b15">[16]</ref>, a term is "a word or expression used in relation to a particular subject, often to describe something official or technical". Almost the same </p><formula xml:id="formula_0">aaac 1 (1 updated) 1 CLARA-HD [8] 1 1 CYUT Team2 [9]</formula><p>1 1 2 HULAT-UC3M <ref type="bibr" target="#b9">[10]</ref> 10 (4 updated) 10 LEA_T5 <ref type="bibr" target="#b10">[11]</ref> 1 1 2 NLP@IISERB <ref type="bibr" target="#b11">[12]</ref> 3 (3 updated) 3 PortLinguE <ref type="bibr" target="#b12">[13]</ref> 1 (1 updated) 1 SimpleScientificText <ref type="bibr" target="#b13">[14]</ref> 1 (1 updated) definition of terms is given by Kaguera and Marshman <ref type="bibr" target="#b16">[17]</ref> describing them as "lexical items that represent concepts of a domain". Thus, terms form the core vocabulary of a specific and specialised domain.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Term Complexity</head><p>Term perception can be rather ambiguous and subjective <ref type="bibr" target="#b17">[18]</ref>, especially when it comes to assess term complexity. Indeed, the discrepancy between basic competence of a reader and professional competence of an author of a scientific article derives the subjective complexity of terminology. The objective complexity of terminology is derived by peculiar characteristics of terminological systems. In this Section, we clarify the objective complexity of terminology caused by complexity of research areas, research traditions and socio-cultural diversity. Terminology belongs to professional and scientific discourse, where there exist so called languages for special purpose. Belonging to the language for special purposes, terminological systems do not share peculiarities of the general lexicon <ref type="bibr" target="#b18">[19]</ref>. A terminological system tends to avoid synonyms and polysemy, but has to provide a term for each concept within a system of concepts of the domain. According to the General Theory of Terminology, which is based on the work of Eugen Wüster (see description in <ref type="bibr" target="#b19">[20]</ref>), terminological systems support univocity (unambiguous match of the term to its concept). This general approach is still relevant in technical communication where professionals (technical writers, translators, etc.) use term banks, e.g. Eurodicautom<ref type="foot" target="#foot_1">2</ref> , Termium<ref type="foot" target="#foot_2">3</ref> , LEXIS <ref type="foot" target="#foot_3">4</ref> [21], Normaterm<ref type="foot" target="#foot_4">5</ref>  <ref type="bibr" target="#b21">[22]</ref>, and the Grand dictionnaire terminologique <ref type="foot" target="#foot_5">6</ref> (formerly the Banque de terminologie du Québec). In academia, this approach is mostly applied to terminological systems in Science and Computer Science; however, it is not relevant for Cognitive Science (e.g., Neuroscience) and Humanities.</p><p>Complexity of a terminological system is a derivative of scientific complexity. The complexity of a scientific area depends on peculiar attributes and conditions <ref type="bibr" target="#b22">[23]</ref>. The most basic peculiarities are the numerosity of counting entities and their interaction: high diversity of disordered interaction among multiple entities represents a complex research area. To refer to the entities, their interactions and degrees of disorder, the research area needs complex terminology. Ladyman et al. <ref type="bibr" target="#b23">[24]</ref> offered to determine complexity of a research area according to five qualitative conditions: numerosity of elements, numerosity of interactions, disorder, openness, feedback. Considering terminological systems, numerosity of elements and numerosity of interactions in a complex research area require a rich and clear structured system of terms, preferably taxonomy. Transparency of the terminological system structure facilitates the research, analysis and description of disordered systems and non-equilibrium states of the systems. Effect of numerosity of elements and their interactions on the complexity of the terminological system of the research area is obvious through comparison of different areas that attract interest of wide readership: Neuroscience and Computer Science <ref type="bibr" target="#b24">[25]</ref>.</p><p>The complexity of terminology is associated with a formal representation (signifier) of a term. Putting aside borrowings, we would like to mention symbols and abbreviations (acronyms, backronyms, syllabic abbreviations, clipping etc.). Symbols and abbreviations belong to a set of peculiarities of a language for special purpose. Symbolic language of science involves symbols and abbreviations as means to optimize content transferring, to standardize naming of numerous elements, frequent interaction among them, and standard procedures of data processing. Languages for special purpose in Natural Science and Mathematical Sciences (including Computer Science) contain complicated systems of symbols. Meanwhile, symbols and abbreviations are in use in all research areas disregarding their complexity. Nevertheless, readers of popularized publications expect explanations of the symbols and abbreviations.</p><p>Another cause of the terminological complexity is research traditions. Neuroscience and computer science represent the new research areas. Nevertheless, humans became curious about the brain and how to treat its damage thousands years ago; the brain has attracted researchers' attention since the very first steps in practical medicine. The neuroscientific terminology reflects rich traditions of the brain study in the history of science: Latin (e.g. cerebellum 'little brain') and Greek (e.g. diencephalon 'interbrain') borrowings, eponyms (Broca's area), metaphors (e.g. hemispheres), etc. Diversity of the traditions provides neuroscience with parallel terms, which refer to the same concept (e.g., names of the disease: <ref type="bibr" target="#b25">[26]</ref>). Understanding the neuroscientific terminology requires knowledge of the science development.</p><p>Computer science has begun to develop its traditions mostly in the middle of the XX century; therefore, it lacks Latin and Greek terminology as well as numerous eponyms. As compared to neuroscience, the terminology in computer science seems less complicated and more transparent for nonprofessionals; moreover, an average reader of popularized science understands many terms since he / she employs computers in the everyday routine. Readership of popular science publications is probably familiar with the basic terminology of this area, while the neuroscientific terminology requires definitions and clarifications.</p><p>The complexity of terminology is often caused by socio-cultural diversity of readership of popular science publications. The diversity is revealed in comprehension of basic terminology of Science and Humanities that is affected by programs of secondary and college education.</p><p>The programs provide people with grounds and backdrops for comprehending current news of popular science. Since content of the programs varies in different institutions and countries, readers have differences in their background and terminological lexicon especially in Humanities.</p><p>While popularizing science, journalists substitute complex terms by basic ones or clarify the underlying concept, which is denoted by the complex term. Enhancing the popular science text readability, popularization may bring in damaging its comprehensibility. Both ways to avoid the complex terminology may lead to misinformation or distortion of the content. The term substitution may distort the content since semantic relations in terminological systems are not similar to those in the general lexicon of the language. It is presupposed that a network of connections within a terminological system does not support synonyms and maintains a transparent one-to-one relationship between the term and the concept it referred to. A list of the potential substitutions usually includes a widespread name of the concept if any exists in the general lexicon (e.g. sea cow instead of manatee), hypernym (e.g. herbivore marine mammal for manatee) and co-hyponyms of the complex term with additional explanation since co-hyponyms denote a different object (quality, action, etc.) within the same category. Meanwhile, commonsense concepts are not equal to scientific concepts in the complex research areas; therefore, appealing to the common sense requires clarifications. Thus, term substitutions do not enhance structure of the popular scientific text. Probably, the best way to clarify the term is to illustrate its concept <ref type="bibr" target="#b26">[27]</ref>.</p><p>Speaking about automatic systems of generating a popular review of scientific publications, we need to choose the way for term recognition and extraction. In order to substitute or clarify any unfamiliar term we need to recognize it in scientific discourse and then provide readers with references, definitions or illustrations.</p><p>Summarizing our consideration of complexity of terminology, we note that the selection of a way to facilitate perception of terms in popular scientific publications depends on complexity of the research area, richness of the research tradition of the area, and cultural diversity.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Automatic Terminology Extraction</head><p>Automatic Term Extraction (ATE) or Automatic Terminology Extraction is an automated process of detecting terms in a corpus of specialised texts. It has been a relevant NLP task since 1980s and remains challenging from several perspectives, such as data collection (creation of manually annotated domain-specific corpora), extraction algorithms (definition of term length, minimum term frequency, term POS-pattern), evaluation (usually limited to the use of precision metric as the information about all terms in a text is often missing) <ref type="bibr" target="#b17">[18]</ref>.</p><p>The ATE methods are traditionally classified in three groups:</p><p>• Linguistic methods: these methods are based on linguistic properties such as POS-patterns or other morpho-syntactic patters (e.g. <ref type="bibr" target="#b27">[28,</ref><ref type="bibr" target="#b28">29]</ref>). • Statistical methods: these methods are based on statistical properties (various weightings have been proposed, e.g. frequency, mutual information, log-likelihood ratio, etc.) and usually analyse 𝑛-grams measuring termhood or unithood <ref type="bibr" target="#b29">[30]</ref>. • Hybrid methods: these methods are combinations of the previous two (e.g. <ref type="bibr" target="#b30">[31]</ref>). Usually, the initial selection is performed based on linguistic properties which is followed by the ranking procedure on the basis of statistical measures <ref type="bibr" target="#b17">[18]</ref>. Hybrid approaches have been shown to outperform linguistic or statistical methods <ref type="bibr" target="#b31">[32]</ref>.</p><p>As stated in <ref type="bibr" target="#b17">[18]</ref>, one of the difficulties is to well define the cut-off threshold for term candidates.</p><p>Recent advances in Machine Learning techniques, including Deep Learning models, have made the taxonomy of ATE methodology more complex and diverse <ref type="bibr" target="#b32">[33]</ref>. Numerous methods have been proposed (e.g. <ref type="bibr" target="#b33">[34,</ref><ref type="bibr" target="#b34">35]</ref>).</p><p>Lately, large transformer models such as Jurassic-1 <ref type="bibr" target="#b35">[36]</ref>, Google's T5 <ref type="bibr" target="#b36">[37]</ref>, BERT <ref type="bibr" target="#b37">[38]</ref>, or GPT-3 <ref type="bibr" target="#b38">[39]</ref> have been shown to be successful on several NLP tasks, outperforming other stateof-the-art models. They make use of subword tokenizers, such as Byte-Pair Encoding (BPE) <ref type="bibr" target="#b39">[40]</ref> and WordPiece <ref type="bibr" target="#b40">[41]</ref>. For instance, BPE that uses the idea of word segmentation into subword units is exploited in GPT-2 <ref type="bibr" target="#b41">[42]</ref> and Roberta <ref type="bibr" target="#b42">[43]</ref>. A similar subword tokenization algorithm WordPiece is ussed in BERT <ref type="bibr" target="#b37">[38]</ref>, DistilBERT <ref type="bibr" target="#b43">[44]</ref>, and Electra <ref type="bibr" target="#b44">[45]</ref>. Despite a comparative shallowness of these models, they have been shown to be quite effective for the related use case of languages with large vocabularies and many rare words <ref type="bibr" target="#b45">[46,</ref><ref type="bibr" target="#b39">40]</ref>. Therefore, their use might be promising for terminology extraction.</p><p>In the context of term extraction from scientific texts with the final goal of text simplification, it is also important to consider named entities. Named entities are objects, abstract or physical, such as a person, location, organization, product, etc., that can be denoted with a proper name. They can also designate certain natural terms like biological species, substances <ref type="bibr" target="#b46">[47]</ref>. For a recent survey of existing deep learning techniques for Named Entity Recognition (NER) task, refer to <ref type="bibr" target="#b47">[48]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Related Evaluation Initiatives</head><p>This section presents a brief overview of related evaluation initiatives, related tasks and related approaches.</p><p>CLEF SimpleText track was first accepted in 2020 (see <ref type="bibr" target="#b48">[49]</ref> for the overview of the first edition of CLEF SimpleText workshop). However, there have been other initiatives addressing the related topics on scholarly document processing at NLP conference.</p><p>The lack of background knowledge can become a barrier to reading comprehension and there is a knowledge threshold allowing reading comprehension <ref type="bibr" target="#b1">[2]</ref>. Scientific text simplification presupposes the facilitation of readers' understanding of complex content by establishing links to basic lexicon while traditional methods of text simplification try to eliminate complex concepts and constructions <ref type="bibr" target="#b0">[1]</ref>. SimpleText is not limited to a "Split and Rephrase" task <ref type="bibr" target="#b49">[50]</ref> but also aims to provide a sufficient context to a scientific text. Entity linking could mitigate the background knowledge problem, by providing definitions, illustrations, examples, and related entities, but the existing entity linking datasets are focused on people, places, and organisation <ref type="bibr" target="#b50">[51]</ref>, while a non-expert reader of a scientific article needs assistance with new concepts and methods. INEX/CLEF'11-14 Tweet Contextualization <ref type="bibr" target="#b51">[52]</ref> and CLEF'16-17 Cultural Microblog Contextualization <ref type="bibr" target="#b52">[53]</ref> tracks aim to provide lacking background knowledge to a tweet. Besides completely different nature of tweets and popular science, this use case differs from the text simplification as this lack of background knowledge is due to the tweet length.</p><p>In contrast to the Background Linking task at TREC'20 News Track <ref type="bibr" target="#b53">[54]</ref>, SimpleText focuses on (1) scientific text; (2) selection of notions to be explained; (3) helpfulness of the provided information rather than its relevance.</p><p>Probably, the closest evaluation campaign to SimpleText's task 2 is TermEval 2020: Shared Task on Automatic Term Extraction Using Annotated Corpora for Term Extraction Research (ACTER) Dataset <ref type="bibr" target="#b17">[18]</ref>. One of the challenges related to term extraction methodology is stated to be the definition of the degree of specialisation or domain-specification required for a lexical item to be considered a term. This aspect which is difficult to quantify is partially tackled under "term difficulty" goal of the task 2 of the CLEF SimpleText lab. TermEval was set up as a binary task: term or not. In contrast to that, SimpleText aims at detecting a term and identifying its difficulty level.</p><p>Datasets Simple Wikipedia based datasets could be useful to train AI models but (1) they are not scientific publications; (2) there is no direct correspondence between Wikipedia and Simple Wikipedia articles <ref type="bibr" target="#b54">[55]</ref>. Another dataset was introduced at TAC 2014 Biomedical Summarization Track <ref type="bibr" target="#b55">[56]</ref> with a goal to retrieve important aspects of a paper from the perspective of the community. In TermEval task <ref type="bibr" target="#b17">[18]</ref>, the organisers proposed ACTER, a manually annotated domain-specific corpora covering 3 languages (English, French, and Dutch) and four domains (corruption, dressage (equitation), heart failure, and wind energy). The annotators labelled around 50k token for each language and domain. The tokens were judged according to their degree of domain-specificity and lexicon-specificity. Three term labels were used: Specific Terms (i.e. domain-and lexicon-specific), Common Terms (domain-specific, not lexicon-specific), and Out-of-Domain (OOD) Terms (not domain-specific, lexicon-specific). In SimpleText, we focus on term difficulty which is in line with lexicon-specificity of TermEval task (in particular, when using 3-point scale), without assessing domain-specificity.</p><p>In contrast to that, we evaluate simplification in terms of lexical and syntax complexity combining with error analysis. As we demonstrated previously, scientific information is often distorted accidentally due to misunderstanding of terminology, omission of essential details, insertion of erroneous background etc. <ref type="bibr" target="#b54">[55]</ref>. Information distortion analysis is close to scientific claim verification <ref type="bibr" target="#b57">[57,</ref><ref type="bibr" target="#b58">58]</ref> but fact checking is limited to search for relevant evidence and decide whether it supports the claim. Another close work is <ref type="bibr" target="#b59">[59]</ref>, where the TF-IDF cosine similarity between documents is computed on (1) a collection of abstracts of scientific papers from the Citation Network Dataset V1 AMINER <ref type="bibr" target="#b60">[60]</ref> and (2) a set of articles from Huffington Post. However, this approach is not robust to lexical changes, which are crucial for text simplification. To the best of our knowledge, no other automatic nor semi-automatic method for information distortion analysis exists.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">CLEF 2022 SimpleText Task 2 Test Collection</head><p>In this section, we discuss the second task about complexity spotting in an extracted sentence from a scientific abstract, addressing the task:</p><p>Given a passage and a query, rank terms/concepts that are required to be explained for understanding this passage (definitions, context, applications etc.).</p><p>The goal of this task is to decide which terms (up to 5) require explanation and contextualization to help a reader to understand a complex scientific text -for example, with regard to a query, terms that need to be contextualized (with a definition, example and/or use-case). For each passage, participants should provide a ranked list of difficult terms with corresponding scores on the scale 1-3 (3 to be the most difficult terms, while the meaning of terms scored 1 can be derived or guessed) and on the scale 1-5 (5 to be the most difficult terms). Passages (sentences) are considered to be independent, i.e. difficult term repetition was allowed.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Train Data</head><p>For this task, data is two-fold: Medicine and Computer Science, as these two domains are the most popular on forums like ELI5 <ref type="bibr" target="#b24">[25,</ref><ref type="bibr" target="#b61">61]</ref>. As in 2021, for Computer Science, we use scientific abstracts from the Citation Network Dataset: DBLP+Citation, ACM Citation network (12th version)<ref type="foot" target="#foot_6">7</ref>  <ref type="bibr" target="#b48">[49]</ref>. A master student in Technical Writing and Translation manually annotated each sentence by extracting difficult terms and attributing difficulty scores on a scale of 1-3 (3 to be the most difficult terms, while the meaning of terms scored 1 can be derived or guessed) and on a scale of 1-5 (5 to be the most difficult terms).</p><p>In 2022, we introduced new data based on Google Scholar and PubMed articles on muscle hypertrophy and health annotated by a master student in Technical Writing and Translation, specializing in these domains. The selected abstracts included the objectives of the study, the results and sometimes the methodology. The abstracts including only the topic of the study were excluded because of the lack of information. To avoid the curse of knowledge, another master student in Technical Writing and Translation not familiar with the domain was solicited for complexity spotting.</p><p>We provided 453 annotated examples in total.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Test Data</head><p>To construct the test data, we retrieved 116,763 sentences from the DBLP abstracts according to the queries from Task 1. We then manually evaluated 592 distinct sentences for 11 queries.</p><p>For the query Digital assistant we took the first 1,000 sentences retrieved by ElasticSearch. We pool terms submitted by all participants for all these queries, representing a number of 4,167 distinct pairs sentence-term in total. We ensured that for each evaluated source sentence the pool contained the results of all participants. Statistics of the number of evaluated sentences per query for Task 2 are given in Table <ref type="table" target="#tab_2">2</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Input and Output Formats</head><p>The input for the train and the test data was provided in JSON and CSV formats with the following fields: snt_id a unique passage (sentence) identifier.</p><p>source_snt passage text. doc_id a unique source document identifier.</p><p>query_id a query ID.</p><p>query_text difficult terms should be extracted from sentences with regard to this query.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Input example (JSON format):</head><p>{"snt_id":"G06.2_2548923997_3", "source_snt":"These communication systems render self-driving vehicles vulnerable to many types of malicious attacks, such as Sybil attacks, Denial of Service (DoS), black hole, grey hole and wormhole attacks.", "doc_id":2548923997, "query_id":"G06.2", "query_text":"self driving"} ˓→ ˓→</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>˓→</head><p>Participants had to submit a list of terms to be contextualized in a JSON format or a tabulated file TSV (for manual runs) with the following fields: run_id Run ID starting with (team_id)_(task_id)_(name). manual Whether the run is manual {0, 1}. snt_id a unique passage (sentence) identifier from the input file.</p><p>term Term or other phrase to be explained. term_rank_snt term difficulty rank within the given sentence. score_5 term difficulty score on the scale from 1 to 5 (5 to be the most difficult terms). score_3 term difficulty score on the scale from 1 to 3 (3 to be the most difficult terms).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Output example (JSON format):</head><p>{"run_id":"NP_task_2_run1", "manual":1, "snt_id":"G06.2_2548923997_3", "term":"black hole attack", "term_rank_snt":1, "score_5":5, "score_3":3}, ˓→ {"run_id":"NP_task_2_run1", "manual":1, "snt_id":"G06.2_2548923997_3", "term":"grey hole attack", "term_rank_snt":2, "score_5":5, "score_3":3}, ˓→ {"run_id":"NP_task_2_run1", "manual":1, "snt_id":"G06.2_2548923997_3", "term":"Sybil attack", "term_rank_snt":3, "score_5":5, "score_3":3}, ˓→ {"run_id":"NP_task_2_run1", "manual":1, "snt_id":"G06.2_2548923997_3", "term":"wormhole attack", "term_rank_snt":4, "score_5":5,"score_3":3}, ˓→ {"run_id":"NP_task_2_run1", "manual":1, "snt_id":"G06.2_2548923997_3", "term":"Denial of service attack", "term_rank_snt":5, "score_5":4, "score_3":3} ˓→</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Evaluation metrics</head><p>We evaluated terms according to:</p><p>• correctness of term limits;</p><p>• term difficulty score on the scale 1-3;</p><p>• term difficulty score on the scale 1-5.</p><p>For both scales of term difficulty, we used a converted scale 1-7. This scale 1-7 was chosen following the psycho-linguistic research of the perception and evaluation of lexical meanings performed by Osgood and his colleagues <ref type="bibr" target="#b62">[62]</ref>, in contrast to the psychometric Likert scale (1-5, Strongly disagree/Disagree/Neither agree nor disagree/Agree/Strongly agree), commonly used in the research that employs questionnaires <ref type="bibr" target="#b63">[63]</ref>. In the classical version of the semantic differential technique, the scale shows the variety of the human perception of semantic nuances from negative (-3) to positive (+3) polarity where 0 marks the "norm" <ref type="bibr" target="#b62">[62]</ref>. The scale 1-7 matches the Osgood's scale and seems more suitable to evaluate concepts and features avoiding associations with negative / positive assessment. Since the 1970s, the scale has been employed in various studies as an evaluation tool for qualitative features.</p><p>Table <ref type="table" target="#tab_3">3</ref> provides examples of the used term difficulty scale. We separate the examples of abbreviations from non-abbreviated phrases / words.</p><p>We added 0 for terms that should not be explained at all and we converted the original scale 1-7 as presented in Table <ref type="table" target="#tab_5">5</ref>.</p><p>Table <ref type="table" target="#tab_6">6</ref> provides some examples of the annotation for Task 2. TERM refers to the terms retrieved by participants, Correct limits is a binary category showing whether the retrieved terms is well limited, Corrected is an eventual correction of retrieved term limits, Difficulty is a term difficulty score in scale 1-7.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">SimpleText Task 2 Results</head><p>In this section we discuss the results for the official submissions to the Task 2.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Participant Approaches</head><p>A total of 4 teams submitted runs, of which 2 runs were updated. Team UAms from the University of Amsterdam <ref type="bibr" target="#b14">[15]</ref> performed the experiments using IDFbased term weighting allowing to locate the most rare terms. Then the obtained rarity measure was balanced with the relevance or centrality of the terms to the given passage.</p><p>Team SimpleScientificText from Wuhan University <ref type="bibr" target="#b13">[14]</ref> used a pipeline of term recognition and complexity spotting, formulating the latter as classification task. The term recognition was performed in two main steps: term extraction using KeyBERT<ref type="foot" target="#foot_7">8</ref> followed by filtering based on the similarity of extracted terms with the query calculated with PhraseSimilarity<ref type="foot" target="#foot_8">9</ref> . The model of the evaluation of complexity is built upon three groups of features (lexical, syntactic and semantic) and assembles various state-of-the-art classification models using a soft voting strategy.</p><p>Team LEA_T5 <ref type="bibr" target="#b10">[11]</ref> from the University of Western Brittany (UBO) used T5<ref type="foot" target="#foot_9">10</ref> model <ref type="bibr" target="#b64">[64]</ref> via the SimpleT5 library <ref type="foot" target="#foot_10">11</ref> as the core of their approach. The Google T5 (Text-To-Text Transfer Transformer) model is based on the transfer learning with a unified text-to-text transformer <ref type="bibr" target="#b64">[64]</ref>.</p><p>Team aaac has not provided any detail about their run.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Results</head><p>The results are given in Tables <ref type="table" target="#tab_8">7 and 8</ref>. In both tables, we present results for correctly attributed scores regardless the correctness of term limits (Score_3 and Score_5) and the number of correctly limited terms with correctly attributed scores (+ Limits). Table <ref type="table" target="#tab_7">7</ref> provides the results on all sentences we evaluated. However, to have comparable results for partial runs we also report scores on a subset 167 common sentences in Table <ref type="table" target="#tab_8">8</ref>, although we were constrained to exclude the run lea_t5 due to a very low number of evaluated sentences. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion and future work</head><p>We overviewed Task 2 of the CLEF 2022 SimpleText track that aims at identifying and ranking difficult terms within scientific texts. We evaluated term difficulty with regard to the queries from Task 1. For Task 2, we created a corpus of sentences extracted from the abstracts of scientific publications, with manual annotations of term complexity.</p><p>For next year, we will extend Task 2 to provide a context to difficult terms and we will work on automatic metrics based on the insights we obtained this year. In particular, for Task 2, participants will be asked to provide context for difficult terms. This context should provide a definition and take into account ordinary readers' needs to associate their particular problems with the opportunities that science provides them to solve the problems <ref type="bibr" target="#b24">[25]</ref>. This year, the HULAT-UC3M <ref type="bibr" target="#b9">[10]</ref> team submitted runs which combine tasks 2 and 3 which demonstrates strong interconnection of the tasks as often the terminology cannot be removed nor simplified but it needs to be explained to a reader.</p><p>Further details about the lab can be found at the SimpleText website: http://simpletext-project. com. Please join us and help to make scientific results understandable!</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>CLEF 2022 SimpleText official run submission statistics</figDesc><table><row><cell>Team</cell><cell>Task 1</cell><cell>Task 2</cell><cell>Task 3</cell><cell>Total runs</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 2</head><label>2</label><figDesc>SimpleText Task 2: Statistics of the number of evaluated sentences per query</figDesc><table><row><cell>Query</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head>Table 3</head><label>3</label><figDesc>Examples of the term difficulty scale used for evaluation. Difficult terms are highlighted with the green color</figDesc><table><row><cell>Grade</cell><cell></cell><cell cols="4">Non-abbreviated (ordinary) term</cell><cell>Abbreviation</cell></row><row><cell>7</cell><cell cols="6">"The qubit-qutrit pair acts as a closed system and</cell><cell>XCSFHP in "We compared XCSFHP</cell></row><row><cell></cell><cell cols="6">one external qubit serve as the environment for the</cell><cell>to XCSF on several problems. "</cell></row><row><cell></cell><cell>pair. "</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>"The effect of alphabet cardinality and</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>the selection pressure on the scalabil-</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>ity of the real-coded ECGA ( rECGA )</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>method is investigated. "</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>"We here study the protection of quan-</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>tum Fisher information ( QFI ) of the</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>phase parameter in entangled-atom</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>states within the framework of in-</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>dependently dissipative environments</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>and driven individually by classical</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>fields. "</cell></row><row><cell>6</cell><cell cols="6">"This paper bring forward based on</cell><cell>" XCS with computed prediction,</cell></row><row><cell></cell><cell cols="2">immune</cell><cell>genetic</cell><cell>algorithm</cell><cell>to</cell><cell>solve</cell><cell>namely XCSF, extends XCS by replac-</cell></row><row><cell></cell><cell cols="5">man on board automated storage and retrieval</cell><cell>ing the classifier prediction with a</cell></row><row><cell></cell><cell cols="6">system optimized problem, immune genetic algorithm remains the characteristic which is not ... " " Tile coding is a well-known function approxima-tor that has been successfully applied to many</cell><cell>parametrized prediction function. " "Side-channel attack ( SCA ) is a very efficient cryptanalysis technology to attack cryptographic devices. "</cell></row><row><cell></cell><cell cols="4">reinforcement learning tasks. "</cell><cell></cell></row><row><cell></cell><cell cols="6">" Quantum circuits of many qubits are challenging</cell></row><row><cell></cell><cell cols="6">to implement making designs with low qubit cost</cell></row><row><cell></cell><cell cols="2">desirable. "</cell><cell></cell><cell></cell><cell></cell></row><row><cell>5</cell><cell cols="6">"Experiment simulation result express: the result of</cell><cell>"This paper presents a simple real-</cell></row><row><cell></cell><cell cols="6">immune genetic algorithm is better than traditional</cell><cell>coded estimation of distribution al-</cell></row><row><cell></cell><cell cols="6">genetic algorithm in the circumstance of the same</cell><cell>gorithm (EDA) design using x-ary ex-</cell></row><row><cell></cell><cell cols="5">clusters and the same evolution generation. "</cell><cell>tended compact genetic algorithm</cell></row><row><cell></cell><cell cols="6">"The results show that the population size re-</cell><cell>( XECGA ) and discretization meth-</cell></row><row><cell></cell><cell cols="6">quired by rECGA-to successfully solve a class</cell><cell>ods. "</cell></row><row><cell></cell><cell>of</cell><cell cols="5">additively-separable problems -scales sub-</cell></row><row><cell></cell><cell cols="6">quadratically with problem size and the number</cell></row><row><cell></cell><cell cols="6">of function evaluations scales sub-cubically with</cell></row><row><cell></cell><cell cols="3">problem size. "</cell><cell></cell><cell></cell></row><row><cell>4</cell><cell cols="6">"Specifically, the real-valued decision variables are</cell><cell>"This paper presents a simple real-</cell></row><row><cell></cell><cell cols="6">mapped to discrete symbols of user-specified cardi-</cell><cell>coded estimation of distribution al-</cell></row><row><cell></cell><cell cols="4">nality using discretization methods . "</cell><cell></cell><cell>gorithm ( EDA ) design using x-ary</cell></row><row><cell></cell><cell cols="6">"Immune genetic algorithm can shorten storage or</cell><cell>extended compact genetic algorithm</cell></row><row><cell></cell><cell cols="6">retrieval distance in application, and enhance stor-</cell><cell>(XECGA) and discretization methods. "</cell></row><row><cell></cell><cell cols="4">age or retrieval efficiency . "</cell><cell></cell></row><row><cell></cell><cell cols="6">"The effect of alphabet cardinality and the selection</cell></row><row><cell></cell><cell cols="6">pressure on the scalability of the real-coded ECGA</cell></row><row><cell></cell><cell cols="4">(rECGA) method is investigated. "</cell><cell></cell></row><row><cell></cell><cell cols="6">" Deep learning has become increasingly popular</cell></row><row><cell></cell><cell cols="6">in both academic and industrial areas in the past</cell></row><row><cell></cell><cell cols="2">years. "</cell><cell></cell><cell></cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_4"><head>Table 4</head><label>4</label><figDesc>Examples of the term difficulty scale used for evaluation: grades 0-3. Difficult terms are highlighted with the green color</figDesc><table><row><cell>Grade</cell><cell>Non-abbreviated (ordinary) term</cell><cell></cell><cell>Abbreviation</cell><cell></cell><cell></cell></row><row><cell>3</cell><cell>"The XECGA is then used to build the probabilistic</cell><cell cols="4">"We evaluate each measure's perfor-</cell></row><row><cell></cell><cell>model and to sample a new population based on the</cell><cell cols="4">mance by AUC which is usually used</cell></row><row><cell></cell><cell>probabilistic model . "</cell><cell cols="4">for evaluation of imbalanced data clas-</cell></row><row><cell></cell><cell>scale sub-quadratically in "The results show that</cell><cell cols="2">sification. "</cell><cell></cell><cell></cell></row><row><cell></cell><cell>the population size required by rECGA-to success-</cell><cell cols="4">"This theoretical analysis is confirmed</cell></row><row><cell></cell><cell>fully solve a class of additively-separable problems-</cell><cell cols="4">by the experimental results: using sev-</cell></row><row><cell></cell><cell>scales sub-quadratically with problem size and the number of function evaluations scales sub-cubically with problem size. " " Molecular transistors can play a very important role in the design and fabrication of complex logic</cell><cell cols="4">eral sampling methods to rebalance the imbalanced data sets, it is found that the performances of LDA on bal-anced data sets are superior to those of LDA on imbalanced data sets. "</cell></row><row><cell></cell><cell>inside chips. "</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>2</cell><cell>"Experiment simulation result express: the result of</cell><cell cols="4">NIST (The National Institute of Stan-</cell></row><row><cell></cell><cell>immune genetic algorithm is better than traditional</cell><cell cols="4">dards and Technology) in "Recently</cell></row><row><cell></cell><cell>genetic algorithm in the circumstance of the same</cell><cell cols="4">NIST has published the second draft</cell></row><row><cell></cell><cell>clusters and the same evolution generation. "</cell><cell cols="4">document of recommendation for the</cell></row><row><cell></cell><cell>"Specifically, the real-valued decision variables are mapped to discrete symbols of user-specified cardi-</cell><cell cols="4">entropy sources used for random bit generation. "</cell></row><row><cell></cell><cell>nality using discretization methods. "</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>1</cell><cell>"video labeling game is a crowsourcing tool to col-</cell><cell>2D</cell><cell>(2-dimensional),</cell><cell>3D</cell><cell>(3-</cell></row><row><cell></cell><cell>lect user-generated metadata for video clips. "</cell><cell cols="4">dimensional) maps as in "The</cell></row><row><cell></cell><cell>"On the other hand, a 3dimensional (3D) map, which</cell><cell cols="4">3D maps will give more intuitive</cell></row><row><cell></cell><cell>is one of major themes in machine vision research,</cell><cell cols="4">information compared to conventional</cell></row><row><cell></cell><cell>has been utilized as a simulation tool in city and</cell><cell cols="2">2-dimensional ( 2D ) ones. "</cell><cell></cell><cell></cell></row><row><cell></cell><cell>landscape planning , and other engineering fields. "</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>0</cell><cell>"This device has two work modes: "native" and "re-</cell><cell cols="4">et al. (from latin "et alii" meaning</cell></row><row><cell></cell><cell>mote". "</cell><cell cols="4">"and others") in "However, Nam et al.</cell></row><row><cell></cell><cell>"Immune genetic algorithm can shorten storage or</cell><cell cols="2">pointed out. . . "</cell><cell></cell><cell></cell></row><row><cell></cell><cell>retrieval distance in application, and enhance stor-</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>age or retrieval efficiency. "</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>"The proposed rECGA is simple , making it</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>amenable for further empirical and theoretical anal-</cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell></cell><cell>ysis. "</cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_5"><head>Table 5</head><label>5</label><figDesc>SimpleText Task 2: Scale conversion rules</figDesc><table><row><cell>Term difficulty scale</cell><cell>0</cell><cell>1</cell><cell>2</cell><cell>3</cell><cell>4</cell><cell>5</cell><cell>6</cell><cell>7</cell></row><row><cell>7 point scale</cell><cell>0</cell><cell>1</cell><cell>2</cell><cell>3</cell><cell>4</cell><cell>5</cell><cell>6</cell><cell>7</cell></row><row><cell>⇒ 5 point scale</cell><cell>0</cell><cell>1</cell><cell>2</cell><cell></cell><cell>3</cell><cell>4</cell><cell></cell><cell>5</cell></row><row><cell>7 point scale</cell><cell>0</cell><cell>1</cell><cell>2</cell><cell>3</cell><cell>4</cell><cell>5</cell><cell>6</cell><cell>7</cell></row><row><cell>⇒ 3 point scale</cell><cell>0</cell><cell>1</cell><cell></cell><cell></cell><cell>2</cell><cell></cell><cell>3</cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_6"><head>Table 6</head><label>6</label><figDesc>SimpleText Task 2: Examples of the annotation</figDesc><table><row><cell>Sentence</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_7"><head>Table 7</head><label>7</label><figDesc>SimpleText Task 2: Results for the official runs</figDesc><table><row><cell></cell><cell>Total</cell><cell cols="2">Evaluated</cell><cell>Score_3</cell><cell></cell><cell>Score_5</cell><cell></cell></row><row><cell></cell><cell></cell><cell></cell><cell>+Limits</cell><cell cols="2">+Limits</cell><cell cols="2">+Limits</cell></row><row><cell>aaac</cell><cell>581,285</cell><cell>2,951</cell><cell>1,388</cell><cell>702</cell><cell>318</cell><cell>415</cell><cell>175</cell></row><row><cell>SimpleScientificText</cell><cell>63,027</cell><cell>298</cell><cell>262</cell><cell>48</cell><cell>44</cell><cell>47</cell><cell>42</cell></row><row><cell>UAms</cell><cell>263,022</cell><cell>1,315</cell><cell>1,175</cell><cell>105</cell><cell>69</cell><cell>60</cell><cell>49</cell></row><row><cell>lea_t5</cell><cell>23,331</cell><cell>5</cell><cell>4</cell><cell>0</cell><cell>0</cell><cell>0</cell><cell>0</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_8"><head>Table 8</head><label>8</label><figDesc>SimpleText Task 2: Results on a subset of 167 common sentences</figDesc><table><row><cell></cell><cell>Total</cell><cell>Evaluated</cell><cell></cell><cell>Score_3</cell><cell></cell><cell>Score_5</cell><cell></cell></row><row><cell></cell><cell></cell><cell cols="2">+Limits</cell><cell cols="2">+Limits</cell><cell cols="2">+Limits</cell></row><row><cell>aaac</cell><cell>581,285</cell><cell>833</cell><cell>414</cell><cell>200</cell><cell>104</cell><cell>127</cell><cell>67</cell></row><row><cell>UAms</cell><cell>263,022</cell><cell>574</cell><cell>514</cell><cell>46</cell><cell>28</cell><cell>25</cell><cell>21</cell></row><row><cell>SimpleScientificText</cell><cell>63,027</cell><cell>208</cell><cell>188</cell><cell>33</cell><cell>32</cell><cell>32</cell><cell>29</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://simpletext-project.com</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">A database for terminology and translations created and used by the European Commission, replaced in 2007 by Interactive Terminology for Europe (IATE) https://iate.europa.eu/.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="3" xml:id="foot_2">A linguistic and terminology database owned by the Translation Bureau of Public Services and Procurement Canada, https://www.btb.termiumplus.gc.ca/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_3">A German term bank used by technical translators.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="5" xml:id="foot_4">French term bank covering science and technology fields and developed by AFNOR.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="6" xml:id="foot_5">A term bank created by the Quebec Board of the French Language, https://gdt.oqlf.gouv.qc.ca/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="7" xml:id="foot_6">https://www.aminer.org/citation</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="8" xml:id="foot_7">https://github.com/MaartenGr/KeyBERT</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="9" xml:id="foot_8">https://github.com/franplk/PhraseSimilarity</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="10" xml:id="foot_9">https://github.com/google-research/text-to-text-transfer-transformer</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="11" xml:id="foot_10">https://github.com/Shivanandroy/simpleT5</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>We like to acknowledge the support of the Lab Chairs of CLEF 2022, Allan Hanbury and Martin Potthast, for their help and patience. Special thanks to the University Translation Office of the Université de Bretagne Occidentale, and to Nicolas Poinsu and Ludivine Grégoire for their major impact in the train data construction and Léa Talec-Bernard and Julien Boccou for their help in evaluation of participants' runs. We thank Josiane Mothe for reviewing papers. We also thank Alain Kerhervé, and the MaDICS (https:// www.madics.fr/ ateliers/ simpletext/ research group.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">A Word-Complexity Lexicon and A Neural Readability Ranking Model for Lexical Simplification</title>
		<author>
			<persName><forename type="first">M</forename><surname>Maddela</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Xu</surname></persName>
		</author>
		<ptr target="https://www.aclweb.org/anthology/D18-1410" />
	</analytic>
	<monogr>
		<title level="m">Proc. of EMNLP 2018, ACL</title>
				<meeting>of EMNLP 2018, ACL<address><addrLine>Brussels, Belgium</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="3749" to="3760" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">How Much Knowledge Is Too Little? When a Lack of Knowledge Becomes a Barrier to Comprehension</title>
		<author>
			<persName><forename type="first">T</forename><surname>O'reilly</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Sabatini</surname></persName>
		</author>
		<idno type="DOI">10.1177/0956797619862276</idno>
		<ptr target="https://journals.sagepub.com/doi/10.1177/0956797619862276" />
	</analytic>
	<monogr>
		<title level="j">Psychological Science</title>
		<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Controllable Text Simplification with Explicit Paraphrasing</title>
		<author>
			<persName><forename type="first">M</forename><surname>Maddela</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Alva-Manchego</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Xu</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2010.11004" />
		<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Text Simplification for Scientific Information Access: CLEF 2021 SimpleText Workshop</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bellot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Braslavski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advances in Information Retrieval -43nd European Conference on IR Research, ECIR 2021</title>
				<meeting><address><addrLine>Lucca, Italy; Lucca, Italy</addrLine></address></meeting>
		<imprint>
			<publisher>Proc</publisher>
			<date type="published" when="2021-04-01">March 28 -April 1, 2021. 2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Huet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<title level="m">Overview of the CLEF 2022 SimpleText Task 1: Passage selection for a simplified summary</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Overview of the CLEF 2022 SimpleText Task 3: Query biased simplification of scientific texts</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Araújo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Hannachi</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Overview of the CLEF 2022 SimpleText Lab: Automatic simplification of scientific texts</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Huet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Araújo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Hannachi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">É</forename><surname>Mathurin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bellot</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">CLEF&apos;22: Proceedings of the Thirteenth International Conference of the CLEF Association</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">A</forename><surname>Barrón-Cedeño</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><forename type="middle">D S</forename><surname>Martino</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><forename type="middle">D</forename><surname>Esposti</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Sebastiani</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Macdonald</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Pasi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Hanbury</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Potthast</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Controllable Sentence Simplification Using Transfer Learning</title>
		<author>
			<persName><forename type="first">A</forename><surname>Menta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Garcia-Serrano</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">CYUT Team2 SimpleText Shared Task Report in CLEF-2022</title>
		<author>
			<persName><forename type="first">S.-H</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H.-Y</forename><surname>Huang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">HULAT-UC3M at SimpleText@CLEF-2022: Scientific text simplification using BART</title>
		<author>
			<persName><forename type="first">A</forename><surname>Rubio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Martínez</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Is Using an AI to Simplify a Scientific Text Really Worth It?</title>
		<author>
			<persName><forename type="first">T.-B</forename><surname>Talec-Bernard</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">NLP-IISERB@Simpletext2022: To Explore the Performance of BM25 and Transformer Based Frameworks for Automatic Simplification of Scientific Texts</title>
		<author>
			<persName><forename type="first">S</forename><surname>Saha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Roy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">Y</forename><surname>Goud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">S</forename><surname>Reddy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Basu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Using a Pre-trained SimpleT5 Model for Text Simplification in a limited Corpus</title>
		<author>
			<persName><forename type="first">J</forename><surname>Monteiro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Aguiar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Araújo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Assembly Models for SimpleText Task 2: Results from Wuhan University Research Group</title>
		<author>
			<persName><forename type="first">H</forename><surname>Jianfei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Jin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
		<respStmt>
			<orgName>WS.org</orgName>
		</respStmt>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">University of Amsterdam at the CLEF 2022 SimpleText Track</title>
		<author>
			<persName><forename type="first">F</forename><surname>Mostert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sampatsing</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Spronk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Working Notes of CLEF 2022 -Conference and Labs of the Evaluation Forum<address><addrLine>Bologna, Italy; Bologna, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022">September 5th -to -8th, 2022. 2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<ptr target="https://dictionary.cambridge.org/dictionary/english/term" />
		<title level="m">term</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Terminology extraction and management</title>
		<author>
			<persName><forename type="first">K</forename><surname>Kageura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Marshman</surname></persName>
		</author>
		<idno type="DOI">10.4324/9781315311258-4</idno>
		<ptr target="https://www.taylorfrancis.com/books/9781315311241/chapters/10.4324/9781315311258-4.doi:10.4324/9781315311258-4" />
	</analytic>
	<monogr>
		<title level="m">The Routledge Handbook of Translation and Technology</title>
				<editor>
			<persName><forename type="first">M</forename><surname>O'hagan</surname></persName>
		</editor>
		<meeting><address><addrLine>Abingdon, Oxon ; New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>Routledge</publisher>
			<date type="published" when="2019">2020. 2019</date>
			<biblScope unit="page" from="61" to="77" />
		</imprint>
	</monogr>
	<note>1 ed</note>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Shared Task on Automatic Term Extraction Using the Annotated Corpora for Term Extraction Research (ACTER) Dataset</title>
		<author>
			<persName><forename type="first">A</forename><surname>Rigouts Terryn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Hoste</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Drouin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lefever</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/2020.computerm-1.12" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 6th International Workshop on Computational Terminology, European Language Resources Association</title>
				<meeting>the 6th International Workshop on Computational Terminology, European Language Resources Association<address><addrLine>Marseille, France</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020. 2020</date>
			<biblScope unit="page" from="85" to="94" />
		</imprint>
	</monogr>
	<note>TermEval</note>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Language for Special Purposes</title>
		<author>
			<persName><forename type="first">B.-L</forename><surname>Gunnarsson</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-94-011-4419-3_11</idno>
		<idno>doi:</idno>
		<ptr target="10.1007/978-94-011-4419-3_11" />
	</analytic>
	<monogr>
		<title level="m">Encyclopedia of Language and Education</title>
				<editor>
			<persName><forename type="first">G</forename><forename type="middle">R</forename><surname>Tucker</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Corson</surname></persName>
		</editor>
		<meeting><address><addrLine>Netherlands; Dordrecht</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1997">1997</date>
			<biblScope unit="page" from="105" to="117" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Wüster&apos;s View of Terminology</title>
		<author>
			<persName><forename type="first">M</forename><surname>Trojar</surname></persName>
		</author>
		<ptr target="https://ojs.zrc-sazu.si/sjsls/article/view/7344" />
	</analytic>
	<monogr>
		<title level="j">Slovenski jezik / Slovene Linguistic Studies</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">The LEXIS termbank</title>
		<author>
			<persName><forename type="first">E</forename><surname>Hoffmann</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/1987.tc-1.14" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of Translating and the Computer 9: Potential and practice</title>
				<meeting>Translating and the Computer 9: Potential and practice<address><addrLine>Aslib, London, UK</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1987">1987</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Des activités de normalisation... à l&apos;élaboration d&apos;un dictionnaire</title>
		<author>
			<persName><forename type="first">C</forename><surname>Hermetet-Filez</surname></persName>
		</author>
		<idno type="DOI">10.3406/apliu.1990.2106</idno>
		<ptr target="https://www.persee.fr/doc/apliu_0248-9430_1990_num_9_3_2106.doi:10.3406/apliu.1990.2106" />
	</analytic>
	<monogr>
		<title level="j">Cahiers de l&apos;APLIUT</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="36" to="39" />
			<date type="published" when="1990">1990</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<monogr>
		<author>
			<persName><forename type="first">K</forename><surname>Wiesner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ladyman</surname></persName>
		</author>
		<idno type="DOI">10.48550/ARXIV.1909.13243</idno>
		<ptr target="https://arxiv.org/abs/1909.13243.doi:10.48550/ARXIV.1909.13243" />
		<title level="m">Measuring complexity</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<title level="m" type="main">What is a complex system?</title>
		<author>
			<persName><forename type="first">J</forename><surname>Ladyman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Wiesner</surname></persName>
		</author>
		<ptr target="https://yalebooks.yale.edu/book/9780300251104/what-complex-system/" />
		<imprint>
			<date type="published" when="2020">2020</date>
			<publisher>Yale University Press</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">What science-related topics need to be popularized? A comparative study</title>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<ptr target="http://ceur-ws.org/Vol-2936/paper-203.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the Working Notes of CLEF 2021 -Conference and Labs of the Evaluation Forum</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Joly</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Maistro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Piroi</surname></persName>
		</editor>
		<meeting>of the Working Notes of CLEF 2021 -Conference and Labs of the Evaluation Forum<address><addrLine>Bucharest, Romania</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2021">September 21st -to -24th, 2021. 2936. 2021</date>
			<biblScope unit="page" from="2242" to="2255" />
		</imprint>
	</monogr>
	<note>CEUR Workshop Proceedings</note>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">The Semantics of Medical Discourse</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">J</forename><surname>Good</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-J. Vecchio</forename><surname>Good</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-94-009-8429-5_6</idno>
		<idno>doi:</idno>
		<ptr target="10.1007/978-94-009-8429-5_6" />
	</analytic>
	<monogr>
		<title level="m">Sciences and Cultures</title>
				<editor>
			<persName><forename type="first">R</forename><forename type="middle">D</forename><surname>Whitley</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">E</forename><surname>Mendelsohn</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Y</forename><surname>Elkana</surname></persName>
		</editor>
		<meeting><address><addrLine>Netherlands; Dordrecht</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="1981">1981</date>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="177" to="212" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">The Role of Illustrations in Popularizing Medical Discourse</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Silletti</surname></persName>
		</author>
		<idno type="DOI">10.7358/ling-2015-002-sill</idno>
		<ptr target="http://www.ledonline.it/index.php/linguae/article/view/839.doi:10.7358/ling-2015-002-sill" />
	</analytic>
	<monogr>
		<title level="m">Linguae &amp; -Rivista di lingue e culture moderne</title>
				<imprint>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="65" to="81" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Surface grammatical analysis for the extraction of terminological noun phrases</title>
		<author>
			<persName><forename type="first">D</forename><surname>Bourigault</surname></persName>
		</author>
		<idno type="DOI">10.3115/992383.992415</idno>
		<ptr target="http://portal.acm.org/citation.cfm?doid=992383.992415.doi:10.3115/992383.992415" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 14th conference on Computational linguistics</title>
				<meeting>the 14th conference on Computational linguistics<address><addrLine>Nantes, France</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computational Linguistics</publisher>
			<date type="published" when="1992">1992</date>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page">977</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">CLARIT-TREC experiments</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">A</forename><surname>Evans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">G</forename><surname>Lefferts</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the second conference on Text retrieval conference, TREC-2</title>
				<meeting>the second conference on Text retrieval conference, TREC-2<address><addrLine>USA</addrLine></address></meeting>
		<imprint>
			<publisher>Pergamon Press, Inc</publisher>
			<date type="published" when="1995">1995</date>
			<biblScope unit="page" from="385" to="395" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Methods of automatic term recognition: A review, Terminology</title>
		<author>
			<persName><forename type="first">K</forename><surname>Kageura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Umino</surname></persName>
		</author>
		<idno type="DOI">10.1075/term.3.2.03kag</idno>
		<ptr target="http://www.jbe-platform.com/content/journals/10.1075/term.3.2.03kag.doi:10.1075/term.3.2.03kag" />
	</analytic>
	<monogr>
		<title level="j">International Journal of Theoretical and Applied Issues in Specialized Communication</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="259" to="289" />
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Optimized Term Extraction Method Based on Computing Merged Partial C-Values</title>
		<author>
			<persName><forename type="first">V</forename><surname>Kosa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Chaves-Fraga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Dobrovolskyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Ermolayev</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-39459-2_2</idno>
		<ptr target="http://link.springer.com/10.1007/978-3-030-39459-2_2.doi:10.1007/978-3-030-39459-2_2" />
	</analytic>
	<monogr>
		<title level="m">Information and Communication Technologies in Education, Research, and Industrial Applications</title>
				<editor>
			<persName><forename type="first">V</forename><surname>Ermolayev</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Mallet</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Yakovyna</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><forename type="middle">C</forename><surname>Mayr</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Spivakovsky</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2020">2020</date>
			<biblScope unit="volume">1175</biblScope>
			<biblScope unit="page" from="24" to="49" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Approaches and Strategies to Extract Relevant Terms: How Are They Being Applied?</title>
		<author>
			<persName><forename type="first">J</forename><surname>Valaski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Reinehr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Malucelli</surname></persName>
		</author>
		<ptr target="http://worldcomp-proceedings.com/proc/p2015/ICA2668.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of The 2015 World Congress in Computer Science, Computer Engineering, and Applied Computing (WorldComp&apos;15)</title>
				<meeting>The 2015 World Congress in Computer Science, Computer Engineering, and Applied Computing (WorldComp&apos;15)<address><addrLine>Monte Carlo Resort, Las Vegas, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="478" to="484" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Feature-Less End-to-End Nested Term Extraction</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Yuan</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-32236-6_55</idno>
		<idno>doi:</idno>
		<ptr target="10.1007/978-3-030-32236-6_55" />
	</analytic>
	<monogr>
		<title level="m">Natural Language Processing and Chinese Computing</title>
				<editor>
			<persName><forename type="first">J</forename><surname>Tang</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M.-Y</forename><surname>Kan</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">D</forename><surname>Zhao</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Li</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Zan</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">11839</biblScope>
			<biblScope unit="page" from="607" to="616" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">Term Extraction via Neural Sequence Labeling a Comparative Evaluation of Strategies Using Recurrent Neural Networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kucza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Niehues</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zenkel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Waibel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Stüker</surname></persName>
		</author>
		<idno type="DOI">10.21437/Interspeech.2018-2017</idno>
		<ptr target="https://www.isca-speech.org/archive/interspeech_2018/kucza18_interspeech.html.doi:10.21437/Interspeech.2018-2017" />
	</analytic>
	<monogr>
		<title level="m">Interspeech 2018</title>
				<imprint>
			<publisher>ISCA</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="2072" to="2076" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Similarity Driven Unsupervised Learning for Materials Science Terminology Extraction</title>
		<author>
			<persName><forename type="first">S</forename><surname>Shah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S</forename></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Reddy</surname></persName>
		</author>
		<idno type="DOI">10.13053/cys-23-3-3266</idno>
		<ptr target="https://www.cys.cic.ipn.mx/ojs/index.php/CyS/article/view/3266.doi:10.13053/cys-23-3-3266" />
	</analytic>
	<monogr>
		<title level="j">Computación y Sistemas</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<monogr>
		<author>
			<persName><forename type="first">O</forename><surname>Lieber</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Sharir</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Lentz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Shoham</surname></persName>
		</author>
		<title level="m">Jurassic-1: Technical Details and Evaluation</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">9</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">mT5: A massively multilingual pre-trained text-to-text transformer</title>
		<author>
			<persName><forename type="first">L</forename><surname>Xue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Constant</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Roberts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kale</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Al-Rfou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Siddhant</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Barua</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Raffel</surname></persName>
		</author>
		<ptr target="https://aclanthology.org/2021.naacl-main.41" />
	</analytic>
	<monogr>
		<title level="m">Proc. of the 2021 Conference of the North American Chapter of the ACL: Human Language Technologies, ACL, Online</title>
				<meeting>of the 2021 Conference of the North American Chapter of the ACL: Human Language Technologies, ACL, Online</meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="483" to="498" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<monogr>
		<title level="m" type="main">Attention is all you need</title>
		<author>
			<persName><forename type="first">A</forename><surname>Vaswani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Shazeer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Parmar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Uszkoreit</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Jones</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">N</forename><surname>Gomez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Kaiser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Polosukhin</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/1706.03762" />
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<monogr>
		<title level="m" type="main">Language Models are Few-Shot Learners</title>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Mann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Ryder</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Subbiah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kaplan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Dhariwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Neelakantan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Shyam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Sastry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Askell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Herbert-Voss</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Krueger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Henighan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Child</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ramesh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Ziegler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Winter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hesse</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sigler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Litwin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Gray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Chess</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Berner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Mccandlish</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Radford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Sutskever</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Amodei</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2005.14165" />
		<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">Neural machine translation of rare words with subword units</title>
		<author>
			<persName><forename type="first">R</forename><surname>Sennrich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Haddow</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Birch</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/P16-1162</idno>
		<ptr target="http://aclweb.org/anthology/P16-1162.doi:10.18653/v1/P16-1162" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics</title>
		<title level="s">Association for Computational Linguistics</title>
		<meeting>the 54th Annual Meeting of the Association for Computational Linguistics</meeting>
		<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="1715" to="1725" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<analytic>
		<title level="a" type="main">Google&apos;s multilingual neural machine translation system: Enabling zero-shot translation</title>
		<author>
			<persName><forename type="first">M</forename><surname>Johnson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schuster</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><forename type="middle">V</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Krikun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Thorat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Viégas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Wattenberg</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Corrado</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transactions of the Association for Computational Linguistics</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="339" to="351" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b41">
	<analytic>
		<title level="a" type="main">Language models are unsupervised multitask learners</title>
		<author>
			<persName><forename type="first">A</forename><surname>Radford</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Child</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Luan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Amodei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Sutskever</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">OpenAI blog</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page">9</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b42">
	<monogr>
		<author>
			<persName><forename type="first">Y</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ott</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Goyal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Du</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Joshi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Levy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lewis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zettlemoyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Stoyanov</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1907.11692</idno>
		<title level="m">Roberta: A robustly optimized bert pretraining approach</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b43">
	<monogr>
		<author>
			<persName><forename type="first">V</forename><surname>Sanh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Debut</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Chaumond</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wolf</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1910.01108</idno>
		<title level="m">Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b44">
	<monogr>
		<author>
			<persName><forename type="first">K</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M.-T</forename><surname>Luong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><forename type="middle">V</forename><surname>Le</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">D</forename><surname>Manning</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2003.10555</idno>
		<title level="m">Electra: Pre-training text encoders as discriminators rather than generators</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b45">
	<monogr>
		<title level="m" type="main">Enriching Word Vectors with Subword Information</title>
		<author>
			<persName><forename type="first">P</forename><surname>Bojanowski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Grave</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Joulin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Mikolov</surname></persName>
		</author>
		<idno type="DOI">10.1162/tacl_a_00051</idno>
		<ptr target="https://doi.org/10.1162/tacl_a_00051.doi:10.1162/tacl_a_00051" />
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page" from="135" to="146" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b46">
	<analytic>
		<title level="a" type="main">A survey of named entity recognition and classification</title>
		<author>
			<persName><forename type="first">D</forename><surname>Nadeau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sekine</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Lingvisticae Investigationes</title>
		<imprint>
			<biblScope unit="volume">30</biblScope>
			<biblScope unit="page" from="3" to="26" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b47">
	<analytic>
		<title level="a" type="main">A Survey on Deep Learning for Named Entity Recognition</title>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Li</surname></persName>
		</author>
		<idno type="DOI">10.1109/TKDE.2020.2981314</idno>
		<ptr target="https://ieeexplore.ieee.org/document/9039685/.doi:10.1109/TKDE.2020.2981314" />
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Knowledge and Data Engineering</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="50" to="70" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b48">
	<analytic>
		<title level="a" type="main">Overview of SimpleText 2021 -CLEF Workshop on Text Simplification for Scientific Information Access</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bellot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Braslavski</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Experimental IR Meets Multilinguality, Multimodality, and Interaction</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">K</forename><forename type="middle">S</forename><surname>Candan</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Ionescu</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Goeuriot</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Larsen</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">H</forename><surname>Müller</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Joly</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Maistro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Piroi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="432" to="449" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b49">
	<analytic>
		<title level="a" type="main">Split and Rephrase</title>
		<author>
			<persName><forename type="first">S</forename><surname>Narayan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Gardent</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">B</forename><surname>Cohen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Shimorina</surname></persName>
		</author>
		<ptr target="https://www.aclweb.org/anthology/D17-1064" />
	</analytic>
	<monogr>
		<title level="m">Proc. of EMNLP 2017, ACL</title>
				<meeting>of EMNLP 2017, ACL<address><addrLine>Copenhagen, Denmark</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="606" to="616" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b50">
	<analytic>
		<title level="a" type="main">Robust disambiguation of named entities in text</title>
		<author>
			<persName><forename type="first">J</forename><surname>Hoffart</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Yosef</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Bordino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Fürstenau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Pinkal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Spaniol</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Taneva</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Thater</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Weikum</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. of EMNLP 2011</title>
				<meeting>of EMNLP 2011</meeting>
		<imprint>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="782" to="792" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b51">
	<analytic>
		<title level="a" type="main">INEX tweet contextualization task: Evaluation, results and lesson learned</title>
		<author>
			<persName><forename type="first">P</forename><surname>Bellot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Moriceau</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Tannier</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ipm.2016.03.002</idno>
		<ptr target="https://doi.org/10.1016/j.ipm.2016.03.002" />
	</analytic>
	<monogr>
		<title level="j">Inf. Process. Manage</title>
		<imprint>
			<biblScope unit="volume">52</biblScope>
			<biblScope unit="page" from="801" to="819" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b52">
	<analytic>
		<title level="a" type="main">CLEF 2017 Microblog Cultural Contextualization Lab Overview</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Goeuriot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mothe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Mulhem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J.-Y</forename><surname>Nie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-65813-1_27</idno>
		<ptr target="https://doi.org/10.1007/978-3-319-65813-1_27" />
	</analytic>
	<monogr>
		<title level="m">Experimental IR Meets Multilinguality, Multimodality, and Interaction -8th International Conference of the CLEF Association, CLEF 2017</title>
				<meeting><address><addrLine>Dublin, Ireland</addrLine></address></meeting>
		<imprint>
			<publisher>Proc</publisher>
			<date type="published" when="2017">September 11-14, 2017. 2017</date>
			<biblScope unit="page" from="304" to="314" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b53">
	<monogr>
		<title level="m" type="main">IR-BERT: Leveraging BERT for Semantic Search in Background Linking for News Articles</title>
		<author>
			<persName><forename type="first">A</forename><surname>Deshmukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Sethi</surname></persName>
		</author>
		<ptr target="http://adsabs.harvard.edu/abs/2020arXiv200712603A" />
		<imprint>
			<date type="published" when="2007">2007. 2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b54">
	<analytic>
		<title level="a" type="main">Covid or not Covid? Topic Shift in Information Cascades on Twitter</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">N</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<ptr target="https://hal.archives-ouvertes.fr/hal-03066857" />
	</analytic>
	<monogr>
		<title level="m">3rd International Workshop on Rumours and Deception in Social Media (RDSM) Collocated with COLING 2020, Proc. of the 3rd International Workshop on Rumours and Deception in Social Media (RDSM)</title>
				<editor>
			<persName><forename type="first">A</forename><forename type="middle">F C</forename><surname>Linguistics</surname></persName>
		</editor>
		<meeting><address><addrLine>Barcelona (on line), Spain</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="32" to="37" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b55">
	<monogr>
		<title level="m">Text Analysis Conference</title>
				<imprint>
			<publisher>TAC</publisher>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b56">
	<monogr>
		<ptr target="https://tac.nist.gov/2014/BiomedSumm/" />
		<title level="m">Biomedical Summarization Track</title>
				<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b57">
	<monogr>
		<author>
			<persName><forename type="first">D</forename><surname>Wadden</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Lin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">L</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Van Zuylen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Cohan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Hajishirzi</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2004.14974" />
		<title level="m">Fact or Fiction: Verifying Scientific Claims</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b58">
	<monogr>
		<author>
			<persName><forename type="first">P</forename><surname>Nakov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Corney</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Hasanain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Alam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Elsayed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Barrón-Cedeño</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Papotti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Shaar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D S</forename><surname>Martino</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2103.07769" />
		<title level="m">Automated Fact-Checking for Assisting Human Fact-Checkers</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b59">
	<monogr>
		<author>
			<persName><forename type="first">R</forename><surname>Pradeep</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Ma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Nogueira</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lin</surname></persName>
		</author>
		<ptr target="http://arxiv.org/abs/2010.11930" />
		<title level="m">Scientific Claim Verification with VERT5ERINI</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b60">
	<analytic>
		<title level="a" type="main">ArnetMiner: extraction and mining of academic social networks</title>
		<author>
			<persName><forename type="first">J</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Yao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Su</surname></persName>
		</author>
		<ptr target="http://dl.acm.org/citation.cfm?doid=1401890.1402008" />
	</analytic>
	<monogr>
		<title level="m">Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining -KDD 08</title>
				<meeting>eeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining -KDD 08<address><addrLine>Las Vegas, Nevada, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM Press</publisher>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page">990</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b61">
	<analytic>
		<title level="a" type="main">Automatic Simplification of Scientific Texts: SimpleText Lab at CLEF-2022</title>
		<author>
			<persName><forename type="first">L</forename><surname>Ermakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bellot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kamps</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Nurbakova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ovchinnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Sanjuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Mathurin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Araújo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Hannachi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Huet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Poinsu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advances in Information Retrieval</title>
				<editor>
			<persName><forename type="first">M</forename><surname>Hagen</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Verberne</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Macdonald</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Seifert</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><surname>Balog</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">K</forename><surname>Nørvåg</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Setty</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">13186</biblScope>
			<biblScope unit="page" from="364" to="373" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b62">
	<analytic>
		<title level="a" type="main">Semantic Differential Technique in the Comparative Study of Cultures1</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">E</forename><surname>Osgood</surname></persName>
		</author>
		<idno type="DOI">10.1525/aa.1964.66.3.02a00880</idno>
		<ptr target="https://onlinelibrary.wiley.com/doi/abs/10.1525/aa.1964.66.3.02a00880" />
	</analytic>
	<monogr>
		<title level="j">American Anthropologist</title>
		<imprint>
			<biblScope unit="volume">66</biblScope>
			<biblScope unit="page" from="171" to="200" />
			<date type="published" when="1964">1964</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b63">
	<analytic>
		<title level="a" type="main">A technique for the measurement of attitudes</title>
		<author>
			<persName><forename type="first">R</forename><surname>Likert</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Archives of Psychology</title>
		<imprint>
			<biblScope unit="volume">22</biblScope>
			<biblScope unit="page" from="55" to="55" />
			<date type="published" when="1932">1932</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b64">
	<analytic>
		<title level="a" type="main">Exploring the limits of transfer learning with a unified text-to-text transformer</title>
		<author>
			<persName><forename type="first">C</forename><surname>Raffel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Shazeer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Roberts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Narang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Matena</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">J</forename><surname>Liu</surname></persName>
		</author>
		<ptr target="http://jmlr.org/papers/v21/20-074.html" />
	</analytic>
	<monogr>
		<title level="j">Journal of Machine Learning Research</title>
		<imprint>
			<biblScope unit="volume">21</biblScope>
			<biblScope unit="page" from="1" to="67" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b65">
	<monogr>
		<title level="m">Proc. of the Working Notes of CLEF 2022: Conference and Labs of the Evaluation Forum, CEUR Workshop Proceedings</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Faggioli</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">N</forename><surname>Ferro</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Hanbury</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Potthast</surname></persName>
		</editor>
		<meeting>of the Working Notes of CLEF 2022: Conference and Labs of the Evaluation Forum, CEUR Workshop eedings</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
