<!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>
      <journal-title-group>
        <journal-title>June</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Towards legal change analysis: clustering of Polish Civil Code amendments</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>ukasz Górski Interdisciplinary Centre for Mathematical and Computational Modelling University of Warsaw</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <volume>21</volume>
      <issue>2019</issue>
      <abstract>
        <p>Due to the growing activity of legislators, lawyers are in need of tools that would allow them to get a better understanding of an ever-growing corpus of legislative materials. Herein we propose a tool that visualizes and clusters thematically similar amending acts, allowing a lawyer to quickly review related provisions, thus giving an insight into a legislative history of a given legal institution. The methods suggested herein (based on TF-IDF, word and paragraph embeddings and PCA as well as k-mean clustering) are evaluated on the provisions of the Polish Civil Code.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>This paper describes first steps undertaken in the development
of a software solution used for the visualization of legal change,
which aims to provide the user with means to efectively explore a
database of amending acts. We aim to develop a solution which is
able to group together amending acts that are thematically similar,
in an unsupervised manner.</p>
      <p>
        The proof-of-concept implementation studied herein has been
tested using the Polish Civil Code and relevant amending acts issued
from its enactment in 1965 up to November 2018. This legal act was
chosen as a basis for experiments for the following reasons:
(i) While the Code was in force, the Polish economy has
undergone transformation from socialism to capitalism and later
its law had be adapted to the law of the European Union. The
processes pertaining to the recognition of the information
and communication technologies in the domain of law were
also reflected in the Code. Turbulent times, in which the
Code existed, made it subject to almost 90 amending acts.
Some of the sections composing the Civil Code were, in fact,
subject to change multiple times - please consult the heat
map (Fig. 1) for a graphical representation of the number
of times a given legal section was amended. Therefore this
research aimed to assess whether modern machine learning
approaches would be able to recognize and discover discrete
categories of changes (not necessarily the three mentioned
hereinbefore), based only on the text of relevant legal
provisions.
(ii) Even though the amending acts should be as straight-forward
to understand and as precise as possible, the legislative
practice does not always live up to this standard. For example,
the titles of the amending acts do not help in the clustering
2
Practising lawyers need tools that would allow them to track legal
changes, especially due to the increasing activity of legislatures. For
example, in the Polish legal system it has been noted a number of
times that currently the legal system is undergoing the process of
"inflation of law". This notion was recognized by theorists [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and
even the courts, one of which explicitly stated that the legislature
is currently multiplying the numbers of unnecessary statutes, which
makes accessing ... sources of law dificult [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>The problem of orientation in a dynamically changing system
of statues can be mitigated to a degree by the introduction of
consolidated texts of acts. In practice, in Poland, the process of
consolidation of legal texts is two-fold. On the one hand, there are
oficial consolidated texts of legal acts published by the authorities.
In practice, those are however seldom used. Lawyers routinely use
the legal databases and search engines that are developed by
private companies (legal information systems) instead. Currently, the
market remains split between C.H. Beck, developer of Legalis
information system, and Wolters Kluwer Polska, with their Lex system.
The editorial ofices of both of these systems carefully analyse every
amending act and issue their versions of the consolidated text.
Obviously, the consolidated texts published by those privately-owned
enterprises do not have a formal force of law, yet the convenience
ofered by them makes those closed and paid platforms a go-to
solution for professionals. As far as the recognition of amendments
goes, both of these systems ofer, inter alia, a clear dif-like view of
the legislative history of a given legal provision (Fig. 2).</p>
      <p>
        However, those solutions do not employ any form of graphical
presentation of amendments. In fact, artificial intelligence
methods are used sparsely in those types of software: for example the
consolidated versions of statutes are created mainly by hand [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Therefore this research, independent of aforementioned
commercial solutions, aims to look into means of extending already existing
systems.
      </p>
      <p>
        As far as the analysis of amending acts in the AI and Law
community goes, the focus up to this time was mainly on the automatic
consolidation of legal texts. For example, authors in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] created a
tool for semiautomatic implementation of amending acts. Similar
subject was undertaken in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], in which a feasibility of using an
SGML-based engine for amendments processing was explored.
Dually, in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] a drafting environment was prototyped, which generated
amending acts based on amendments introduced by drafter into a
principal act.
      </p>
      <p>
        Whilst this research uses word embeddings techniques as well
