<!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>uQick Check: A Legal Research Recommendation System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Merine Thomas</string-name>
          <email>merine.thomas@tr.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wenhui Liao∗</string-name>
          <email>wendy.liao2009@gmail.com</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Don Teo</string-name>
          <email>don.teo@tr.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Vacek</string-name>
          <email>thomas.vacek@tr.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>George Sanchez</string-name>
          <email>george.sanchez@tr.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kanika Madan</string-name>
          <email>kanika.madan@tr.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xin Shuai∗</string-name>
          <email>shuaixin.david@gmail.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paras Sethia</string-name>
          <email>paras.sethia@tr.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tonya Custis∗</string-name>
          <email>tonya.custis@autodesk.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ACM Reference Format:</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Autodesk AI Lab</institution>
          ,
          <addr-line>San Francisco, CA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Center for AI and Cognitive</institution>
          ,
          <addr-line>Computing, Thomson Reuters, Eagan, MN</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Center for AI and Cognitive</institution>
          ,
          <addr-line>Computing, Thomson Reuters, Toronto</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Merine Thomas, Thomas Vacek</institution>
          ,
          <addr-line>Xin Shuai, Wenhui Liao, George Sanchez, Paras Sethia, Don Teo, Kanika Madan, and Tonya Custis. 2020. Quick Check:</addr-line>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Minneapolis</institution>
          ,
          <addr-line>MN</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>Wissee Inc.</institution>
          ,
          <addr-line>Sammamish, WA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <abstract>
        <p>Finding relevant sources of law that discuss a specific legal issue and support a favorable decision is an onerous and time-consuming task for litigation attorneys. In this paper, we present Quick Check, a system that extracts the legal arguments from a user's brief and recommends highly relevant case law opinions. Using a combination of full-text search, citation network analysis, clickstream analysis, and a hierarchy of ranking models trained on a set of over 10K annotations, the system is able to efectively recommend cases that are similar in both legal issue and facts. Importantly, the system leverages a detailed legal taxonomy and an extensive body of editorial summaries of case law. We demonstrate how recommended cases from the system are surfaced through a user interface that enables a legal researcher to quickly determine the applicability of a case with respect to a given legal issue.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Information systems → Retrieval models and ranking; •
Computing methodologies → Information extraction.
recommendation; learning to rank; legal research
∗Work done while at Thomson Reuters.
1</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>When preparing or reviewing a legal brief, litigation attorneys
spend a significant amount of time searching for the most pertinent
authority to bolster or refute a particular point of law. This involves
sifting through a collection of millions of primary and secondary
sources of law, as well as past briefs and memoranda. The task is
particularly challenging given the need for high recall; an
incomplete legal research process can potentially miss a highly relevant
source of law that would adversely impact the litigation strategy.</p>
      <p>
        Early work in document recommendation for legal research
