<!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>Applying Large Language Models for Enhancing Contract Drafting</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kwok-Yan Lam</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Victor C.W. Cheng</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zee Kin Yeong</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Nanyang Technological University</institution>
          ,
          <country country="SG">Singapore</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Singapore Academy of Law</institution>
          ,
          <country country="SG">Singapore</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>TAU Express Pte Ltd</institution>
          ,
          <country country="SG">Singapore</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper investigates the use of traditional AI and generative AI techniques in enhancing the work of legal professionals. We propose an approach that applies a combination of AI techniques, traditional AI augmented with generative models for automating some of the laborious tasks in contract drafting. With the launches of advanced AI models such as ChatGPT, legal professionals are anticipating how such technologies can streamline their works. We first introduce how these models generate text contents given a user prompt. Then we propose some practical approaches in “prompt writing” which enable better and more coherent contract clauses to be generated. As privacy is typically a great concern in using ChatGPT in professional domains, we also explore the feasibility and effectiveness of using on-premises Large Language Models (LLMs) such as “Vicuna” as practical alternatives that may address the privacy issues while producing acceptable performance in contract drafting. Since AI generated clauses may not match the strict legal requirements or even be incorrect, we propose an approach to evaluate the clauses with traditional AI by using sentence transformers to retrieve similar clauses from a trusted source and perform automatic content similarity analysis. Experimental results using the public dataset LEDGAR showed that LLMs are useful tools for contract clause drafting and the automated comparison results can work as hints or recommendations that users can consider to revise and enhance the generated clauses, hence simplifying the task of contract drafting by legal professionals in an augmented intelligence manner.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;LLMs</kwd>
        <kwd>ChatGPT</kwd>
        <kwd>clause recommender</kwd>
        <kwd>contract drafting</kwd>
        <kwd>hallucination</kwd>
        <kwd>AI safety</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Contracts are legally binding between parties
and sets out the agreement between them of their
respective rights and obligations. They are usually
written in text format and contain clauses setting
out specific terms and conditions that capture their
agreement. The textual nature of contracts
presents a great potential for using natural
language processing (NLP) to contribute and
assist the drafting process. But unlike other NLP
tasks, words and phrases in contracts must be
carefully used to precisely, unambiguously, and
accurately capture the agreement between the
parties and this pose a great challenge to
researchers.</p>
      <p>
        In general, contract drafting typically
involves a two-step process [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], as follows:


      </p>
      <sec id="sec-1-1">
        <title>Selecting a contract template which</title>
        <p>contains clauses that match with the
situation or context of the specific
agreement being entered into; and
Modifying the clauses to capture the
specific context and details agreed
between the parties.</p>
        <p>
          These tasks require manual effort and domain
