<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Enhancing Semantic Resources via Large Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Laura Ventrice</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Siragusa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Turin</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2096</year>
      </pub-date>
      <abstract>
        <p>Large Language Models (LLMs) have generated a great deal of interest in a wide range of domains. These models are trained on diverse and extensive text corpora, allowing them to learn patterns, relationships, and semantic understanding across various domains. By inputting prompts, the LLM can generate informative and contextually relevant responses, which can be used to solve a wide range of Natural Language Processing (NLP) tasks. One of the most relevant task in NLP is the representation of knowledge, where extracted information are organized according to a definite structure; however, the bottleneck of this operation is the time and efort required by annotators to organize them. For this reason, we present the idea of automatically populate a Knowledge Base using LLMs. We chose the Semagram one given its slot-filler structure which can be easily translated into prompts. We experimented on two LLMs, Vicuna and Mosaic Pretrained Transformers, with diferent output lengths, reporting interesting results.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Knowledge Base</kwd>
        <kwd>Large Language Model</kwd>
        <kwd>Machine Learning</kwd>
        <kwd>Neural Networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        existing approaches, the concept of semantic gram, or Semagram, was proposed in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], creating
a flexible structure in which each concept is encoded via a slot-filler structure. However, the
major problem of these Knowledge Bases (KBs) is the efort necessary to build them because
they require several domain experts and annotators over a long period of time.
      </p>
      <p>
        In order to automatically scale the process of extending a KB, we thought that LLMs could
be used to retrieve new concepts that could be possibly added. These models contain a vast
knowledge, since they are trained over billions of textual data, and can be instructed to return
new entries that satisfy a given condition via the prompt. Although any KB entry could be
translated into a prompt, we decided to focus on the Semagram KB[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], given its slot-filler
structure.
      </p>
      <p>To the best of our knowledge, this is the first paper that tries to use the LLMs to populate a
Knowledge Base. Our contribution is thus twofold:
1. We converted all &lt;slot, filler &gt; pairs into a prompt for the Large Language Models. The
mapping takes into account the category and the Part-Of-Speech tag of the filler to
generate the input;
2. We experimented on two LLMs with 7 billions of parameters: Vicuna and Mosaic
Pretrained Transformer. For both models, we reported their Precision, Recall and F-Measure
on diferent output lengths.</p>
      <p>The remain of this paper is structured as follows: Section 2 contains the related works;
Section 3 describes the Semagram Knowledge Base, reporting the description of each slot and
some statistics; Section 4 describes how we defined the prompt and the problem we found in
converting the slots; Section 5 reports the results on the two LLMs. Finally, Section 6 concludes
the paper.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <p>
        Large Language Models. Large Language Models (LLMs), generally based on the Tranformer
architecture [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], are pre-trained over massive unlabeled text. In the last years, they are
becoming prevalent in the field of Natural Language Processing given their zero- and few-shot
generalization ability. The most successful example is ChatGPT[
        <xref ref-type="bibr" rid="ref5 ref6">6, 5</xref>
        ], which made a wide impact
on both AI research community and society. On the trend of ChatGPT, other reseach group
and companies have released their open-source models, such as Bloom[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Vicuna [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Mosaic
Pretrained Transformer [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] or LLaMA [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] among the others.
      </p>
      <p>
        Knowledge Bases. Semagram[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] is based on the concept of semantic gram defined by
Moerdijk et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] to address the existing approaches to concept representation, providing
a more formal description and a reduced number of slots (only 26 compared to the 200 of
Moerdijk et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]). It also include several features from other resources, such as Property
Norms[
        <xref ref-type="bibr" rid="ref19">19, 20</xref>
        ] and the Visual Attributes[21]. Other resources that organize the lexical-semantic
