<!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>Knowledge Base-enhanced Multilingual Relation Extraction with Large Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tong Chen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Procheta Sen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zimu Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhengyong Jiang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jionglong Su</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Liverpool</institution>
          ,
          <addr-line>Liverpool, L69 3BX</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of AI and Advanced Computing, Xi'an Jiaotong-Liverpool University</institution>
          ,
          <addr-line>Suzhou, 215123</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Advanced Technology, Xi'an Jiaotong-Liverpool University</institution>
          ,
          <addr-line>Suzhou, 215123</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Relation Extraction (RE) is an essential task that involves comprehending relational facts between entities from natural language texts. However, existing research in RE, particularly those based on large language models (LLMs), is proven to fall short in the task due to their context unawareness (lack of fine-grained understanding), schema misalignment (misaligned with human-defined schema), and world knowledge ignorance (relying solely on internal parametric knowledge). In this paper, we propose a novel framework to address the aforementioned challenges. The framework consists of two stages, including 1) entity linking and 2) relation inference, by fully leveraging the eficacy of external knowledge bases (KBs) and LLMs in this task. We conduct extensive experiments in a multilingual setting and achieve state-of-the-art performance on the experimented datasets. The LLMs with external knowledge can typically outperform those without knowledge by a significant margin, indicating the efectiveness of our proposed framework.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Multilingual</kwd>
        <kwd>Relation Extraction</kwd>
        <kwd>Knowledge Bases</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Natural Language Processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Relation Extraction (RE) is an essential task in information extraction (IE) that aims to comprehend