focused on the retrieval of relevant authority and briefs through a
combination of explicit user query input and implicit user browsing
behavior [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or by attempting to cluster legal issues into broader
topics [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In this paper, we present an approach that considers the
task from a citation recommendation perspective [
        <xref ref-type="bibr" rid="ref3 ref5">3, 5</xref>
        ]. Our system,
Quick Check, complements the legal research process by extracting
the core legal arguments of interest directly from a user’s input
brief document and recommending relevant primary and secondary
sources of law. In particular, the system leverages a combination of
full-text search, citation network analysis, and clickstream analysis
to surface highly relevant case law opinions. Importantly, apart
from the user’s brief, no other user interaction is required by the
system to interpret the legal issues and locate relevant authority.
      </p>
      <p>While the structure and formatting styles of legal briefs in the
U. S. federal and state court systems will vary depending on the
court level and jurisdiction, a typical document will include at least
the following main sections (or the equivalents thereof): (1) an
Introduction articulating the party’s claim and relief sought, (2) a
Statement of Facts that summarize key factual elements at issue
and the procedural history of the case, (3) an Argument section
containing the legal issues at hand and related supporting facts,
and (4) a Conclusion summarizing the main points and the specific
relief sought. The Argument section is typically further divided into
subsections, each discussing a particular legal issue. We refer to
each subsection as an issue segment. The recommendation system
we describe follows an issue-segment-centric approach; potentially
relevant cases are mined and ranked with respect to a particular
issue segment in the brief.
2</p>
    </sec>
    <sec id="sec-3">
      <title>TRAINING DATA COLLECTION</title>
      <p>The case ranking component of the system (Section 3.3) was trained
on a large corpus of graded issue-segment-to-case pairs. The initial
pairs were collected from a combination of manual curation by
attorneys and an early prototype of the system, while the bulk of the
dataset was collected from the output of successive improvements
to the system. The quality of a recommended case was graded on
a five-point Likert scale, reflecting the degree to which a case is
relevant to the legal issue at hand. A recommendation with a rating
of 4 or 5 is considered highly relevant, while one with a rating of 1
is considered irrelevant. In total, we collected over 10K graded pairs
from attorney-editors for model training. The briefs were chosen
to cover a variety of jurisdictions, practice areas, and motion types.
3</p>
    </sec>
    <sec id="sec-4">
      <title>SYSTEM OVERVIEW</title>
      <p>The first stage of the pipeline converts a user’s uploaded brief
document into HTML, which is used for all downstream document
section parsing logic. Stylistic information contained in the HTML
tags provide an obvious indication of section headings. Therefore,
the system searches for the presence of a combination of bold,
alignment, and heading elements. Of primary interest to the
recommendation system is the accurate identification of the Argument
section of a brief. Thus, a set of high-precision rules is applied
against the extracted set of headings to capture the top-level
Argument heading, which may include terms such as "Discussion",
"Memorandum", or "Analysis". Subsection headings in the
Argument section are identified through the presence of a numbering
or word capitalization convention.</p>
      <p>Each issue segment of the Argument section is a collection of
paragraphs and citations describing a particular legal issue. We
consider each issue segment in isolation when discovering and
ranking candidate cases.
3.2</p>
    </sec>
    <sec id="sec-5">
      <title>Candidate Case Discovery</title>
      <p>Given an issue segment, the system first collects a large pool of
potentially relevant cases. This is done using both search-based
and citation-based document discovery mechanisms.
3.2.1 Search-engine-based Candidate Discovery. Each paragraph
within a segment discusses a particular aspect of the legal issue at
hand. For each of these paragraphs, we perform full-text search
across a corpus of about 12M case law opinions using a proprietary
search engine tuned for the legal domain. To increase the
jurisdictional relevance of results, the search is restricted to a subset
of jurisdictions based on the corresponding jurisdictions of the
citations present within the segment or the rest of the brief.</p>
      <p>
        In addition to the case law opinions themselves, we consider
cases from a context-aware citation recommendation perspective [
        <xref ref-type="bibr" rid="ref3 ref6">3,
6</xref>
        ]. In particular, we leverage an index of pseudo-documents, each
representing a case, constructed in the following manner. For a
given case, we consider all cases and previously filed briefs in
which a citation to the case is made. The sentence preceding the
citation reference within the document is extracted and added to
the pseudo-document corresponding to the case. Thus, a case’s
pseudo-document is an aggregate of all extracted reference texts
and provides a representation of the legal context in which a case is
cited. A set of full-text searches using the issue segment paragraphs
is also performed over this index.
3.2.2 Citation-based Candidate Discovery. The set of case citations
within an issue segment (hereafter referred to as input citations)
gives a valuable characterization of the legal issue being discussed.
The system leverages this citation "profile" to find potentially related
cases through the following means:
• Case and brief citation network: The most directly
related cases are those that are bibliographically coupled to
the input citations (i.e. cases citing the same input citations).
Similarly, a brief citation network is constructed by
decomposing the corpus of past filed briefs into issue segments.
We then consider all bibliographically coupled segments. For
both the case and brief-issue-segment networks, we extract
the set of other cases that are cited in the coupled case or
issue segment as candidate recommendations.
• Statutory annotations: Statutory annotations provide
concise summaries of important cases that have interpreted a
statute or regulation. They are organized editorially in a
hierarchy of procedural topics. Candidate recommendations
are extracted by considering the cases that are found within
the same procedural topic as an input citation.
• Pinpoint headnotes: An input citation will often be
accompanied by a direct quote from the cited case or a page number
pinpointing the relevant portion of the case. Moreover, a case
will often have one or more editorial summaries, called
headnotes, that highlight important points of law in the case.
Headnotes contain reference links to the corresponding
location within the case document where the point of law is
discussed. Thus, one can correlate the input citation to one
or more headnotes in the cited case based on a combination
of the pinpoint information and headnote reference links1.
This is useful because extensive editorial annotations exist
that identify explicitly the point of law (i.e. headnote) for
which a case is citing another case. Therefore, the system
1If more than one headnote is identified, the most relevant headnote is determined
based on a combination of text similarity and topic similarity measures, the latter of
which leverages a legal topic taxonomy.
is able to retrieve cases that cite the same case for the same
reason as the input citation of the issue segment.
• Clickstream analysis: Within a particular research web
session on our legal research platform, a user will interact
with cases in a number of ways, including viewing the case,
saving it to a folder, or printing the case document. Research
session activity is aggregated across all users to provide
implicit relevance feedback of cases. In particular, given the
citation profile of the issue segment, the system finds cases
that commonly appear within the same session.
3.3
      </p>
    </sec>
    <sec id="sec-6">
      <title>Case Ranking</title>
      <p>
        The pool of candidates collected from the discovery stage is passed
through two ranking SVM models [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The first ranker uses
metadata information corresponding to each of the discovery methods
as features (e.g. how often the case was found in the top 5 results of
searches, the number of input citations the case is bibliographically
coupled with, etc.) and acts as a filter to reduce the pool size down
to several hundred cases.
      </p>
      <p>
        The second ranker leverages an additional set of features that
measure the textual and topical similarity of the issue segment
and the candidate case, where the issue segment is represented
by either its textual content or the pinpoint headnotes of its input
citations (Section 3.2.2). Textual similarity is computed using an
edit-distance-based similarity measure, while topical similarity is
assessed from the hierarchical similarity of the segment and
candidate case when classified under a legal topic taxonomy using a
legal topic classifier [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Additionally, the recency of a case is
taken into account at this stage.
      </p>
      <p>
        Finally, the top-ranked candidates are fed to an ensemble-based
pointwise ranker [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] leveraging additional features that analyze
the results of the search-based discovery component. The model
produces a probability score on the relevancy of a case, which is
used to filter out poor quality recommendations prior to surfacing
to the user.
4
      </p>
    </sec>
    <sec id="sec-7">
      <title>RESULTS</title>
      <p>The quality of the output recommendations is measured against
a test set of nearly 500 briefs (corresponding to about 2K issue
segments) using several metrics of varying granularity. Across all
recommendations, the percentages of highly relevant, relevant, and
irrelevant recommendations are 39%, 60.5%, and 0.5%, respectively.
At an issue segment level, the percentages of segments with at
least one highly relevant, at least one relevant or highly relevant,
and at least one irrelevant recommendation are 67%, 97%, and 1%,
respectively, while the mean   @5 per issue of relevant or
highly relevant recommendations is 0.66. For comparison, we note
that the first ranker alone achieves a mean   @5 of 0.62. Finally,
at a brief level, the percentage of briefs where at least one-third of
the recommendations are highly relevant is 55%.
5</p>
    </sec>
    <sec id="sec-8">
      <title>DEMONSTRATION</title>
      <p>Users can upload briefs that are in either an early draft or nearly
completed state. They may also choose to analyze an old brief
with potentially outdated authority or even an opposing party’s
document. When a brief document has been uploaded, the
recommendation system pipeline is run. The entire pipeline completes
in under a couple minutes for a brief document of typical length.
The recommended cases are displayed and grouped by the
corresponding issue segments. Each case is accompanied with additional
information that helps to put the recommendation in context for the
user, including the input citations that are related and the portion of
text within the case found to be most similar to the issue segment.
The latter is determined using a combination of legal topic
classification (Section 3.3) and a vector space model representation of the
issue segment and the recommended case. A recommendation may
also be marked with additional tags highlighting if the case is from
a high court, is frequently cited, or is less than 2 years old. Figure 2
shows the Quick Check interface for a sample brief.</p>
      <p>After being presented with the recommended cases, a user may
iflter the the results based on the issue segment of interest, or
by a specific date range or jurisdiction. The user can also choose
to lower the threshold of the final ranker model to explore more
recommendations from the system. Recommended cases can then
be viewed in full or saved/downloaded for further review.
6</p>
    </sec>
    <sec id="sec-9">
      <title>CONCLUSION</title>
      <p>We presented Quick Check, a commercially available system that
recommends cases with highly similar legal issues and facts given
a user’s input brief document. The system leverages a multitude
of case discovery pathways and ranking models trained over a
large annotated training set to extract the most relevant cases to
a given legal issue. The system is robust against the wide variety
of brief formatting styles and has been found to be efective across
jurisdictions, practice areas, and motion types.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Khalid</given-names>
            <surname>Al-Kofahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Jackson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dahn</surname>
          </string-name>
          , Charles Elberti,
          <string-name>
            <given-names>William</given-names>
            <surname>Keenan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and John</given-names>
            <surname>Duprey</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>A Document Recommendation System Blending Retrieval and Categorization Technologies</article-title>
          .
          <source>In Proceedings of AAAI Workshop on Recommender Systems in e-Commerce</source>
          .
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Khalid</given-names>
            <surname>Al-Kofahi</surname>
          </string-name>
          , Alex Tyrrell, Arun Vachher, Tim Travers, and
          <string-name>
            <given-names>Peter</given-names>
            <surname>Jackson</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Combining Multiple Classifiers for Text Categorization</article-title>
          .
          <source>In Proceedings of the Tenth International Conference on Information and Knowledge Management (Atlanta</source>
          , Georgia, USA) (
          <source>CIKM '01)</source>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <fpage>97</fpage>
          -
          <lpage>104</lpage>
          . https://doi.org/10.1145/502585.502603
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Michael</given-names>
            <surname>Färber</surname>
          </string-name>
          and
          <string-name>
            <given-names>Adam</given-names>
            <surname>Jatowt</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Citation Recommendation: Approaches and Datasets</article-title>
          . ArXiv abs/
          <year>2002</year>
          .06961 (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Trevor</given-names>
            <surname>Hastie</surname>
          </string-name>
          , Robert Tibshirani, and
          <string-name>
            <given-names>Jerome</given-names>
            <surname>Friedman</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>The Elements of Statistical Learning</article-title>
          (second ed.). Springer New York Inc., New York, NY, USA,
          <volume>339</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Qi</given-names>
            <surname>He</surname>
          </string-name>
          , Daniel Kifer, Jian Pei, Prasenjit Mitra, and
          <string-name>
            <given-names>C. Lee</given-names>
            <surname>Giles</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Citation Recommendation without Author Supervision</article-title>
          .
          <source>In Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (Hong Kong, China) (WSDM '11)</source>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <fpage>755</fpage>
          -
          <lpage>764</lpage>
          . https://doi.org/10.1145/1935826.1935926
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Qi</given-names>
            <surname>He</surname>
          </string-name>
          , Jian Pei, Daniel Kifer, Prasenjit Mitra, and
          <string-name>
            <given-names>Lee</given-names>
            <surname>Giles</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Context-Aware Citation Recommendation</article-title>
          .
          <source>In Proceedings of the 19th International Conference on World Wide Web (Raleigh</source>
          , North Carolina, USA) (
          <source>WWW '10)</source>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <fpage>421</fpage>
          -
          <lpage>430</lpage>
          . https://doi.org/10.1145/ 1772690.1772734
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Joachims</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>Optimizing Search Engines Using Clickthrough Data</article-title>
          .
          <source>In ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)</source>
          .
          <volume>133</volume>
          -
          <fpage>142</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Qiang</given-names>
            <surname>Lu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jack G.</given-names>
            <surname>Conrad</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Bringing Order to Legal Documents - An Issue-based Recommendation System Via Cluster Association</article-title>
          . In KEOD.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>