knowledge are: WordNet[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and BabelNet[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] that provide a human-readable concept
definitions; ConceptNet[22, 23] constructed from the MIT Open Mind Common Sense project1 and
regarding common-sense knowledge, i.e. shared and general facts or views of a set of concepts;
1https://www.media.mit.edu/projects/open-mind-common-sense/overview/
or FrameNet[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], which is based on the theory of frame defined by Fillmore et al. [24] where a
meaning is encoded via simple slot-filler structure.
      </p>
      <p>In the context of Knowledge Bases (KBs), our goal is to automatically expand the Semagram
Knowledge Base using the Large Language Models. To the best of our knowledge, this is the first
work that tries to use these models to accomplish such objective; other research papers used
Open Information Extraction (OIE) methods[25, 26, 27] to create or expand KBs. For instance,
Nakashole et al. [28] applied OIE to automatically build a taxonomy; Carlson et al. [29] and
Speer and Havasi [30] used OIE to extend an existing ontology; and Siragusa et al. [31] extended
the work of Cimiano and Wenderoth [32, 33] on the Qualia structure[34].</p>
    </sec>
    <sec id="sec-3">
      <title>3. Semagram Knowledge Base</title>
      <p>
        The Semagram Knowledge Base (KB)[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] is a flexible structure which encodes the semantic of a
given concept via a slot-filler structure. The current version 2 is composed of 297 concepts and
26 slots; each concept (or filler) has a Babelnet 3 synset associated to it. Table 1 reports some
statistics about the Semagram Knowledge Base, while Table 2 describes the 26 slots and their
description.
      </p>
      <p>
        It has been constructed by initially defining a set of 20 concepts over 10 categories: animals,
food, vehicles, clothes, home, appliance, instruments, artifacts, tools and containers; then, the
authors translated the concepts in Dutch and collected all the semagrams presented in the AWN
dictionary [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], Property Norms [
        <xref ref-type="bibr" rid="ref19">19, 20</xref>
        ] and the Visual Attributes [21].
      </p>
      <p># concepts
# slots
# fillers
avg. slots per concept
avg. concepts per category
avg. fillers per category</p>
    </sec>
    <sec id="sec-4">
      <title>4. The Prompt</title>
      <p>
        Our aim in this paper is to automatically populate the Semagram KB using Large Language
Models (LLMs) [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5">2, 5, 4, 3</xref>
        ] since they contain common knowledge. These models are based on
the transformer architecture[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and trained using billions of data; since they are generative
models, it is possible to query them using a prompt, i.e. a sentence written in Natural Language
expressing an instruction. Hence, our research objectives are the following:
2You can download it at: https://github.com/SapienzaNLP/Semagrams
3https://babelnet.org/
      </p>
      <p>S11:</p>
      <sec id="sec-4-1">
        <title>ToUse</title>
        <p>Slot Description Criteria
S1: accessory All those objects that may have to do with X. The con- may have to do with
straint is that there must be a physical contact and that {filler}
the use of such object is strictly necessary for X.</p>
      </sec>
      <sec id="sec-4-2">
        <title>S2: activity All actions that X can actively or consciously do. can be {filler}</title>
      </sec>
      <sec id="sec-4-3">
        <title>S3: behavior All the psychological features of X, including his attitude can be {filler}</title>
        <p>to his nature.</p>
        <p>S4: bodyPart All the body parts which are involved in interacting with can have or be used</p>
        <p>X. with {filler}</p>
      </sec>
      <sec id="sec-4-4">
        <title>S5: colorPat- All the features that refer to the color or texture of X. can be {filler}</title>
        <p>tern
S6: can be {filler}
tency</p>
      </sec>
      <sec id="sec-4-5">
        <title>S7: content</title>
        <p>consis- All the entries with which the noticeable to the touch
consistency or texture of X can be described.</p>
      </sec>
      <sec id="sec-4-6">
        <title>All the entities which might be contained within X, with- contain {filler} out being constitutive parts of it.</title>
      </sec>
      <sec id="sec-4-7">
        <title>S8: eficiency Positive (eficiency) or negative (inef.) features of X re- can be {filler}</title>
        <p>lated to his function.</p>
      </sec>
      <sec id="sec-4-8">
        <title>S9: general- Classification of X related to hypernyms. are {filler}</title>
        <p>ization</p>
      </sec>
      <sec id="sec-4-9">
        <title>S10: group</title>
        <p>belong to {filler}</p>
      </sec>
      <sec id="sec-4-10">
        <title>Names that indicates a group of animals of the same species of X. how- All the actions or states required to operate, employ, Type of {filler}: interact with or perceive the existence of X.</title>
      </sec>
      <sec id="sec-4-11">
        <title>S12: material</title>
      </sec>
      <sec id="sec-4-12">
        <title>Material of which X is composed.</title>
        <p>S13:
ment</p>
        <p>move- Terms that describe the type and speed of movement.</p>
      </sec>
      <sec id="sec-4-13">
        <title>S14: part</title>
      </sec>
      <sec id="sec-4-14">
        <title>S15: place</title>
      </sec>
      <sec id="sec-4-15">
        <title>S16: product</title>
      </sec>
      <sec id="sec-4-16">
        <title>S17: purpose</title>
      </sec>
      <sec id="sec-4-17">
        <title>All the constitutive parts of X, with which it is normally presented.</title>
      </sec>
      <sec id="sec-4-18">
        <title>All the entities in which X can be experienced, found or perceived.</title>
      </sec>
      <sec id="sec-4-19">
        <title>All types of entity that can be derived from X through its processing or through natural processes. All of the purposes for which X is interacted with.</title>
        <p>• V or N: can be used
for {filler}
• A: can be used
when {filler}
made
of
can be
{filler}
Type of {filler}:
• N or V:</p>
        <p>{filler}
• A: are {filler}
can
can have {filler}
can be found or used
in {filler}
can be used to make
{filler}</p>
      </sec>
      <sec id="sec-4-20">
        <title>Type of {filler}:</title>
        <p>• V: are used to
{filler}
• N: are used for
{filler}</p>
      </sec>
      <sec id="sec-4-21">
        <title>S18: shape</title>
      </sec>
      <sec id="sec-4-22">
        <title>S19: size</title>
      </sec>
      <sec id="sec-4-23">
        <title>S20: smell</title>
        <p>Form of X. can be {filler}
Size of X. can be {filler}</p>
      </sec>
      <sec id="sec-4-24">
        <title>All the entries with which the smell of X can be described. can smell {filler}</title>
      </sec>
      <sec id="sec-4-25">
        <title>The power mode that allows the functioning of X.</title>
      </sec>
      <sec id="sec-4-26">
        <title>It contains information on the taste of a food. All the entries which link X with the time flow or with specific moments of time.</title>
        <p>• A: sound {filler}
• V or N: can
{filler}
are {filler}
use {filler}
can be {filler}</p>
      </sec>
      <sec id="sec-4-27">
        <title>Type of category:</title>
        <p>• Animals: live
during {filler}
• otherwise: can be
consumed or used
during {filler}</p>
      </sec>
      <sec id="sec-4-28">
        <title>S26: user</title>
      </sec>
      <sec id="sec-4-29">
        <title>All the kinds of living beings which are able to operate, are used by {filler} employ, interact with or perceive X.</title>
        <p>RO1: How to convert a slot into a text for the prompt
RO2: How to define the prompt to query the LLM and retrieve new concepts for the Semagram</p>
        <p>KB</p>
        <sec id="sec-4-29-1">
          <title>4.1. Converting the Slot</title>
          <p>We started by analyzing the description of each slot in order to translate them into instructions.
We found they follow simple ontology relations; for instance, the slot material can be translated
in “can be made of ”. We thus decided to create a simple sentence that poses a criteria to the
LLM. In this way, the model has to find all concepts that satisfy such constraint. Given the slot
howToUse, we translated it in</p>
          <p>can be used for {filler}
where the placeholder {filler} is a filler present in a category (e.g., cut for the category food).</p>
          <p>For some slots, we discovered it is not possible to map them into a single criteria (e.g.,
bodyPart) because the filler does not fit with the passive form of the sentence. For this reason,
we decided to write the condition as the disjunction of the active and passive form. Other slots,
instead, require either the category of the concept or the Part-Of-Speech of the filler. Table 2
reports the defined criteria for each slot.</p>
        </sec>
        <sec id="sec-4-29-2">
          <title>4.2. Creating The Prompt</title>
          <p>Once the slots are converted, we created a simple and general prompt as follows:
Provide a list of 10 words that belong to the category and
satisfy the condition.</p>
          <p>Desired output: comma separated list of words.</p>
          <p>Category: {category}
Condition: {slot_criteria}</p>
          <p>Output:</p>
          <p>The first line contains the instruction for the model, i.e. it specifies what the model has to
return and the constraints to satisfy, defined in “ Category” and “Condition”. The former
contains a category of the Semagram Knowledge Base (e.g., animal); the latter reports the criteria
of the selected slot and filler. We only used the slots and fillers present in the chosen category.
The last line, “Output:”, prioritizes the generation of the output by the model. Omitting this
keyword will free the LLM to create any text before returning the concepts.</p>
          <p>The resulting number of prompts is 3762.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments</title>
      <p>
        For our experiments, we chose Vicuna[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and Mosaic Pretrained Transformer (MPT) [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] models.
The former is an open-source Large Language Model (LLM) based on LLaMA[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and fine-tuned
on user-shared conversations; the latter is a decoder-style transformer fine-tuned for short-form
instructions (i.e. MPT-instruct). For both the models, we used the version with 7 billions of
parameters; we set temperature to 0.35, top probability to 0.7 and the number of beams to 4.
      </p>
      <p>We tested 32, 64 and 128 tokens for the maximum output length of the model. We noticed
that increasing the output length could improve the capability of the model to generate better
answers. However, there were cases where a long output led to disruptive results; for instance,
the model produced more bullet lists instead of comma separated ones. We also tested 256
tokens, finding that the output is similar to the 128 ones. The models were run on an NVidia
RTX A6000, taking about 18 hours of computation to emit all the results.</p>
      <p>We evaluated the models via Precision, Recall and F-Measure. Given c = {,1, ,2, . . . , ,}
as the set of concepts returned by the i-th prompt and k = {1, 2, . . . , } as the set of
concepts present in the Semagram Knowledge Base (KB), Precision is the ratio between the
number of concepts generated by the model and present in the KB and c:
  =
1 ∑|︁| |c ∩ k|
| | =1 |c|
(1)
where | | is the total number of prompts.</p>
      <p>The Recall is similar to the Precision function, with the diference that we divided by the
number of concepts of the Semagram KB belonging to the prompt’s category (k):
 =
1 ∑|︁|</p>
      <p>|c ∩ k|
| | =1 |k|</p>
      <p>* 
 −   = 2 *   + 
Finally, we calculated the F-Measure as the harmonic mean between Precision and Recall:
Notice that these measures give a partially insight of the performance of the prompt on a
specific Large Language Model; their downside is that they are not able to evaluate the quality
of the prompt (and the model) in returning new entries for the Semagram KB. In the future, we
will perform a manual evaluation of the returned concepts.</p>
      <sec id="sec-5-1">
        <title>5.1. Results</title>
        <p>We found that in some cases the models either returned no results or the output text was
diferent from the requested one (i.e., a bullet list). We think this may be caused by either the
prompt or the model (e.g., the number of parameters4). In order to give a quantitative idea of
what we noticed, Table 5 reports the number of outputs in bullet-list form (not in comma-list
form as requested) and the number of empty outputs (i.e., empty lines). From the table, it
is possible to see that Vicuna-7B returned the desired output format more frequently than
MPT-7B-Instruct; on the other hand, this latter one produced less empty lines. As future work,
we are interested to investigate the reasons behind this phenomenon using diferent types of
prompt (i.e. one-shot, few-shot or Chain-of-Thoughts) and LLMs.</p>
        <p>Finally, we report in Table 6 the result of the condition “are used by cooks” for the animal
category; we can notice that both models generated the word dog. This is another problem of
4More parameters mean a better LLM that is able to follow accurately the prompt instructions.</p>
        <sec id="sec-5-1-1">
          <title>Vicuna-7B MPT-7B</title>
          <p>LLMs that we are interested to study, since biases and inaccuracies present in the training data
can be propagated into the KB.</p>
          <p>List of concepts
dog, chicken, beef, pork, lamb, fish, shrimp, lobster, crab, oyster
dog, chicken, beef, lamb, pork, duck, goose, turkey, fish, shrimp
dog, chicken, beef, lamb, pork, duck, goose, turkey, fish, shrimp
dog, cat, cow, sheep, pig, chicken, turkey, duck, goose, ostrich
dog, cat, cow, pig, sheep, chicken, turkey, duck, goose, ostrich
dog, cat, cow, pig, sheep, chicken, turkey, duck, goose, ostrich</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions and future work</title>
      <p>
        In this paper, we presented a preliminary work to automatically extend the Semagram Knowledge
Base[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] using Large Language Models (LLMs). First, we defined the prompt for the LLMs
mapping the &lt;slot, filler &gt; pairs to a text-based constraint. Then, we evaluated two LLMs in
returning concepts that are suitable for the Semagram KB. We used Vicuna and MPT-Instruct
with 7 Billions of parameters for our experiments, discovering that the former one performed
well on the task in terms of F-Measure. Furthermore, we found that increasing the output length
has a negative impact on the performance of the model.
      </p>
      <p>As future work, we are interested to explore how many new concepts, not present in the
Semagram KB, are returned by the LLM, as well as diferent kinds of prompt (such as a
fewshot or Chain-of-Thoughts prompt) and models. We will also investigate how the number of
parameters of the LLM impacts on the quality of the results.
for a large set of living and nonliving things, Behav. r. m. 37 (2005) 547–559.
[20] B. J. Devereux, L. K. Tyler, J. Geertzen, B. Randall, The cslb concept property norms,</p>
      <p>Behavior research methods 46 (2014) 1119–1127.
[21] C. Silberer, V. Ferrari, M. Lapata, Models of semantic representation with visual attributes,
in: Proceedings of the 51st Annual Meeting of the Association for Computational
Linguistics (Volume 1: Long Papers), Association for Computational Linguistics, Sofia, Bulgaria,
2013, pp. 572–582. URL: https://aclanthology.org/P13-1056.
[22] R. Speer, C. Havasi, J. CHAIDEZ, J. VENEZUELA, Y. KUO, Conceptnet 5, Tiny Transactions
of Computer Science (2012).
[23] R. Speer, J. Chin, C. Havasi, Conceptnet 5.5: An open multilingual graph of general
knowledge, in: Proceedings of the AAAI conference on artificial intelligence, volume 31,
2017.
[24] C. J. Fillmore, et al., Frame semantics, Cognitive linguistics: Basic readings 34 (2006)
373–400.
[25] M. Banko, M. J. Cafarella, S. Soderland, M. Broadhead, O. Etzioni, Open information
extraction from the web., in: IJCAI, volume 7, 2007, pp. 2670–2676.
[26] F. Wu, D. S. Weld, Open information extraction using wikipedia, in: Proceedings of the
48th Annual Meeting of the Association for Computational Linguistics, Association for
Computational Linguistics, 2010, pp. 118–127.
[27] A. Moro, R. Navigli, Integrating syntactic and semantic analysis into the open information
extraction paradigm., in: IJCAI, 2013.
[28] N. Nakashole, G. Weikum, F. Suchanek, Patty: a taxonomy of relational patterns with
semantic types, in: Proceedings of the 2012 Joint Conference on Empirical Methods in
Natural Language Processing and Computational Natural Language Learning, Association
for Computational Linguistics, 2012, pp. 1135–1145.
[29] A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. Hruschka Jr, T. M. Mitchell, Toward an
architecture for never-ending language learning., in: AAAI, volume 5, 2010, p. 3.
[30] R. Speer, C. Havasi, Representing general relational knowledge in conceptnet 5., in: LREC,
2012, pp. 3679–3686.
[31] G. Siragusa, V. Leone, L. Di Caro, C. Schifanella, Discovering relational phrases for qualia
roles through open information extraction, in: Knowledge Engineering and Semantic
Web: 8th International Conference, KESW 2017, Szczecin, Poland, November 8-10, 2017,
Proceedings 8, Springer, 2017, pp. 69–84.
[32] P. Cimiano, J. Wenderoth, Automatically learning qualia structures from the web, in:
Proceedings of the ACL-SIGLEX workshop on deep lexical acquisition, Association for
Computational Linguistics, 2005, pp. 28–37.
[33] P. Cimiano, J. Wenderoth, Automatic acquisition of ranked qualia structures from the
web, in: ACL 2007, Proceedings of the 45th Annual Meeting of the Association for
Computational Linguistics, 2007.
[34] J. Pustejovsky, The generative lexicon, Computational linguistics 17 (1991) 409–441.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Akiki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pavlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Castagné</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yvon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallé</surname>
          </string-name>
          , et al.,
          <article-title>Bloom: A 176b-parameter open-access multilingual language model</article-title>
          ,
          <source>arXiv preprint arXiv:2211.05100</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.-L.</given-names>
            <surname>Chiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , L. Zheng,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>Gonzalez</surname>
          </string-name>
          , et al.,
          <article-title>Vicuna: An open-source chatbot impressing gpt-4 with 90%* chatgpt quality</article-title>
          , See https://vicuna. lmsys.
          <source>org (accessed 14 April</source>
          <year>2023</year>
          ) (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
          </string-name>
          , et al.,
          <article-title>Llama: Open and eficient foundation language models</article-title>
          ,
          <source>arXiv preprint arXiv:2302.13971</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Roller,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Artetxe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dewan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Diab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. V.</given-names>
            <surname>Lin</surname>
          </string-name>
          , et al.,
          <article-title>Opt: Open pre-trained transformer language models</article-title>
          ,
          <source>arXiv preprint arXiv:2205.01068</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5] OpenAI, Gpt-4
          <source>technical report</source>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>08774</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>[6] OpenAI, Introducing chatgpt</article-title>
          ., https://openai.com/blog/chatgpt,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Guu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <article-title>Finetuned language models are zero-shot learners</article-title>
          ,
          <source>arXiv preprint arXiv:2109.01652</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schuurmans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Chain of thought prompting elicits reasoning in large language models</article-title>
          ,
          <source>arXiv preprint arXiv:2201.11903</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kojima</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Reid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Matsuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Iwasawa</surname>
          </string-name>
          ,
          <article-title>Large language models are zero-shot reasoners</article-title>
          ,
          <source>ArXiv abs/2205</source>
          .11916 (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>Wordnet: a lexical database for english</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>38</volume>
          (
          <year>1995</year>
          )
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Navigli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Ponzetto</surname>
          </string-name>
          , Babelnet:
          <article-title>Building a very large multilingual semantic network</article-title>
          ,
          <source>in: Proc. of ACL, Association for Computational Linguistics</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>216</fpage>
          -
          <lpage>225</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C. F.</given-names>
            <surname>Baker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Fillmore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Lowe</surname>
          </string-name>
          ,
          <article-title>The berkeley framenet project</article-title>
          ,
          <source>in: COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics</source>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Z. S.</given-names>
            <surname>Harris</surname>
          </string-name>
          , Distributional structure,
          <source>Word</source>
          <volume>10</volume>
          (
          <year>1954</year>
          )
          <fpage>146</fpage>
          -
          <lpage>162</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>V.</given-names>
            <surname>Leone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Siragusa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Caro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Navigli</surname>
          </string-name>
          ,
          <article-title>Building semantic grams of human knowledge</article-title>
          ,
          <source>in: Proceedings of the Twelfth Language Resources and Evaluation Conference</source>
          , European Language Resources Association, Marseille, France,
          <year>2020</year>
          , pp.
          <fpage>2991</fpage>
          -
          <lpage>3000</lpage>
          . URL: https: //aclanthology.org/
          <year>2020</year>
          .lrec-
          <volume>1</volume>
          .
          <fpage>366</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: NIPS</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Team</surname>
          </string-name>
          ,
          <article-title>Introducing mpt-7b: A new standard for open-source, commercially usable llms</article-title>
          ,
          <year>2023</year>
          . URL: www.mosaicml.com/blog/mpt-7b, accessed:
          <fpage>2023</fpage>
          -03-28.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>F.</given-names>
            <surname>Moerdijk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tiberius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Niestadt</surname>
          </string-name>
          ,
          <article-title>Accessing the anw dictionary</article-title>
          ,
          <source>Information Systems</source>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>McRae</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Cree</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Seidenberg</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>McNorgan, Semantic feature production norms</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>