relational facts between entities in natural language texts [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. For the first example in Table 1, given
an original input and an entity pair of interest (Apple Inc., iPhone), an RE model should be able to
predict the relationship between them, i.e., Appl →e−− −I− n−− c−− .− −   iPhone. The structured knowledge
obtained from RE models can support a variety of downstream applications, such as knowledge graph
construction or completion [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], question answering [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and dialogue systems [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Previous research usually formulates RE as a pairwise classification task with pre-trained language
models (PLMs), in which novel methods have been proposed [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. Recently, large language models
(LLMs) demonstrate promising performance in a variety of downstream tasks [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ] across several
paradigms, such as in-context learning (ICL) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], chain-of-thought (CoT) prompting [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], and fine-tuning.
However, they fall short in multiple specification-heavy tasks, including RE, whose performance under
particularly ICL is much behind state-of-the-art PLM-based methods [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Table 1 gives some examples
of mispredicted entity relationships using LLMs. Overall, the reasons why LLMs cannot perform well
in RE include their context unawareness, schema misalignment, and world knowledge ignorance:
1. Context Unawareness. The completion of RE requires a thorough and fine-grained
comprehension of the information in given contexts. However, LLMs with ICL usually lack fine-grained
context awareness, which results in disregarded or erroneous relation prediction [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In the
ifrst example in Table 1, LLMs should first thoroughly appreciate the context and the
connection between “Apple Inc.”, “device”, and “iPhone”; otherwise, they are unable to determine the
relationship between “Apple Inc.” and “iPhone”.
2. Schema Misalignment. RE models are required to predict the relationships between entities
from a human-labeled, pre-defined schema. However, the number of candidate relationships is
typically lengthy, and some relation types are misaligned between LLMs and human expectations
[
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. In the second example in Table 1, LLMs may confuse the two relation types, “work
for” and “part of ”, and make incorrect predictions on the relationship between “Armstrong” and
“NASA Astronaut Corps”.
3. World Knowledge Ignorance. World knowledge usually plays a vital role in RE, particularly in
understanding implicit relationships [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and domain-specific knowledge [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. However, LLMs
sufer in tasks that require rich world knowledge [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and solely rely on their internal parametric
knowledge [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In the third example in Table 1, LLMs may predict the relationship as “inventor”
rather than “discoverer” without thoroughly understanding the knowledge of “Albert Einstein”
and the “theory of relativity”.
      </p>
      <p>
        Knowledge bases (KBs) have been extensively employed in previous RE research. For example,
researchers leverage the relationships obtained from Freebase [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and Wikipedia infoboxes [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] to
classify the relationships between entities in texts. However, such relationships are typically noisy
and are not faithful to what is described in the given contexts [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The following research focuses on
denoising and learning context-dependent relationships, such as utilizing natural language inference
(NLI) with entailment prediction [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Nevertheless, as LLMs have demonstrated their abilities in
NLI [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and natural language reasoning [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], the capability of the combination of KBs and LLMs
requires further exploration to design contextual, aligned, and knowledgeable RE models. Moreover,
previous research on knowledge-enhanced RE primarily focuses on the English corpus, which limits
the adaptability of RE models to diferent linguistic contexts. This shortage hinders the development of
comprehensive IE systems in the multilingual setting.
      </p>
      <p>
        In this paper, we propose a novel framework for RE to address the aforementioned challenges by
making the process contextually aware, schema-aligned, world knowledge-considered. The framework
consists of two stages, entity linking and relation inference, that fully leverage the eficacy of KBs
and LLMs in this task. As shown in Figure 1, given an original document and two entities of interest,
we first link the entities to Wikidata [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], a large-scale multilingual KB, to ascertain the relationship
between the entities in the world knowledge and regard it as the candidate relationship in the document.
Subsequently, in the second stage, we use the ICL strategy on LLMs to determine whether the candidate
relationship actually takes place in the given context.
      </p>
      <p>
        We conduct extensive experiments in a multilingual setting using three widely used RE datasets:
DocRED [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], REBEL [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], and REDFM [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], with three LLMs: GPT-3.5, Llama 2 [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ], and Flan-T5-XL
[
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Experimental results demonstrate the efectiveness of our framework on all datasets, where the
performance of zero-shot RE on the models outperforms the cases without knowledge by a significant
margin. Additionally, it also achieves state-of-the-art performance on all three datasets and outperforms
ifne-tuned PLM-based methods, validating the eficacy of our proposed framework. We also conduct
additional analysis on the efectiveness of knowledge, the impact of scaling up model parameters, and the
coverage of knowledge in multilingualism to further demonstrate the efectiveness and generalizability
of our proposed method.
      </p>
      <p>The key contributions of this work are summarized as follows:
• We review the key literature on LLM-based RE thoroughly, and we argue that well-behaved RE
models should be contextually aware, schema-aligned, and world knowledge-considered.
• We propose a novel framework for RE, consisting of two stages: entity linking and relation
inference, to fully leverage the eficacy of KBs and LLMs in the RE task.
• Experimental results under a multilingual setting demonstrate the efectiveness and
generalizability of our method across diverse linguistic contexts with substantial improvements over
state-of-the-art baselines.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <sec id="sec-2-1">
        <title>2.1. Relation Extraction</title>
        <p>
          RE has been extensively studied over the past years due to its potency in various downstream applications.
Early research in RE focuses on sentence-level RE [
          <xref ref-type="bibr" rid="ref26 ref27">26, 27</xref>
          ], while some later approaches shift to the
document level, aiming to comprehend the relationships between entities across multiple sentences [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
The most commonly used methods for RE are sequence-based techniques, which essentially rely on
LSTM- or Transformer-based architectures [
          <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
          ], modeling complicated interactions between entities
while implicitly capturing long-distance relationships. Furthermore, graph neural networks (GNNs) are
also employed in RE due to their eficacy in representing and interacting with structured data. In this
process, researchers construct relevant graphs using words, mentions, entities, or sentences as nodes
and predict relationships by reasoning on the graph [
          <xref ref-type="bibr" rid="ref28 ref29">28, 29</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Knowledge-enhanced RE</title>
        <p>Knowledge-enhanced RE incorporates external knowledge information to comprehensively understand
the relations between entities. Some existing work utilizes external knowledge bases like Freebase
and Wikidata to improve the representation by using entity and relation information. Liu et al. [30]
injects triples from knowledge graphs into texts, transforming sentences into knowledge-enhanced
sentence trees. Chen et al. [31] proposes a knowledge-aware prompt-tuning approach with synergistic
optimization that incorporates knowledge from relation labels into RE. External knowledge can bridge
the gap between general domain data and domain-specific data, while general domain RE methods
are applied in specific domains. Roy and Pan [ 32] uses an entity-level knowledge graph in pre-trained
BERT for clinical RE, integrating medical information.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. LLM-based RE</title>
        <p>
          LLM-based RE has also been studied by researchers motivated by the generalized intelligence of LLMs in
various downstream tasks, such as information extraction [33], machine translation [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], and adversarial
attacks [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. However, previous research concludes that LLMs typically fall short in the RE task, whose
performance is much behind PLM-based approaches [
          <xref ref-type="bibr" rid="ref10">10, 34, 35</xref>
          ]. To overcome this, Zhang et al. [36]
proposes QA4RE, a framework to improve the performance of LLM by aligning RE with question
Source Text:
Apple Inc. is an American multinational
corporation and technology company
headquartered in Cupertino, California, in
Silicon Valley. […] Devices include the
iPhone, iPad, Mac, Apple Watch, Vision
Pro, and Apple TV.
        </p>
        <p>(Apple Inc., SPARQL Query
iPhone)
(Apple Inc., product produced, iPhone)</p>
        <p>Relationship: Product Produced
Entity Linking</p>
        <p>Relation Inference
Question: Is there such a
relationship “product produced”
between “Apple Inc.” and “iPhone”?</p>
        <p>Yes.
answering (QA) tasks. Wan et al. [37] proposes GPT-RE that utilizes task-aware representations and
reasoning logic to improve entity-relationship relevance and the capability of explaining input-label
mapping. Li et al. [38] suggests integrating LLM with an NLI module to construct relation triples in
response to the abundance of pre-defined relation types and the uncontrollability of LLMs.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <sec id="sec-3-1">
        <title>3.1. Problem Formulation</title>
        <p>We define our RE task as follows: Given a document  consisting of  sentences {1, 2, ...,  } ( is
the number of sentences within the document, and  = 1 indicates sentence-level RE) and an entity
pair of interest (ℎ, ), in which ℎ represents the head entity and  refers to the tail entity, the RE
model aims to determine the potential relationship between ℎ and  from a pre-defined schema. In
our task, a KB  is leveraged with world knowledge, and an LLM is utilized to identify the existence of
the relationship  retrieved form  between ℎ and  in the given document.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Entity Linking and Querying</title>
        <p>
          In the first stage of our proposed framework, we conduct entity linking and querying to obtain the
candidate relationships between the entities of interest, which are regarded as supervision of world
knowledge to the given entity pair. Entity linking is the process of linking recognized entity words to an
entity in a KB, which is a pioneering step in extracting construction information from unstructured text
[39]. In our framework, we link the labeled entity mentions to Wikidata [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], a large-scale multilingual
KB. Once the entities are linked, we introduce a query based on SPARQL1 to retrieve the relationships
between the linked entities and regard it as the candidate relationship between them. For the datasets
whose entities are annotated with coreference chains, we iterate the head and tail entities until a pair of
entities can be linked to Wikidata.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Relation Inference using LLMs</title>
        <p>
          After obtaining the candidate relationship between the entity pair of interest, in the second stage of
our proposed framework, we adopt LLMs to identify whether the relationship actually occurs in the
given context. Specifically, we leverage the ICL strategy [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] that conditions LLMs on a natural language
instruction and formulate the task as a QA task due to the capacity of LLMs to answer natural questions.
In accordance with the entity linking results in the first stage, we design separate prompts for the entity
        </p>
        <sec id="sec-3-3-1">
          <title>Instruction:</title>
        </sec>
        <sec id="sec-3-3-2">
          <title>Given information: {source_text}</title>
          <p>Is there such a relationship {relationship} between {head_entity} and {tail_entity}?</p>
        </sec>
        <sec id="sec-3-3-3">
          <title>Example:</title>
        </sec>
        <sec id="sec-3-3-4">
          <title>Coburg Peak is the rocky peak rising to 783m in Erul Heights on Trinity Peninsula in Graham Land, Antarctica.</title>
          <p>Head Entity: Trinity Peninsula
Tail Entity: Graham Land
Relationship: part of</p>
        </sec>
        <sec id="sec-3-3-5">
          <title>Output: Yes.</title>
        </sec>
        <sec id="sec-3-3-6">
          <title>Answer:</title>
          <p>(Trinity Peninsula, part of , Graham Land)</p>
        </sec>
        <sec id="sec-3-3-7">
          <title>Instruction:</title>
        </sec>
        <sec id="sec-3-3-8">
          <title>Given information: {source_text}</title>
        </sec>
        <sec id="sec-3-3-9">
          <title>Options of relations: {relation_list}</title>
        </sec>
        <sec id="sec-3-3-10">
          <title>Which relationship between {head_entity} and {tail_entity} can be inferred from given options? (Please</title>
          <p>answer in English and only output the option)</p>
        </sec>
        <sec id="sec-3-3-11">
          <title>Example:</title>
        </sec>
        <sec id="sec-3-3-12">
          <title>Source Text: Utus Peak is the rocky peak rising to 1217m in Trakiya Heights on Trinity Peninsula in Graham</title>
        </sec>
        <sec id="sec-3-3-13">
          <title>Land, Antarctica. The peak is named after the ancient Roman town of Utus in Northern Bulgaria.</title>
        </sec>
        <sec id="sec-3-3-14">
          <title>Relaiton List: head of government, country, place of death, sibling, [...]</title>
          <p>Head Entity: Trakiya Heights
Tail Entity: Antarctica</p>
        </sec>
        <sec id="sec-3-3-15">
          <title>Output: continent</title>
        </sec>
        <sec id="sec-3-3-16">
          <title>Answer:</title>
          <p>(Trakiya Heights, continent, Antarctica)
pairs that have or have not been found potential relationships, and the prompts with separate examples
are illustrated in Tables 2 and 3. For the entity pairs that have been found candidate relationships in the
KB, we ask LLMs to determine whether they actually exist in the given context. Otherwise, we ask the
LLMs to classify the relationships between the entities from the schemas directly.</p>
          <p>This framework enables us to carry out a contextual, aligned, and knowledgeable RE process: it
regards the knowledge in KBs as supervision, and the inference with LLMs makes the predictions with
respect to the given contexts. Furthermore, since KBs are human-constructed world knowledge, their
candidate knowledge also conforms to human-defined schemas.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments and Analysis</title>
      <sec id="sec-4-1">
        <title>4.1. Datasets</title>
        <p>
          We conduct our experiments on the following three datasets, whose dataset statistics are organized in
Table 4:
• DocRED [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] is a document-level human-annotated RE dataset constructed from Wikipedia and
Wikidata. Since at least 40.7% of relational facts in DocRED can only be extracted from multiple
sentences, it requires models to comprehensively model the whole document to determine the
relationships between entities.
• REBEL [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] is a distantly supervised dataset, hyperlinking with Wikidata and Wikipedia for
relation extraction. It employs an NLI model to filter noise and address relations that are not
entailed by the Wikipedia text through entailment prediction.
• REDFM [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] is constructed for multilingual RE that involves seven languages. Diferent from the
REBEL dataset, REDFM not only applies NLI to filter noise but also conducts manual filtering to
ensure the annotation quality. We select the English (EN), Spanish (ES), and German (DE) subsets
to validate the performance of our framework in a multilingual setting.
        </p>
        <p>
          Following the previous work in LLM-based RE [
          <xref ref-type="bibr" rid="ref10">10, 34</xref>
          ], we sample a subset from the validation set
of DocRED and the test set of REBEL and REDFM to validate the performance of our method against
baselines. We evaluate the performance of the experimented models using micro F1-score.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Baselines</title>
        <p>
          We compare the performance of our proposed method on RE against the following baselines:
• KD-DocRE [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] is a semi-supervised framework for document-level RE that incorporates axial
attention, adaptive focal loss, and knowledge distillation to capture the interdependency among
entity-pairs. It addresses the class imbalance problem and the diferences between human
annotated and distantly supervised data in document-level RE.
• DREEAM [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] is a memory-eficient approach for improving document-level RE by incorporating
evidence and ofering a self-training strategy, addressing high memory consumption and limited
annotated data availability in document-level RE.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Experimental Setup</title>
        <p>
          We conduct our experiments on three commonly used multilingual LLMs: GPT-3.5, Llama 2 [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], and
Flan-T5 [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], and we access the models with diferent approaches and settings. For GPT-3.5, we call the
API by OpenAI2 and select the gpt-3.5-turbo-instruct checkpoint due to its ability to interpret and
execute human instructions seamlessly. For Llama 2 (Llama-2-7b-chat-hf) and Flan-T5 (flan-t5-xl),
the models are retrieved from the HuggingFace repository3. To mimic the randomness of human
reasoning and produce relatively stable outputs, we set the temperature of GPT-3.5 and Llama 2 as 0.2.
All experiments are conducted on a single NVIDIA GeForce RTX 4090 graphics card.
2https://platform.openai.com/
3https://huggingface.co/
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Main Results</title>
        <p>The experimental results of our proposed framework under diferent LLMs with and without external
knowledge are given in Table 5. From the table, we make the following observations:</p>
        <p>
          First, without the incorporation of external knowledge, LLMs have been shown to fall short in the
RE task and their performances are much behind those of the state-of-the-art baseline models. The
results are also consistent with the previous work [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], indicating the correctness of our implementation.
Among the three LLMs, Flan-T5 achieves the best performance and is remarkably close to the deliberated
baseline models, indicating its excellent document-level understanding and relation reasoning ability.
Llama 2 achieves the worst performance, with its results close to zero. We sample 50 outputs of Llama
2 and compare them with the ground truths. We conclude that this phenomenon is attributed to the
excessively uncontrollable and flexible nature of its output compared to the rest of the models.
        </p>
        <p>Second, after incorporating the external knowledge into the models, LLMs exhibit remarkable
performance across all datasets, in which the average improvements of GPT-3.5, Llama 2, and Flan-T5
are 52.90, 45.90, and 11.82, respectively. Notably, the performance of Flan-T5 under the zero-shot
setting achieves state-of-the-art results on all datasets, which is also better than the deliberated,
finetuned PLM-based methods. GPT-3.5 improves the most among the models, but there is still room between
the performance and the PLM-based methods. These results demonstrate that the performances of
LLMs with external knowledge in a zero-shot setting can be comparable to or even surpass the
finetuned PLM-based method on the RE task. They also underscore the efectiveness of our approach in
multilingual settings, which is not limited to the English context.</p>
        <p>Finally, the performance of the experimented models is consistent regardless of the language and
the existence of external knowledge. Flan-T5 consistently achieve the best performance across all
datasets, and Llama 2 exhibits comparatively lower performance, indicating that Flan-T5 has a better
performance and a robust generalization advantage when dealing with the RE task and can be regarded
as an ideal model in real-world application, while Llama 2 requires additional improvements for higher
performance.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Additional Analysis</title>
        <p>Efectiveness of External Knowledge First, we analyze the efectiveness of the external KB in our
proposed method. Since not all entity pairs can be linked to Wikidata, we calculate the percentage
of correct prediction of LLMs with and without the incorporation of external knowledge, denoted as
/ and /, calculated as:</p>
        <p># of Correct Prediction
/ = # of Entity Pairs Linked to Wikidata
(1)</p>
        <p>We visualize the calculation results in Figures 2 and 3, respectively. Our findings show a significant
diference in performance with and without incorporating knowledge across all datasets and LLMs.
Specifically, the correct prediction of LLMs with external knowledge is as high as more than 80%, while
the results without knowledge are inferior, among which only Flan-T5 can exceed 40%. Because of the
lfexible and uncontrollable nature of Llama 2, its correct predictions without external knowledge are
nearly zero, while after incorporating knowledge, its results improve to over 80%. The performance
diference indicates that a performance gap exists across diferent models—while all models can achieve
similar performance with external knowledge, their results are dominated by the relation classification
result without external knowledge, indicating that LLMs are good inferencers but not classifiers for
entity relationships. Moreover, although the performance of LLMs is better on the REBEL dataset with
the incorporation of external knowledge, it becomes worse on the models without knowledge due to
the large relation schema of the dataset. This remains a challenge for future research to design better
methods to deal with the entity pairs that cannot link to the KBs.</p>
        <p>Scaling Law We also analyze whether the performance of LLM-based RE can benefit from scaling up
the model parameters. Specifically, we select the Flan-T5 series models with four diferent model sizes:</p>
        <p>14.5%
Flan-T5-Small (80M), Flan-T5-Base (250M), Flan-T5-Large (780M), and Flan-T5-XL (3B) and evaluate the
performance of the models with and without external knowledge. As shown in Figure 4, a clear positive
scaling efect exists in LLM-based RE, i.e., fine-tuned larger models achieve better performance in the
RE task. We can also observe the role of external knowledge. After incorporating external knowledge
into the LLM, the increase in the number of model parameters has a smaller impact on the results.
Moreover, with external knowledge, Flan-T5-Small can surpass Flan-T5-Large, and Flan-T5-Base can
exceed Flan-T5-XL’s performance without external knowledge. This validates the efectiveness of both
LLMs and external knowledge when handling the RE task.</p>
        <p>Coverage of Knowledge in Multilingualism Given the multilingual support of the chosen LLMs,
we extend our investigation to include multilingual RE experiments using the REDFM dataset. The
experimental outcomes, as summarized in Table 5, reveal subpar performance when the LLMs attempt
multilingual RE tasks directly. However, integrating external knowledge significantly enhances
performance, prompting us to explore the coverage of Wikidata for the selected multilingual dataset. To this
end, we conduct supplementary experiments on REDFM-EN, REDFM-DE, and REDFM-ES to assess
the percentage of samples that could be linked to Wikidata for external knowledge, as illustrated in
Figure 5. The results indicate that a relatively high proportion of samples across the three languages
could be covered by Wikidata, with coverages nearing or exceeding 85%, specifically 85.5%, 84.5%,
and 84.1% for REDFM-EN, REDFM-DE, and REDFM-ES, respectively. The remaining 14.5%, 15.5%,
and 15.9% are attributed to entries not indexed by Wikidata, with a small fraction being inaccessible
due to unstable network connections.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion and Future Work</title>
      <p>In this paper, we propose a novel framework to address the current challenges of LLMs falling short in RE
tasks because of their context-unawareness and schema-misalignment, with world knowledge ignorance.
It consists of two stages: entity linking and relation inference, fully leveraging the eficacy of KBs and
LLMs in this task. We conduct experiments in a multilingual setting using three datasets and three
LLMs to validate the efectiveness of our framework, where the zero-shot RE with world knowledge
outperforms those without that by a significant margin and achieves state-of-the-art performance on
all experimental datasets, even better than fine-tuned PLM-based methods, indicating the efectiveness
of our proposed framework. We also conduct additional analysis on the efectiveness of knowledge, the
impact of scaling up model parameters, and the coverage of knowledge in multilingualism to further
demonstrate the efectiveness and generalizability of our proposed method. In the future, we will
conduct more detailed analysis on other related tasks, such as event relation extraction, to further
validate the efectiveness and generalizability of our proposed method.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgments</title>
      <p>This research is funded by the Postgraduate Research Scholarship (PGRS) at Xi’an Jiaotong-Liverpool
University, contract number FOSSP221001.
relation extraction, in: Findings of ACL-IJCNLP, 2021, pp. 524–534. URL: https://aclanthology.org/
2021.findings-acl.47. doi: 10.18653/v1/2021.findings-acl.47.
[30] W. Liu, P. Zhou, Z. Zhao, Z. Wang, Q. Ju, H. Deng, P. Wang, K-bert: Enabling language
representation with knowledge graph, Proceedings of AAAI 34 (2020) 2901–2908. URL: https:
//ojs.aaai.org/index.php/AAAI/article/view/5681. doi:10.1609/aaai.v34i03.5681.
[31] X. Chen, N. Zhang, X. Xie, S. Deng, Y. Yao, C. Tan, F. Huang, L. Si, H. Chen,
Knowprompt: Knowledge-aware prompt-tuning with synergistic optimization for relation extraction,
in: Proceedings of WWW, 2022, p. 2778–2788. URL: https://doi.org/10.1145/3485447.3511998.
doi:10.1145/3485447.3511998.
[32] A. Roy, S. Pan, Incorporating medical knowledge in BERT for clinical relation extraction, in:
Proceedings of EMNLP, 2021, pp. 5357–5366. URL: https://aclanthology.org/2021.emnlp-main.435.
doi:10.18653/v1/2021.emnlp-main.435.
[33] H. Peng, X. Wang, F. Yao, Z. Wang, C. Zhu, K. Zeng, L. Hou, J. Li, OmniEvent: A comprehensive, fair,
and easy-to-use toolkit for event understanding, in: Proceedings of EMNLP (Demo), 2023, pp. 508–
517. URL: https://aclanthology.org/2023.emnlp-demo.46. doi:10.18653/v1/2023.emnlp-demo.46.
[34] R. Han, T. Peng, C. Yang, B. Wang, L. Liu, X. Wan, Is information extraction solved by chatgpt? an
analysis of performance, evaluation criteria, robustness and errors, 2023. arXiv:2305.14450.
[35] B. Li, G. Fang, Y. Yang, Q. Wang, W. Ye, W. Zhao, S. Zhang, Evaluating chatgpt’s information
extraction capabilities: An assessment of performance, explainability, calibration, and faithfulness,
2023. arXiv:2304.11633.
[36] K. Zhang, B. Jimenez Gutierrez, Y. Su, Aligning instruction tasks unlocks large language models
as zero-shot relation extractors, in: Findings of ACL, 2023, pp. 794–812. URL: https://aclanthology.
org/2023.findings-acl.50. doi: 10.18653/v1/2023.findings-acl.50.
[37] Z. Wan, F. Cheng, Z. Mao, Q. Liu, H. Song, J. Li, S. Kurohashi, GPT-RE: In-context learning for
relation extraction using large language models, in: Proceedings of EMNLP, 2023, pp. 3534–3547.</p>
      <p>URL: https://aclanthology.org/2023.emnlp-main.214. doi:10.18653/v1/2023.emnlp-main.214.
[38] J. Li, Z. Jia, Z. Zheng, Semi-automatic data enhancement for document-level relation extraction with
distant supervision from large language models, in: Proceedings of EMNLP, 2023, pp. 5495–5505.</p>
      <p>URL: https://aclanthology.org/2023.emnlp-main.334. doi:10.18653/v1/2023.emnlp-main.334.
[39] W. Shen, J. Wang, J. Han, Entity linking with a knowledge base: Issues, techniques, and solutions,
IEEE Transactions on Knowledge and Data Engineering 27 (2015) 443–460. doi:10.1109/TKDE.
2014.2327028.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Gao</surname>
          </string-name>
          , X. Han,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Learning from Context or Names? An Empirical Study on Neural Relation Extraction</article-title>
          ,
          <source>in: Proceedings of EMNLP</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>3661</fpage>
          -
          <lpage>3672</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-main.
          <volume>298</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>298</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Entity-relation extraction as multi-turn question answering</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1340</fpage>
          -
          <lpage>1350</lpage>
          . URL: https://aclanthology.org/ P19-1129. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          -1129.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Madotto</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-S. Wu</surname>
          </string-name>
          , P. Fung,
          <article-title>Mem2Seq: Efectively incorporating knowledge bases into endto-end task-oriented dialog systems</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1468</fpage>
          -
          <lpage>1478</lpage>
          . URL: https: //aclanthology.org/P18-1136. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P18</fpage>
          -1136.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bing</surname>
          </string-name>
          , H. T. Ng,
          <article-title>Document-level relation extraction with adaptive focal loss and knowledge distillation</article-title>
          ,
          <source>in: Findings of ACL</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>1672</fpage>
          -
          <lpage>1681</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .findings-acl.
          <volume>132</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .findings-acl.
          <volume>132</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Okazaki</surname>
          </string-name>
          , DREEAM:
          <article-title>Guiding attention with evidence for improving documentlevel relation extraction</article-title>
          ,
          <source>in: Proceedings of EACL</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1971</fpage>
          -
          <lpage>1983</lpage>
          . URL: https://aclanthology. org/
          <year>2023</year>
          .eacl-main.
          <volume>145</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .eacl-main.
          <volume>145</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <article-title>Generating valid and natural adversarial examples with large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2311</volume>
          .
          <fpage>11861</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Na</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maimaiti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Rethinking human-like translation strategy: Integrating drift-difusion model with large language models for machine translation</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2402</volume>
          .
          <fpage>10699</fpage>
          .
        </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>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Sigler,
          <string-name>
            <given-names>M.</given-names>
            <surname>Litwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          , volume
          <volume>33</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . URL: https://proceedings. neurips.cc/paper_files/paper/2020/file/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.
        </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>
          , M. Bosma, b. ichter,
          <string-name>
            <given-names>F.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <article-title>Chainof-thought prompting elicits reasoning in large language models</article-title>
          ,
          <source>in: Proceedings of NeurIPS</source>
          , volume
          <volume>35</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>24824</fpage>
          -
          <lpage>24837</lpage>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2022/ ifle/9d5609613524ecf4f15af0f7b31abca4-Paper-Conference.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>When does in-context learning fall short and why? a study on specification-heavy tasks</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2311</volume>
          .
          <fpage>08993</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Si</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Friedman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <article-title>Measuring inductive biases of in-context learning with underspecified demonstrations</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>11289</fpage>
          -
          <lpage>11310</lpage>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>632</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>632</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          , W. Peng,
          <article-title>Knowledge-enriched event causality identification via latent structure induction networks</article-title>
          ,
          <source>in: Proceedings of ACL-IJCNLP</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>4862</fpage>
          -
          <lpage>4872</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>376</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>376</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Lai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. H.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <article-title>Joint biomedical entity and relation extraction with knowledgeenhanced collective inference</article-title>
          ,
          <source>in: Proceedings of ACL-IJCNLP</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>6248</fpage>
          -
          <lpage>6260</lpage>
          . URL: https: //aclanthology.org/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>488</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>488</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mallen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Asai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zhong</surname>
          </string-name>
          ,
          <string-name>
            <surname>R. Das</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Khashabi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Hajishirzi</surname>
          </string-name>
          ,
          <article-title>When not to trust language models: Investigating efectiveness of parametric and non-parametric memories</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>9802</fpage>
          -
          <lpage>9822</lpage>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>546</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>546</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Mintz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bills</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Snow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <article-title>Distant supervision for relation extraction without labeled data</article-title>
          ,
          <source>in: Proceedings of ACL-AFNLP</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>1003</fpage>
          -
          <lpage>1011</lpage>
          . URL: https://aclanthology.org/P09-1113.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. S.</given-names>
            <surname>Weld</surname>
          </string-name>
          ,
          <article-title>Learning 5000 relational extractors</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>286</fpage>
          -
          <lpage>295</lpage>
          . URL: https://aclanthology.org/P10-1030.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>New frontiers of information extraction</article-title>
          ,
          <source>in: Proceedings of NAACL-HLT (Tutorials)</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>14</fpage>
          -
          <lpage>25</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          . naacl-tutorials.3. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .naacl-tutorials.
          <volume>3</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>P.-L. Huguet</surname>
            <given-names>Cabot</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Navigli</surname>
          </string-name>
          , REBEL:
          <article-title>Relation extraction by end-to-end language generation</article-title>
          ,
          <source>in: Findings of EMNLP</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>2370</fpage>
          -
          <lpage>2381</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .findings-emnlp.
          <volume>204</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .findings-emnlp.
          <volume>204</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , M. Ma, C. Su,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          , W. Ma, HW-TSC at SemEval
          <article-title>-2023 task 7: Exploring the natural language inference capabilities of ChatGPT and pre-trained language model for clinical trial</article-title>
          ,
          <source>in: Proceedings of SemEval-2023</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1603</fpage>
          -
          <lpage>1608</lpage>
          . URL: https://aclanthology.org/
          <year>2023</year>
          .semeval-
          <volume>1</volume>
          .221. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .semeval-
          <volume>1</volume>
          .
          <fpage>221</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>L.</given-names>
            <surname>Pan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Albalak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Logic-LM:
          <article-title>Empowering large language models with symbolic solvers for faithful logical reasoning</article-title>
          ,
          <source>in: Findings of EMNLP</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>3806</fpage>
          -
          <lpage>3824</lpage>
          . URL: https: //aclanthology.org/
          <year>2023</year>
          .findings-emnlp.
          <volume>248</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .findings-emnlp.
          <volume>248</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>D.</given-names>
            <surname>Vrandečić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krötzsch</surname>
          </string-name>
          ,
          <article-title>Wikidata: a free collaborative knowledgebase</article-title>
          ,
          <source>Commun. ACM</source>
          <volume>57</volume>
          (
          <year>2014</year>
          )
          <fpage>78</fpage>
          -
          <lpage>85</lpage>
          . URL: https://doi.org/10.1145/2629489. doi:
          <volume>10</volume>
          .1145/2629489.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , M. Sun,
          <article-title>DocRED: A large-scale document-level relation extraction dataset</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>764</fpage>
          -
          <lpage>777</lpage>
          . URL: https://aclanthology.org/P19-1074. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          -1074.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>L.</given-names>
            <surname>Huguet Cabot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tedeschi</surname>
          </string-name>
          , A.
          <string-name>
            <surname>-C. Ngonga Ngomo</surname>
          </string-name>
          , R. Navigli,
          <article-title>REDfm: a filtered and multilingual relation extraction dataset</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>4326</fpage>
          -
          <lpage>4343</lpage>
          . URL: https://aclanthology. org/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>237</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2023</year>
          .
          <article-title>acl-long</article-title>
          .
          <volume>237</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Almahairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Babaei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Bashlykov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhargava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhosale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bikel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Blecher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Ferrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cucurull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Esiobu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fuller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hartshorn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosseini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Inan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kardas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kerkez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khabsa</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kloumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Korenev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Koura</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lavril</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Liskovich</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Martinet</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Mihaylov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mishra</surname>
            , I. Molybog,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Poulton</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Reizenstein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Rungta</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Saladi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Schelten</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>E. M.</given-names>
          </string-name>
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>X. E.</given-names>
          </string-name>
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Taylor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>J. X.</given-names>
          </string-name>
          <string-name>
            <surname>Kuan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
            , I. Zarov,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Kambadur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Narang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Stojnic</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Edunov</surname>
          </string-name>
          ,
          <source>T. Scialom, Llama</source>
          <volume>2</volume>
          :
          <article-title>Open foundation and fine-tuned chat models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2307</volume>
          .
          <fpage>09288</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Longpre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zoph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fedus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brahma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Webson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Suzgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Castro-Ros</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pellat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Valter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. H.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <source>Scaling instructionifnetuned language models</source>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2210</volume>
          .
          <fpage>11416</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>P.</given-names>
            <surname>Verga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Strubell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>McCallum</surname>
          </string-name>
          ,
          <article-title>Simultaneously self-attending to all mentions for full-abstract biological relation extraction</article-title>
          ,
          <source>in: Proceedings of NAACL-HLT</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>872</fpage>
          -
          <lpage>884</lpage>
          . URL: https: //aclanthology.org/N18-1080. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>N18</fpage>
          -1080.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>L.</given-names>
            <surname>Baldini Soares</surname>
          </string-name>
          , N. FitzGerald, J. Ling, T. Kwiatkowski,
          <article-title>Matching the blanks: Distributional similarity for relation learning</article-title>
          ,
          <source>in: Proceedings of ACL</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>2895</fpage>
          -
          <lpage>2905</lpage>
          . URL: https:// aclanthology.org/P19-1279. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>P19</fpage>
          -1279.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Double graph based reasoning for document-level relation extraction</article-title>
          ,
          <source>in: Proceedings of EMNLP</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1630</fpage>
          -
          <lpage>1640</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          . emnlp-main.
          <volume>127</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-main.
          <volume>127</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chang</surname>
          </string-name>
          , SIRE:
          <article-title>Separate intra- and inter-sentential reasoning for document-level</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>