knowledge, especially the second task which
needs particularized information, accurate
understanding and sophisticated thought-process.
With the recent launches of ChatGPT [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and
some LLMs such as LLaMA [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], contracts can be
generated automatically, given a user description
(known as prompt) which consists of the contract
context and the requirements. This paper focuses
on: (a) generation of clauses with LLMs, and (b)
identifying the aforementioned aspects in the
clauses. Task (b) is very significant because the
clauses obtained from (a), or contract templates,
may not be usable, or cannot meet specific needs
and circumstances, and require amendments.
Moreover, LLMs are almost invariably viewed as
“black box”, and the outputs are less explainable.
For example, there is a phenomenon called
hallucination that LLMs output results are not
realistic, do not follow user given context or
match any data patterns that it has been trained on.
There is a need to identify any missed aspects or
extraneous aspects in order to help users to
improve the quality of the clauses and reduce risks.
To the best of our knowledge, this may be the first
effort towards safe use of generative AI by
performing post-validation of the
machinegenerated contract clauses using machine learning
approaches.
        </p>
        <p>Figure 1 describes the overall process of our
proposed method for analyzing raw clauses.
Detailed description is given in Section 5.</p>
        <p>The rest of this paper is organized as follows:
Section 2 reviews the related work. Section 3
introduces the working principles of LLMs and
Section 4 illustrates practical prompts that can be
used to generate clauses. Section 5 describes the
approach for analyzing and comparing generated
clauses against similar clauses retrieved from a
trusted source. Section 6 introduces the used
dataset and evaluation methods and presents the
experimental results. Section 7 presents the
conclusions.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>
        Contract clause generation has become one of
the research focuses when transformer decoders
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] are introduced. Aggarwal et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] proposed
CLAUSEREC framework for clause type and
clause content recommendation. It predicts the
clause type and generate the corresponding
content that users can consider to add to an
incomplete contract. In their work, the
recommended clauses are generated by a
transformer decoder based on the vector
representations of the clause type and the
incomplete contract. Joshi et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] further
enhanced this work by identifying similar
contracts and adding the similar contract
representations to the clause generation process.
      </p>
      <p>
        Regarding clause keyphrases (including
keywords) identification, [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] investigated the
performance of various traditional machine
learning approaches including logistic regression,
SVMs [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and manually written rules. On the
other hand, [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] introduced a BERT based model
called ALeaseBERT fine-tuned on lease
agreements for the extraction of specified types of
keyphrases and red flags, if exist.
      </p>
      <p>
        Unlike the aforementioned work, this paper
explores the feasibility of using LLMs to generate
contract clauses which have much larger model
sizes, compared to BERT [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], and trained on
huge amount of public domain data or internet
data and fine-tuned on large amount of various
tasks data, not solely fine-tuned on datasets
containing contract precedents. Our clause
analysis work is also different from the above
work. Apart from extracting the keyphrases, from
individual clauses, the extracted keyphrases are
further clustered so that keyphrases with different
wordings but having similar meanings can be
grouped together. This process enables clause
comparison to be carried out more effectively, not
just depending on the spelling of words.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Large language models (LLMs)</title>
      <p>
        The main task of a language model is to model
the generation of languages. Most recent LLMs
are based on the neural network architectures
called Transformers [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. They are trained on huge
amounts of text data which enables them to
capture the long range dependencies within text
and hence generate coherent content such that the
generated texts are closely related to each other.
This is usually done in the way that the model
predicts the next word based on the previously
generated words such that the generated content is
grammatically correct and coherent. Figure 2
shows two generated sentences: “How are you”
and “How do you ……”. The generation process
is probabilistic. Even when the first word “How”
is the same for the two sentences, the second word
can be different. Depending on the text that is
sampled, the second word can be some other word
that is commonly found following the word
“How”. In order to train the language models to
be grammatically correct, a huge dataset of
sentences is required.
      </p>
      <p>Having just grammatically correct language
models may not be useful. People prefer the
generated content to be coherent and closely
related to user given prompts. The desired
generation of the word   can be described as
 ( |
, 
, … , 
),
(1)
where  ,  , … are the previously
generated words and prompt is the text string that
contains:</p>
      <sec id="sec-3-1">
        <title>1. User instruction,</title>
        <p>
          2. Context, and
3. Examples.
implementations of the equation (1) and hence
different text generation. Some efficient models
such as the Vicuna [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] models, based on LLaMA,
can be fine-tuned to have about 90% performance
of the ChatGPT with just about 7% the number of
parameters of ChatGPT.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Prompt writing for generating legal contracts and clauses</title>
      <p>As most LLMs are capable of multiple tasks,
such as sentiment classification, question and
answering, information extraction, and text
generation, users are required to provide the
prompt to instruct models so that corresponding
responses can be generated. There are few aspects
that should be noted for writing a prompt:
In the examples above, either using the word
“draft” or “generate” is sufficient to indicate the
type of the prompt. The words “legal” or “contract”
should be included which enable the LLMs to use
legal or contract styles. If users want to generate a
clause that follow a list of specifics that form the
context, the context should be included to the
prompt as the following example.</p>
      <p>{{{context text}}}
- Based on the previous information, draft
a legal clause to [task]
- The clause should include [entities]
In the above clause, the text describing the context
should be enclosed by “{{{” and “}}}”. It is
because they help the LLMs to differentiate the
context from other text. Also, if there are
additional conditions augmented to the clauses,
users should specify them in a clear format.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Analysis and evaluation of the generated clauses</title>
      <p>
        As clauses the legally binding and define the
rights, obligations, and agreements between the
parties in the contract, they should be clearly and
precisely drafted. In contrast, the generation of
clauses with LLMs is a black box process which
currently lacks explainability. The hallucination
phenomenon of LLMs even makes the situation
worse because models can generate results that
are not related to the prompt. Thus, there is a need
to validate the AI generated clauses to match the
user requirements. A common and secure method
is the human-in-the-loop [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] in which a legal
professional intervenes in the generation process
by either (a) revising the generated clauses
directly or (b) revising the model input prompt
and direct the model to regenerate the clauses and
hope better clauses can be regenerated. This
presupposes that the person revising the generated
clause or making the final selection is
knowledgeable. To assist the person revising or
making the selection, we propose using a machine
learning approach to identify various aspects of a
clause and compare them with aspects obtained
from clauses extracted from trusted sources. The
benefit of this approach is that the differences, in
aspects, between the generated clauses and
selected clauses can be automatically identified
This can help to revise the generated clauses to
ensure consistency and quality with reference to
the trusted source.
      </p>
      <p>Before introducing the proposed approach,
we briefly describe 3 important tools that are used
in the approach.</p>
      <p>1.
2.
3.</p>
      <sec id="sec-5-1">
        <title>Sentence transformers [13]: for</title>
        <p>identifying clauses with similar contents.
We use it because it is fine tuned to
perform similarity measure between two
sentences.</p>
      </sec>
      <sec id="sec-5-2">
        <title>PatternRank [14]:</title>
        <p>keyphrases from sentences.
extracting</p>
      </sec>
      <sec id="sec-5-3">
        <title>Uniform maniform approximation</title>
        <p>
          and projection (UMAP) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]: for
manifold approximation and projection.
5.1.
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Sentence transformers</title>
      <p>Sentence transformers are based on Siamese
neural networks for obtaining embeddings (i.e.
vector representations) of sentences or paragraphs.
A sentence transformer uses a pre-trained
language model such as BERT or RoBERTa as its
core neural network component and fine tune it
with a large labeled dataset which enhances its
capability to differentiate which relationship a
pair of sentences should be, one of the following:
1) Entailment, when the first sentence is true,
the second sentence is also true;
2) Neutral, the truth of the sentences is
independent of each other;
3) Contradiction, the sentences contradict
with each other.</p>
      <p>After fine tuning, the sentence transformer
