<!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>FIRE2019@AILA: Legal Information Retrieval Using Improved BM25</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zicheng Zhao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hui Ning</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liang Liu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chengzhe Huang</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leilei Kong</string-name>
          <email>kongleilei1979@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yong Han</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhongyuan Han</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Harbin Engineering University</institution>
          ,
          <addr-line>Harbin</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Heilongjiang Institute of Technology.</institution>
          <addr-line>Harbin</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper details the approaches of implementing the tasks of identifying relevant precedents and identifying relevant statues in the evaluation of Artificial Intelligence for Legal Assistance proposed by Forum of Information Retrieval Evaluation in 2019(AILA@Fire2019). We formalize the two tasks as the issue of information retrieval, and present the improved BM25 models to retrieve the prior cases and identify the relevant statues. For the task of identifying relevant precedents, the proposed improved BM25 model integrates the relevance scores of the original current case and the filtered current case. For the task of identifying relevant statues, the proposed improved BM25 models exploit the search results as the reference documents of the current case and integrate the ranking information of search results into the BM25 model. Comparisons to the other submissions for the same tasks, our improved BM25 model achieves the top performers for the task of identifying relevant precedents on all evaluation measures. For the task of identifying relevant statues, the improved BM25 model wins the second place on 1/rank of first relevant document and the third place on BPREF.</p>
      </abstract>
      <kwd-group>
        <kwd>Legal Information Retrieval</kwd>
        <kwd>Prior Case Identifying</kwd>
        <kwd>Statues Identifying</kwd>
        <kwd>BM25</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In a Common Law System1, great importance is given to prior cases. A prior case (also
called a precedent) is an older court case related to the current case, which discusses
similar issues and which can be used as reference in the current case [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A prior case
is treated as important as any law written in the law book called statutes. This is to
ensure that a similar situation is treated similarly in every case. If any relevant legal
issues have been decided in the ongoing case, the court should follow the interpretation
in the previous case. For this purpose, it is critical for legal practitioners to find and
study previous court cases, to examine how the ongoing issues were interpreted in the
older cases [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        With the recent developments in information technology, the number of digitally
available legal documents has rapidly increased. It is, hence, imperative for legal
practitioners to have an automatic precedent retrieval system. The task of identifying
relevant prior case can be modeled as a task of information retrieval, where the current
case document (or a description of the current situation) will be used as the query, and
the system should return relevant prior cases as results [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Additionally, identifying the
most relevant statutes is to identify the most relevant statutes for each query.
      </p>
      <p>
        Usually, legal document retrieval considered as a rank task. Early approaches for
handling term dependencies in IR considered extensions of the bag of word
representation of texts, by including bi-grams to the vocabulary. Such an approach was
taken by Fagan [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for vector space models, while the language model counterpart was
proposed in the late of 90s [
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4, 5, 6</xref>
        ] where the authors proposed to use a mixture of the
bigram and unigram language models. Multiple weighted fields base on BM25 were
proposed by Robertson [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Method of Identifying Relevant Precedents</title>
      <p>For the task of Identifying Relevant Precedents, we apply the approach based on the
information retrieval to obtain the prior cases of the current case.</p>
      <p>Given a current case, denoted as  , and a collection of prior cases denoted as  , the
goal of Identifying Relevant Precedents is to retrieve the relevant document d in
collection  when given the current case q.</p>
      <p>For the submission HLJIT2019-AILA_task1_1, we choose the BM25 model as the
retrieval model, defined in Eq. (1)
tf (wi , d )  idf (wi )  (k1 1)
rel(q, d )  BM 25(q, d )   log( )
wiq tf (wi , d )  k1  (1 b  b  LEN (d )) (1)
avdl
where w is the word in  , avdl is the average length of the document, k1 and  are
the parameters of BM25.</p>
      <p>
        In the evaluation, the  and  is preprocessed firstly as follows: Porter stemmer
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is used for stemming and the stop words, the punctuation characters, and the
numbers are filtered by using the Lucene toolkit2. Especially, for the current case  ,
we rank the words in  according to their IDF (Inverted Document Frequency) scores
(the collection of prior cases  is chosen to compute the IDF). Then the top  %
words are chosen to represent the query  . We set the parameter  = 50,  1 = 1.2,
and b = 0.75.
      </p>
      <p>For the submission HLJIT2019-AILA_task1_2, we modify the relevance
computation to get an improved BM25 as follows:
2 http://lucene.apache.org/</p>
      <p>rel(q, d)  BM 25(q, d)  BM 25(q, d) (2)
where  ’ is the same as HLJIT2019-AILA_task1_1, and  ’’ is the original current case
without IDF filtering. All the other settings are followed HLJIT2019-AILA_task1_1.</p>
      <p>In addition, we also experimented with Word2vec method as the submission
HLJIT2019-AILA_task1_3. After choosing the top m% words with high TF-IDF to
represent the query  and document  , we represent  and  as vectors using
Word2vec method, shown in Eq.(3):</p>
      <p>1 n
V (x)  ti (3)</p>
      <p>n i1
where   denotes word vector of i-th term,  is the top m% words. In experiments, we
set the parameter = 50.</p>
      <p>Then, we use the Euclidean distance to calculate the similarity between  and  .
3</p>
    </sec>
    <sec id="sec-3">
      <title>Method of Identifying Relevant Statues</title>
      <p>(4)
(5)
For the task of Identifying Relevant Statues, we apply the approach based on the
information retrieval to obtain the relevant statues.</p>
      <p>Given a current case  , and a collection of statues, denoted as  , the goal of
Identifying Relevant Statues is to retrieve the relevant statues s in collection  when
given the current case  .</p>
      <p>For the submission HLJIT2019-AILA_task2_1, we also choose the BM25 model as
the retrieval model. We use the description part in statues to construct the document
collection  . And all the parameters setting and pre-processing are followed
HLJIT2019-AILA_task1_1.</p>
      <p>For the submission HLJIT2019-AILA_task2_2, we use the top-n relevant prior cases
associated with the current case  as the reference document   , and integrate the
relevant scores obtained by   into the original relevant score, shown as Eq.(4):
BM 25( pi , s j )
rel(q, s j )  BM 25(q, s j ) 
where s denotes the j-th statue in  ,   is the i-th relevant prior case associated with
 , and  ( ,   ) is the rank of   in the search results of  . In the evaluation, we
select the top-10 search results as the reference documents.</p>
      <p>Furthermore, considering the ranking information of relevant statues, we modify the
Eq.(4) as follows
rank( p, pi )
rel(q, s j )  BM 25(q, s j ) </p>
      <p>BM 25( pi , s j )
rank( p, pi )  rank(q, s j )
where  ( ,   ) is the rank of s in the search results of  . In the evaluation, the
number of reference documents is 10, and the number of re-ranking relevant statues is
197.</p>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>document and the fourth place on BPREF. According to the results, the relevant prior
case information is helpful to guide the judgment of current case.
We describe an approach to Precedent Retrieval and Statute Retrieval that makes use
of the improved BM25. Comparisons to the other submissions for the same tasks, our
improved BM25 model achieves the top performers for the task of identifying relevant
precedents on all evaluation measures. For the task of identifying relevant statues, the
improved BM25 model wins the second place on 1/rank of first relevant document and
the third place on BPREF.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This research was supported by the National Natural Science Foundation of China
(No.61806075, No.61772177), the National Social Science Fund of China
(No.18BYY125), the Natural Science Foundation of Heilongjiang province of China
(F2018029) and the Social Science Fund of Heilongjiang Province of China
(No.18TQB103).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>P.</given-names>
            <surname>Bhattacharya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mehta</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Bhattacharya.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Majumder</surname>
          </string-name>
          ,
          <article-title>Overview of the Fire 2019 AILA tracks: Artificial Intelligence for Legal Assistance</article-title>
          .
          <source>In Proc. of FIRE 2019 - Forum for Information Retrieval Evaluation</source>
          , Kolkata, India,
          <source>December 12- 15</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Mandal</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghosh</surname>
            <given-names>K</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhattacharya</surname>
            <given-names>A</given-names>
          </string-name>
          , et al.
          <article-title>Overview of the FIRE 2017 IRLeD Track: Information Retrieval from Legal Documents</article-title>
          [C]//FIRE (Working Notes).
          <year>2017</year>
          :
          <fpage>63</fpage>
          -
          <lpage>68</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Fagan</surname>
          </string-name>
          .
          <article-title>Automatic Phrase Indexing for Document Retrieval: An Examination of Syntactic and Non-Syntactic Methods</article-title>
          .
          <source>In SIGIR'87</source>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , J.-Y. Nie, G. Wu, and
          <string-name>
            <given-names>G.</given-names>
            <surname>Cao</surname>
          </string-name>
          .
          <article-title>Dependence language model for information retrieval</article-title>
          .
          <source>In SIGIR'04</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>F.</given-names>
            <surname>Song</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          .
          <article-title>A general language model for information retrieval</article-title>
          .
          <source>In CIKM'99</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Srikanth</surname>
          </string-name>
          and
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Srihari</surname>
          </string-name>
          .
          <article-title>Biterm language models for document retrieval</article-title>
          .
          <source>In SIGIR'02</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Robertson</surname>
          </string-name>
          , Stephen, Zaragoza, et al.
          <article-title>Simple BM25 extension to multiple weighted fields</article-title>
          [C]// Thirteenth Acm International Conference on Information &amp;
          <article-title>Knowledge Management</article-title>
          . ACM,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Willett</surname>
            <given-names>P.</given-names>
          </string-name>
          <article-title>The Porter stemming algorithm: then and now</article-title>
          [J].
          <source>Program Electronic Library &amp; Information Systems</source>
          ,
          <year>2006</year>
          ,
          <volume>40</volume>
          (
          <issue>3</issue>
          ):págs.
          <fpage>219</fpage>
          -
          <lpage>223</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>