as older TF-IDF-based methods, the feasibility of using word
embeddings in eDiscovery procedures was in fact already explored.
In [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] a Disco system is described, which uses word2vec word
embeddings to help legal expert with refining her document
database search queries. In Poland, doc2vec model was already used
in SAOS, a Polish courts’ judgment analysis system, as a basis for
similarity analysis module [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] focused on the explainability
of AI methods and supplemented text similarity measures (based
on TFIDF and word embeddings) with metric showing how much
each word contributes to overall similarity result when comparing
text phrases. K-Means clustering employed in this research was
used with, inter alia, embedding-based methods for grouping
controversial issues that were extracted from Chinese legal texts [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
Similarly, other authors clustered the documents regarding Chinese
criminal cases [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>METHODS</title>
      <p>In pursuit of the aim outlined in the preceding section a pipeline of
an existing tools has been created, with all of them instrumented
by Python programms. Python 3.6.8 from Anaconda was used for
text processing instrumentation, as well as: gensim 3.4.0 for
TFIDF and embeddings calculations, scikit-learn 0.20.2 for clustering,
pandas 0.24.0 for data manipulation, nltk 3.4 for text processing
and matplotlib 3.0.2 for visualization.</p>
      <p>Text processing pipeline can be divided into the following phases:
• The generation phase involves reading the consolidated
versions of a given statute and extracting the diferences
between each successive version. In this phase a textual
representation of changes, similar to that shown in Fig. 2,
is created. The amending acts are not directly processed:
this problem, while itself interesting, is out of the scope of
this paper. Usable difs can be created using Linux wdiff
command. In fact, for the purpose of this study, a number
of dif-generating tools were tested, yet wdiff seemed to
be best suited for our instant needs, ofering the clearest
results (Table 1 can be consulted for examples of diferences
between the output of various dif-generating tools).</p>
      <p>
        The extraction of difs allowed the creation of three diferent
bodies of amendments corpora. For their detailed
description and example Table 2 should be consulted. The first
corpus version (C1) consisted of a complete text of given legal
sections after amending; the second version (C2) included
only the words that were inserted into a given legal section.
However, both of these corpora did not include the texts
that were deleted by an amending act. Yet, the provisions
or parts of them that were struck down can carry at least
the same amount of semantic meaning as those that were
left untouched or added by the legislature. Moreover, in
contemporary legal systems, legislative action is not the only
means of changing the statute. For example, in Poland, the
Constitutional Tribunal was called a "negative legislator".
This term means that, in principle, a Tribunal is unable to
amend a given legal act by adding some provisions, yet is
perfectly capable of striking a given provision down. While
this position is overly simplistic (as Tribunal in practice was
able to pass, inter alia, interpretative judgments, in which
it concludes that a given provision is in accordance with
the Constitution as long as its interpretation is in line with
the one put forth by the Tribunal [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]) we should be able to
include in our clusterization endeavour efects of removal of
a given statutory provision. To achieve this aim, for the
purpose of this study, a third version of the corpus (C3) included
the parts of the legal provisions that were inserted by the
amending acts alongside the deleted ones. The disadvantage
of this technique is that it distorts the natural flow of the text
and might not fare well with a paragraph embedding method
that depends on the natural sequence of words in a sentence,
and might be better suited for methods that employ bag of
words technique.
• In preprocessing phase these three variations of corpora
were later processed using the standard NLP pipeline -
stopwords were removed and lemmatization was performed
(using the Polish Polimorfologik dictionary [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). As Polish is
a highly inflected language, lemmatization had to be used
instead of stemming. On the other hand, stopwords removal
and lemmatization are not always utilized with more
advanced techniques of text representation, like word or
paragraph embeddings. Seminal papers that introduced those
techniques do not mention stemming or lemmatization at all
(cf. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]). Therefore we have decided to test the clustering
algorithm with either preprocessed corpus (i.e. with
stopwords removed and lemmatization performed) or without
preprocessing. Six distinct corpora for clustering were thus
prepared, half of them preprocessed (those will be hereinafter
1The English translation of amended text comes from the Legalis legal information
system, which in turn references The Polish Law Collection database by Translegis
publishing house. The crossed-out sections were translated from Polish to English by
the authors of this paper.
denoted as C1P , C2P , C3P ), half of them - not (hereinafter C1¬P ,
C2¬P , C3¬P ).
• The processing stage involved using the K-means clustering
to group together similar documents from each corpus. The
number of clusters, for the sake of the experiments, was set to
10. Visualization module uses PCA to display the clustering
results.
      </p>
      <p>The following methods were used to generate document
vectors as a basis of clustering:
– TF-IDF, which used corpora C1P , C2P , C3P as well as C1¬P ,</p>
      <p>
        C2¬P , C3¬P .
– word2vec, using the same corpora as TF-IDF. We have used
the pretrained word embeddings for this part, which were
generated for Polish by other research groups [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Those
were based the National Corpus of Polish database (built
using excepts from newspapers, magazines, text extracted
from the internet as well as conversation transcripts) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
in addition to Wikipedia database. Two versions of the
word embedding were put under scrutiny, both holding
forms for all part of speech in Polish, with vector
consisting of 300 elements. Both models were trained using the
negative sampling algorithm and difered in the
architecture - one used CBOW, the other Skip-Gram architecture
(hereinafter those will be denoted as word2vec(CBOW)
for clustering algorithms. Firstly, internal evaluation
considers not a given ground truth, but the model itself. Metrics
for internal evaluation presented herein include: silhouette
coeficient and Calinski-Harabaz index (both evaluate how
well the clusters are defined) as well as Davies-Bouldin index
(assesses the separation between clusters) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>
        The external evaluation methods compare machine-generated
clusters with some pre-existing evaluation gold standard,
thus allowing the introduction of standard measures of
precision, recall or the F-score. However, the creation of such
metric in the context of this research is not a straightforward
task. Obvious method of such standard creation involves
classifying of existing data by a legal expert. There are however
a number of concerns regarding this method. Firstly, it is
necessarily subjective. Secondly, machine learning methods
are conceived as means to discover latent patterns existing in
the data, that are missable for humans (cf. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]). Using
humangenerated gold standard therefore defeats the purpose of
using machine learning methods in the first place. Thirdly,
putting the subjectivity aside, creation of such gold standard
is a cumbersome and tiresome task. Unfortunately, we did
not have enough resources to push that venue of inquiry
further. For external evaluation we have therefore settled down
on qualitative methods of evaluation in place of quantitative.
The clustering results, after being generated, were assessed
for their distinctiveness by human actor and the best ones
were selected. The grading procedure called for each result
set to be reviewed and scored on 1-10 scale based on the
subjective impression of results quality. The qualities such
as thematic homogenity of clustered amendments, as well as
their distinctiveness, were accounted for in this procedure.
The relative sizes of each cluster were also considered (for
example, results efecting in a single cluster holding over 75%
of all amendments were considered to not be very useful).
4
      </p>
    </sec>
    <sec id="sec-3">
      <title>RESULTS</title>
      <p>The internal evaluation results of clustering are shown in Table 3.
Generally, the word2vec (skip-gram) model achieved the best results
as far as the internal evaluation results are concerned and the model
worked best when it was run with the C¬P corpus. It scored the best
2
in terms of silhouette coeficient and Calinski-Harabaz index and
well in terms of Davies-Bouldin index. Whilst preprocessing was
rather detrimental to the quality of internal evaluation of results in
case of various word embeddings implementations, in the case of
TF-IDF metric it allowed an increase of the aforementioned quality.</p>
      <p>In the case of external evaluation, the word2vec(CBOW) model
with C P corpus was ranked the highest, even though the internal
1
evaluation results might have not pointed to that. Fig. 3 shows
the visualization of the clusters as generated by this model. The
results prove that contemporary word embeddings methods should
be considered when preparing a clustering legal assistant. The data
preprocessing phase does not have to include lemmatization,
stemming or stopwords removal. However, the creation of training set
and training itself remains a computationally-intensive challenge.
5</p>
    </sec>
    <sec id="sec-4">
      <title>CONCLUSION AND FUTURE WORK</title>
      <p>We have shown a proof-of-concept system capable of enhancing a
lawyer with visual representation of legal change. The work
presented herein was concerned with the Civil Code, however other
areas of law (e.g. criminal law) should be put under scrutiny as
well. Similarly, as far as the created word embeddings are
concerned, we should try to create ones that use larger training sets or
are more domain-oriented. Whilst this paper used traditional and
well-understood methods for clustering and data dimensionality
reduction, more modern techniques should be tested as well.</p>
      <p>
        This work has been based on the legal change as caused by the
amending acts. It should be noted that this extremely positivist (or
formalistic) point of view should be supplemented with more
general notions, in which the statutes themselves do not change,
however the practice of oficials (e.g. judges) who apply given laws does.
Two examples of such practices may be given, one stemming from
the practice of Polish legal system, the other based on European
human rights protection system. As for the former, we have already
mentioned that the Polish Constitutional Tribunal sometimes
resorts to pointing out that there exists a certain interpretation of the
statute that makes it compatible with the constitutional provisions.
Secondly, as far as the European Convention on Human Rights is
concerned, the European Court of Human Rights has on a number
of occasions called it a "living instrument" and has stressed that
its provisions, even if unchanged, should always be interpreted in
the light of present circumstances [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Therefore a support system
should be able to recognize the change in practice as well, which
itself is a challenging problem.
      </p>
      <p>This work, which is concerned with the legislative change, should
therefore be viewed in the light of a broader subject of legal change.
In future work we aim to employ machine learning techniques to
discover and visualize changes stemming not only from the actions
of the legislature, but also of other legal actors as well.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Timothy</given-names>
            <surname>Arnold-Moore</surname>
          </string-name>
          .
          <year>1995</year>
          .
          <article-title>Automatically processing amendments to legislation</article-title>
          .
          <source>In Proceedings of the 5th international conference on Artificial intelligence and law. ACM</source>
          ,
          <volume>297</volume>
          -
          <fpage>306</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Timothy</given-names>
            <surname>Arnold-Moore</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Automatic generation of amendment legislation</article-title>
          .
          <source>In Proceedings of the 6th international conference on Artificial intelligence and law . ACM</source>
          ,
          <volume>56</volume>
          -
          <fpage>62</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kevin</surname>
            <given-names>D</given-names>
          </string-name>
          <string-name>
            <surname>Ashley</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Artificial intelligence and legal analytics: new tools for law practice in the digital age</article-title>
          . Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Krystyna</given-names>
            <surname>Chodorowska</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Automatic court judgment similarity analysis</article-title>
          .
          <source>Master's thesis. Interdisciplinary Centre for Mathematical and Computational Modelling</source>
          , University of Warsaw.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Shihchieh</given-names>
            <surname>Chou</surname>
          </string-name>
          and
          <string-name>
            <surname>Tai-Ping Hsing</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Text mining technique for Chinese written judgment of criminal case</article-title>
          .
          <source>In Pacific-Asia workshop on intelligence and security informatics</source>
          . Springer,
          <fpage>113</fpage>
          -
          <lpage>125</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Provincial</given-names>
            <surname>Administrative</surname>
          </string-name>
          Court in Gliwice. [n. d.].
          <source>Judgment of 12th of March</source>
          <year>2007</year>
          ,
          <string-name>
            <surname>IV</surname>
            <given-names>SA</given-names>
          </string-name>
          /Gl 1455/06.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Kokoszczyński</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Wierczyński</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>System informacji prawnej w pracy sędziego</article-title>
          . Wolters Kluwer. https://books.google.pl/books?id=vmFSAwAAQBAJ
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Jörg</given-names>
            <surname>Landthaler</surname>
          </string-name>
          , Ingo Glaser, and
          <string-name>
            <given-names>Florian</given-names>
            <surname>Matthes</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Towards Explainable Semantic Text Matching</article-title>
          .
          <source>In Legal Knowledge and Information Systems: JURIX</source>
          <year>2018</year>
          :
          <article-title>The Thirty-first Annual Conference</article-title>
          , Vol.
          <volume>313</volume>
          . IOS Press,
          <volume>200</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>George</given-names>
            <surname>Letsas</surname>
          </string-name>
          . [n. d.].
          <article-title>The ECHR as a Living Instrument: Its Meaning and its Legitimacy (March 14,</article-title>
          <year>2012</year>
          ). Available at SSRN
          <volume>2021836</volume>
          ([n. d.]).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Tomas</surname>
            <given-names>Mikolov</given-names>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jefrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Eficient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301.3781</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Marcin</given-names>
            <surname>Miłkowski</surname>
          </string-name>
          . [n. d.]. Polimorfologik. https://github.com/morfologik/ polimorfologik
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>IPI</given-names>
            <surname>PAN</surname>
          </string-name>
          . [n. d.].
          <source>Word2Vec</source>
          . http://dsmodels.nlp.ipipan.waw.pl/
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Scikit-learn: Machine Learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          ),
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Adam</surname>
            <given-names>Przepiórkowski</given-names>
          </string-name>
          , Rafal L Górski,
          <article-title>Barbara Lewandowska-Tomaszyk, and</article-title>
          <string-name>
            <given-names>Marek</given-names>
            <surname>Lazinski</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Towards the National Corpus of Polish.</article-title>
          .
          <source>In LREC.</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>PierLuigi</given-names>
            <surname>Spinosa</surname>
          </string-name>
          , Gerardo Giardiello, Manola Cherubini, Simone Marchi, Giulia Venturi, and
          <string-name>
            <given-names>Simonetta</given-names>
            <surname>Montemagni</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>NLP-based metadata extraction for legal text consolidation</article-title>
          .
          <source>In Proceedings of the 12th International Conference on Artificial Intelligence and Law</source>
          . ACM,
          <volume>40</volume>
          -
          <fpage>49</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Franciszek</given-names>
            <surname>Studnicki</surname>
          </string-name>
          .
          <year>1978</year>
          .
          <article-title>Wprowadzenie do informatyki prawniczej: zautomatyzowane wyszukiwanie informacji prawnej</article-title>
          .
          <source>Państwowe Wydawnictwo Naukowe.</source>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Xin</surname>
            <given-names>Tian</given-names>
          </string-name>
          , Yin Fang,
          <string-name>
            <surname>Yang</surname>
            <given-names>Weng</given-names>
          </string-name>
          , Yawen Luo, Huifang Cheng, and
          <string-name>
            <given-names>Zhu</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>K-Means Clustering for Controversial Issues Merging in Chinese Legal Texts</article-title>
          .
          <source>In Legal Knowledge and Information Systems - JURIX</source>
          <year>2018</year>
          :
          <article-title>The Thirty-first Annual Conference</article-title>
          , Groningen, The Netherlands,
          <fpage>12</fpage>
          -
          <lpage>14</lpage>
          December
          <year>2018</year>
          .
          <fpage>215</fpage>
          -
          <lpage>219</lpage>
          . https://doi.org/10.3233/978-1-
          <fpage>61499</fpage>
          -935-5-215
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>Ngoc</given-names>
            <surname>Phuoc An Vo</surname>
          </string-name>
          , Caroline Privault, and
          <string-name>
            <given-names>Fabien</given-names>
            <surname>Guillot</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Experimenting word embeddings in assisting legal review</article-title>
          .
          <source>In Proceedings of the 16th edition of the International Conference on Articial Intelligence and Law</source>
          . ACM,
          <volume>189</volume>
          -
          <fpage>198</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Tomasz</given-names>
            <surname>Woś</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Wyroki interpretacyjne i zakresowe w orzecznictwie Trybunału Konstytucyjnego</article-title>
          .
          <source>Studia Iuridica Lublinensia</source>
          <volume>25</volume>
          ,
          <issue>3</issue>
          (
          <year>2016</year>
          ),
          <fpage>985</fpage>
          -
          <lpage>995</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>