can transform sentences to vectors such that
sentences with similar contents will have vectors
close to each other, whereas sentences with
different contents will have vectors far apart from
each other. Hence, given vector representations of
a pair of sentences, the similarity can be evaluated
by using cosine similarity.
clauses, they contain significant and desirable
aspects that the user should check against with the
input clause. In order to explicitly extract these
aspects from the similar clauses, we propose to
perform the following procedure:
5.2.</p>
    </sec>
    <sec id="sec-7">
      <title>PatternRank</title>
      <p>PatternRank performs keyphrases extraction
by finding the sub-phrases in a document that are
the most similar to the input document itself.</p>
      <p>The working principle is that it first uses a
sentence transformer to get a document-level
vector representation and vector embeddings of
N-gram phrases appearing in the input document.
Then cosine similarity is used to find the top
phrases that are most similar to the input
documents.</p>
      <p>
        It basically is an enhancement of KeyBERT
[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. It allows user to define the patterns of
phrases to be extracted instead of simple n-grams
of pre-defined lengths.
5.3.
      </p>
    </sec>
    <sec id="sec-8">
      <title>UMAP + DBSCAN</title>
      <p>Since the vectors produced from sentence
transformers have relatively high dimension, 384
dimensional vectors in our experiments.
Performing clustering directly on the vectors with
common algorithms such as K-Means may give
non-satisfactory results because of the curse of
dimensionality. First the vectors may be
distributed in a low dimensional manifold space
embedded in a high dimensional space. Secondly,
the distance difference between nearest data
points and farthest data points decreases as the
dimension increases.</p>
      <p>
        UMAP is a tool for addressing high
dimensional and manifold distributed data. The
data are first non-linearly projected to a low
dimensional space and then a density-based
clustering (e.g., DBSCAN [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]) is performed.
5.4.
      </p>
    </sec>
    <sec id="sec-9">
      <title>Clause analysis and evaluation</title>
      <p>Referring to Figure 1, an input clause is first
obtained from a contract template or an LLM, and
a set of similar clauses is obtained from a trusted
sources (e.g., a repository of examined clauses) by
using a sentence transformer and cosine similarity.
Since the similar clauses are trusted and reliable
1. Extract keyphrases from the input clause
and similar clauses separately by
PatternRank.
2. Use sentence transformer to transform all
of the keyphrases to vectors.
3. Perform a clustering solely on the vectors
coming from similar clauses by UMAP
and DBSCAN.
4. Compute the distance between the
keyphrase vectors of the input clauses to
the cluster centers.
5. Assign the keyphrase vectors of the input
clause to cluster x if distance between the
keyphrase vector and cluster x &lt;
threshold value. Those clusters
containing the keyphrases from the input
clause are labeled as Involved Clusters
(Involved Aspects).
6. Label the keyphrases as Extra
Keyphrases if it cannot be assigned to
any clusters.
7. Clusters without keyphrase vector from
the input clause are labeled as Missed</p>
      <sec id="sec-9-1">
        <title>Clusters (Missed Aspects), because the</title>
        <p>input clause has no keyphrase related to
these clusters.</p>
        <p>Here we have made an assumption that an aspect
of a clause is closely related to the keyphrases
appearing in that clause. Individual clusters or
groups of these keyphrases represent the aspects
of the extracted similar clauses. Finally, user may
augment the input clause with the aspects
represented by Missed Clusters and to decide
whether to preserve the Extra Keyphrases or not
as they are not found in similar clauses.</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>6. Experiments</title>
      <p>
        We investigate the quality of generated
contract clauses by comparing them with the
clauses of the trusted dataset LEDGAR [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The
quality is assessed by using ROUGE F1 [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ],
precision, recall and F1. ROUGE F1 is a widely
used tool for text content comparison, whereas
precision, recall and F1 are used for assessing the
extent of aspects to be addressed by the model
generated clauses. They are evaluated as follows:
      </p>
      <sec id="sec-10-1">
        <title>ROUGE F1 score: For each machine</title>
        <p>generated clause, we compute the F1
scores of ROUGE-1, ROUGE-2, and
ROUGE-L with respect to the 15
extracted similar clauses from
LEDGAR, having cosine similarity &gt;
0.5. The means of the scores are reported.</p>
      </sec>
      <sec id="sec-10-2">
        <title>Precision, Recall, and F1: For each</title>
        <p>machine generated clause, we compute
the precision, recall, and F1 with respect
to the aspects derived from the 15
extracted similar clauses from
LEDGAR. The precision and recall are
defined as follows:
=</p>
        <p># 
ℎ
.</p>
        <p>, (2)
(3)
In the experiments, we generate the clauses with
ChatGPT and a local LLM called Vicuna which
also has an interactive text input and output
similar to ChatGPT. Since both models also
generate the text of description of the tasks and
legal disclaimers in addition to the generated
clauses, we remove all these text before the
evaluation.
6.1.</p>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>Data</title>
      <p>The public domain dataset LEDGAR was
introduced by Tuggener et al. at 2020. It was
crawled and scraped from the U.S. Securities and
Exchange Commission filings (SEC filings) and
contains contract clauses between years
20162019. These contracts are mainly material
contracts (called Exhibit-10) including
shareholder agreements, employment agreements,
and non-disclosure agreements. After data
cleanup and preprocessing, the dataset contains
60,540 contracts and a total of 846,274 clauses.</p>
    </sec>
    <sec id="sec-12">
      <title>6.2. ChatGPT, Vicuna component settings and other</title>
      <p>In the evaluation, the ChatGPT used is the
March 23 version. For the Vicuna model, we use
the “llama.cpp” to interact with the model because
“llama.cpp” is a pure C/C++ implementation with
the support for 4-bit quantization of the model.
This allows the quantized Vicuna model to be
assessed with a general 12GB RAM notebook,
even without a GPU. These features are very
desirable because people with privacy concern
can have a ChatGPT-like application to be
executed locally. The model we used is the
finetuned and 4-bit quantized 13B LLaMA model and
the important program configuration parameters
are given below:




</p>
      <sec id="sec-12-1">
        <title>Temperature: 0.7,</title>
        <p>Top_k: 40,
Top_p: 0.8,
Repeat_penalty: 1.2,</p>
        <p>Prompt context length: 2048,
and use default values for other parameters. For
the sentence transformer, the model used is
allMiniLM-L6-v2,which transforms input sentences
to 384 dimensional vectors.</p>
        <p>For PatternRank, top 10 ranked keyphrases are
used. We also define a more complex POS
patterns to extract various types of keyphrases in
clauses:
(&lt;J.*|V.*&gt;+&lt;CC.*&gt;)*&lt;J.*|V.*&gt;*&lt;
N.*&gt;+
For UMAP, number of neighbors is set to 5,
minimum distance between two projected data
points is 0.0 and the projected dimension is 5. For
the DBSCAN, default parameters are used except
the minimum samples to form a cluster is set to 4.
6.3.</p>
      </sec>
    </sec>
    <sec id="sec-13">
      <title>Clause generation</title>
      <p>The test clauses are generated manually by
using the ChatGPT’s and Vicuna’s interactive
interfaces. We generated the clauses for a house
rental agreement and a sales agreement with the
prompts shown in Table 1. In the table, a simple
context “For a house rental agreement:” is only
given for the 1st prompt. The LLMs can refer back
to the context for the rest prompts. We had tested
the generation of a total of 9 clause types for the
rental agreement. Similarly, for the sales
agreement, the 1st prompt has a context “For a
sales agreement:” and a total of 8 clause types are
generated. For each clause type, we generate 5
sample clauses. Hence, there are in total 85 model
generated clauses for testing. For ChatGPT,
multiple samples are obtained by regeneration
whereas for Vicuna, the samples are obtained by
changing the randomization seed.
the styles used in the generated clauses are
different from the extracted similar clauses. It is
expected as the LLMs are pre-trained on
tremendous amount of text, in additional to legal
text. Moreover, the generated clauses are just
based on the simple prompts and thus the clauses
are generated for general situations. This means
that the requirement of attorneys to review and
tailor clauses to the specific circumstances of the
parties involved is still necessary.</p>
      <p>Table 4 shows the mean precision, mean
recall and mean F1 score of the LLM generated
clauses for the two agreements. The results show
that considerable aspects of the related and trusted
clauses are addressed by the generated clauses.</p>
      <p>This indicated LLM generated clauses can cater
for many aspects of contract clauses and can be
used as an initial point for drafting clauses, even
there are still some enhancements required. When
comparing the performance of the ChatGPT and
Vicuna, it is quite clear that the precision of the
ChatGPT on the tasks is significantly higher than
Vicuna, given that the Recall values are similar.</p>
      <p>This is also expected as model size of ChatGPT is
much larger than that of Vicuna.</p>
      <p>Finally, Tables 5 and 6 show two samples
(one for ChatGPT and one for Vicuna) to illustrate
the generated clauses, derived aspects, Involved
Aspects, Missed Aspects, and Extra Keyphrases.</p>
      <p>With this information, users can consider to revise
their clauses, if necessary.</p>
      <p>Prompt: draft a legal clause for the late payment of the rent
Tenant acknowledges that the timely payment of rent is of the essence of this agreement. If Tenant fails
to pay rent in full on or before the due date specified in this agreement, Tenant shall be considered in
default under this agreement. If rent is not paid on or before the due date, Tenant shall be subject to a late
fee of [insert late fee amount or percentage] per day until the rent is paid in full. The late fee shall be in
addition to any other charges or damages owed by Tenant under this agreement. If Tenant fails to pay
rent within [insert number of days] days after the due date, Landlord may, at Landlord's sole discretion,
give Tenant a notice of termination of this agreement, and Tenant shall vacate the premises within [insert
number of days] days from the date of the notice. In addition to any other remedies available under
applicable law, the Landlord may also seek damages for any unpaid rent or other amounts owed by Tenant
under this agreement. Tenant acknowledges that the late payment of rent may cause the Landlord to incur
additional costs and expenses, including but not limited to, late fees, legal fees, and other costs associated
with collecting rent. Tenant agrees to indemnify and hold harmless the Landlord from any and all such
costs and expenses incurred by the Landlord as a result of Tenant's failure to pay rent in a timely manner.
Involved Aspects: 0, 1, 8, 9, 10, 11, 13
Missed Aspects: 2, 3, 4, 5, 6, 7, 12
Extra Keyphrases: “unpaid rent”
'late payment', 'subsequent late payments', 'first late payment'
'late charges', 'pay such late charge', 'late charge therefor'
'pay landlord', 'compensates landlord', 'costs landlord'
'incur costs', 'attorney fees', 'accounting charges'
'additional minimum rent', 'additional rent', 'basic lease terms'
'rent payment', 'rent adjustment deposits', 'real property taxes',
'default rate', 'overdue amount', 'overdue payment'
'installment', 'bear interest', 'pay such interest'
'notice', 'written notice', 'foregoing notice'
'grant tenant', 'tenant', 'gives tenant notice'
'liquidated damages', 'damage', 'actual damages'
'due date', 'applicable due date'
'payment', 'creditor relationship', 'future payments'
'grace period', 'cure period', 'month period'</p>
      <p>Prompt: Draft a legal clause for force majeure
Neither party shall be liable to the other for any delay or failure to perform its obligations under this Sales
Agreement if such delay or failure arises from circumstances beyond its control, including but not limited
to acts of God, fire, flood, earthquake, riot, civil commotion, war, invasion, act of government, sabotage,
labor shortages, or failures of the Internet. If either party is prevented from performing any obligation by
such circumstances, it shall give prompt notice thereof to the other party and make a reasonable effort to
minimize the impact of such events on its performance.</p>
      <p>Involved Aspects: 0, 1, 2, 3, 4, 8, 10
Missed Aspects: 5, 6, 7, 9
Extra Keyphrases: 'give prompt notice', ‘God’
'agreement', 'written notice'
'delays', 'manufacturer delays', 'excusable delay'
'failure', 'causing cessation', 'communication failures'
'affected party', 'parties', 'other party'
'obligations', 'respective obligations', 'payment obligations'
'liability', 'damages', 'negligence'
'circumstance', 'present or future law', 'event'
'limitation', 'governmental action', 'governmental regulation'
'labor troubles', 'work stoppages', 'labor difficulties'
'terrorism', 'including disruption', 'cyber attack'
'limitation earthquakes', 'earthquake', 'severe weather conditions'</p>
    </sec>
    <sec id="sec-14">
      <title>7. Conclusions</title>
      <p>The launch of ChatGPT and the emergence of
LLMs have tremendous impacts, both as an
opportunity and as a threat, on different aspects of
digital transformation. In this paper, we introduce
the underlying working principle and investigate
their performance on contract clause drafting. We
also propose an approach to enhance these clauses
by using a trusted contract clause source.
Experimental results show that the generated
clauses are usable as they can address a significant
number of related aspects that usually appear in
clauses of practical contracts.</p>
    </sec>
    <sec id="sec-15">
      <title>8. Acknowledgement</title>
      <p>This research / project is supported by the
National Research Foundation, Singapore and
Infocomm Media Development Authority under
its Trust Tech Funding Initiative. Any opinions,
findings and conclusions or recommendations
expressed in this material are those of the author(s)
and do not reflect the views of National Research
Foundation, Singapore and Infocomm Media
Development Authority.</p>
    </sec>
    <sec id="sec-16">
      <title>9. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Simonson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Broderick</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Herr,</surname>
          </string-name>
          <article-title>The extent of repetition in contract language</article-title>
          ,
          <source>in: Proceedings of the Natural Legal Language Processing Workshop</source>
          <year>2019</year>
          , Association for Computational Linguistics, Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>21</fpage>
          -
          <lpage>30</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2] ChatGPT, personal communication,
          <source>March</source>
          <volume>23</volume>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          et al.,
          <article-title>LLaMA: Open and efficient foundation language models</article-title>
          ,
          <source>arXiv:2302.13971</source>
          ,
          <year>2023</year>
          . URL: https://arxiv.org/abs/2302.13971.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          et al.,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: Proceedings of Neural Information Processing Systems</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Aggarwal</surname>
          </string-name>
          et al.,
          <string-name>
            <given-names>A Clause</given-names>
            <surname>Recommendation</surname>
          </string-name>
          <article-title>Framework for AI-aided Contract Authoring</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>8770</fpage>
          -
          <lpage>8776</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Joshi</surname>
          </string-name>
          et al.,
          <article-title>Investigating strategies for clause recommendation</article-title>
          ,
          <source>Legal Knowledge and Information Systems</source>
          ,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .3233/FAIA220450.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>I.</given-names>
            <surname>Chalkidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Michos</surname>
          </string-name>
          ,
          <article-title>Extracting contract elements</article-title>
          ,
          <source>in: Proceedings of the 16th Edition of the International Conference on Artificial Intelligence and Law</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>28</lpage>
          . doi:
          <volume>10</volume>
          .1145/3086512.3086515.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Cristianini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shawe-Taylor</surname>
          </string-name>
          ,
          <article-title>An Introduction to Support Vector Machines and other kernel-based learning methods</article-title>
          , Cambridge University Press,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Leivaditi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rossi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Kanoulas</surname>
          </string-name>
          ,
          <article-title>A benchmark for lease contract review</article-title>
          , arXiv:
          <year>2010</year>
          .10386,
          <year>2020</year>
          . URL: https://arxiv.org/abs/
          <year>2010</year>
          .10386.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          et al.,
          <article-title>BERT: Pre-training of deep bidirectional transformers for language understanding</article-title>
          , arXiv:
          <year>1810</year>
          .04805v2,
          <year>2019</year>
          . URL: https://arxiv.org/abs/
          <year>1810</year>
          .04805v2.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>W. L.</given-names>
            <surname>Chiang</surname>
          </string-name>
          et al.,
          <article-title>Vicuna: An open-source chatbot impressing GPT-4 with 90% ChatGPT quality</article-title>
          ,
          <year>2023</year>
          . URL: https://vicuna.lmsys.org.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <article-title>Wikipedia contributors, Human-in-the-loop,</article-title>
          <string-name>
            <surname>Wikipedia</surname>
          </string-name>
          , The Free Encyclopedia,
          <year>2023</year>
          . URL: https://en.wikipedia.org/w/index.php?title=
          <article-title>Human-in-the-loop&amp;oldid=1145872129</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          , Sentence-BERT:
          <article-title>Sentence embeddings using Siamese BERTNetworks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>3982</fpage>
          -
          <lpage>3992</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>T.</given-names>
            <surname>Schopf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Klimek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Matthes</surname>
          </string-name>
          ,
          <article-title>PatternRank: Leveraging pretrained language models and part of speech for unsupervised keyphrase extraction</article-title>
          ,
          <source>in: Proceedings of the 14th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>248</lpage>
          . doi:
          <volume>10</volume>
          .5220/0011546600003335.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>L.</given-names>
            <surname>McInnes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Healy</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Melville,</surname>
          </string-name>
          <article-title>UMAP: Uniform Manifold Approximation and Projection for Dimension and Reduction</article-title>
          , arXiv:
          <year>1802</year>
          .03426,
          <year>2018</year>
          . URL: https://arxiv.org/abs/
          <year>1802</year>
          .03426.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Grootendorst</surname>
          </string-name>
          ,
          <article-title>KeyBERT: Minimal keyword extraction with BERT</article-title>
          , Zenodo,
          <year>2020</year>
          . doi:
          <volume>10</volume>
          .5281/zenodo.4461265.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ester</surname>
          </string-name>
          et al.,
          <article-title>A density-based algorithm for discovering clusters in large spatial databases with noise</article-title>
          ,
          <source>in: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining</source>
          ,
          <year>1996</year>
          , pp.
          <fpage>226</fpage>
          -
          <lpage>231</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>D.</given-names>
            <surname>Tuggener</surname>
          </string-name>
          et al.,
          <article-title>LEDGAR: A large-scale multi-label corpus for text classification of legal provisions in contracts</article-title>
          ,
          <source>in: Proceedings of the 12th Language Resources and Evaluation Conference</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1235</fpage>
          -
          <lpage>1241</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>C. Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <surname>ROUGE:</surname>
          </string-name>
          <article-title>A package for automatic evaluation of summaries</article-title>
          , In: Text Summarization Branches Out, Association for Computational Linguistics, Barcelona, Spain,
          <year>2004</year>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>