<!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>Automated Methods for Extracting and Expanding Lists in Regulatory Text</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alan BUABUCHACHART</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nina CHARNESS</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Katherine METCALF</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leora MORGENSTERN</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Leidos</institution>
          ,
          <addr-line>4001 N. Fairfax Drive, Arlington, VA 22203</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This is a highly condensed version of a paper [1] that presents automated methods to accurately transform regulations with bulleted lists into sets of complete sentences that include their proper context. We discuss the technical challenges addressed, including extracting intended structure from HTML documents, and correctly distributing preambles over nested text. Our work has been used to preprocess the corpus used for our experiments in classifying paragraphs in regulatory documents by several categories, including illocutionary point, regulation type, and reference structure. That work is presented in a companion paper published in the JURIX 2013 proceedings.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>text analysis</kwd>
        <kwd>regulation</kwd>
        <kwd>preprocessing</kwd>
        <kwd>classi cation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Many regulatory documents contain or are largely composed of bulleted lists.
Such lists break up complex text and increase comprehension for human readers,
who are good at distributing preambles over bulleted text as they read. However,
automated processing of such documents is di cult, especially if bulleted units
are not complete sentences, and if there are multiple levels of nesting. We develop
automated methods to transform text that contains bullets to text in which the
bulleted text is fully expanded, with preambles distributed over the bulleted text.</p>
      <p>This work is a preliminary step in our study of the feasibility of automating
the translation of regulatory text into formal, executable rules. Our approach to
this general problem involves both machine learning and deep parsing techniques;
we have found that distribution is a necessary rst step for both tasks. As
discussed in [2], both the consistency of annotation/training data and the
performance of clustering algorithms is superior when using expanded text rather than
standard bulleted text, or bulleted text to which sentence splitting techniques [3]
have been applied. Moreover, the loss of context inherent in sentence splitting
suggests that expanded text will lead to more accurate parsing.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Motivating Example: The importance of context in reading bulleted lists</title>
      <p>Domain and corpus: We are working with a corpus of 250 United States nancial
regulation units. Consider, e.g., the initial fragment of FINRA Rule 3240:
3240. Borrowing From or Lending to Customers
(a) Permissible Lending Arrangements; Conditions
No person associated with a member in any registered capacity may borrow money from or lend money
to any customer of such person unless:</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) the member has written procedures allowing the borrowing and lending of money between
such registered persons and customers of the member;
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) the borrowing or lending arrangement meets one of the following conditions:
(A) the customer is a member of such person's immediate family;
(B) the customer (i) is a financial institution regularly engaged in the business of
providing credit ...
and (ii) is acting in the course of such business;
(C) the customer and the registered person are both registered persons of the same member; .....
Bulleted structure aids human comprehension by breaking up text. We
understand that bullet (a) lists ways in which lending is allowed; that subbullet (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
speci es alternative necessary conditions constraining the relationship between
customer and lender. As we read the text we must keep context in mind.
      </p>
      <p>[3] and [4] advocate processing bulleted text by using punctuation cues to do
sentence splitting. This yields sentences such as the member has written procedures
allowing the borrowing and lending of money between such registered persons and
customers of the member. Such sentences are missing context and are therefore
di cult to understand.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Extracting from HTML, Tree Building, Distributing Preambles</title>
      <p>
        In developing our technical approach, we address two hard problems: (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
extracting bulleted structure from available text; (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) building a tree structure that
supports expansion and distribution of parent preambles over child bullets for
arbitrarily deep levels of nesting. We can then traverse the tree to obtain the
distributed text.
      </p>
      <p>We recovered bulleted structure using HTML les from 6 di erent online law
sources. Utilities like jsoup facilitate detection of paragraphs and indentation.
HTML tags facilitate getting rid of junk text. Unfortunately, no source HTML
les use standard bulleting tags (e.g., &lt;ol&gt;, &lt;/ol&gt;) to indicate bullets in the
text. Recovering the bulleted list structure is challenging because each website
has its own conventions for representing lists, necessitating customized analysis.
One source often has several nested labels appearing in a single line, which makes
it di cult to distinguish bullet labels from references to other regulation parts
and introduces potential error. For all sources, it is di cult to determine if a label
like \(i)" acts as a letter or a Roman numeral, which could introduce error when
multiple levels of nesting are present.</p>
      <p>The extraction step outputs a set of labels, each of which is assigned a label
type (e.g., uppercase letter, Arabic numeral) and is attached to a chunk of text
in the document. The tree is then built by traversing the document:</p>
      <sec id="sec-3-1">
        <title>For each paragraph</title>
      </sec>
      <sec id="sec-3-2">
        <title>If the label type is di erent than the previous label type Else Else</title>
      </sec>
      <sec id="sec-3-3">
        <title>If the label type is not on the stack</title>
      </sec>
      <sec id="sec-3-4">
        <title>Create a new node and add it as a child of the previous node</title>
      </sec>
      <sec id="sec-3-5">
        <title>Save previous node as the parent of this node</title>
      </sec>
      <sec id="sec-3-6">
        <title>Put this label type on the stack</title>
      </sec>
      <sec id="sec-3-7">
        <title>Remove everything above this label type from the stack</title>
      </sec>
      <sec id="sec-3-8">
        <title>Find the parent of the current label type</title>
      </sec>
      <sec id="sec-3-9">
        <title>Create a new node and add it as a child of that parent</title>
      </sec>
      <sec id="sec-3-10">
        <title>Create a new node and add it as a child of the same parent of previous node</title>
        <p>
          It is then easy to distribute preambles over bullet content: every path in the
tree corresponds to one fully expanded bullet. One need only read out the text
associated with the nodes in the path to obtain the fully expanded and distributed
bullet. The text associated with all ancestors of the bullet is concatenated with
the text of the bullet itself. A sample of the results for the distributed version of
our example is shown below.
ditions No person associated with a member in any registered capacity may borrow money from
or lend money to any customer of such person unless: (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) the borrowing or lending arrangement
meets one of the following conditions: (B) the customer (i) is a nancial institution regularly
engaged in the business of providing credit
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results and Utility</title>
      <p>We have achieved near perfect results in distribution of bulleted text. We have
used this method to preprocess our corpus of 250 regulation units, and have found
that annotation and clustering algorithms are markedly superior when working
on text in which bullets have been expanded [2]). When using sentence splitting
methods, we could identify de nitions with an average F1 score of barely .8.
(Recall was relatively low since many de nitions were identi ed as regulations.)
Using the expanded, distributed text, the F1 score rose to .95. Certain classi cation
experiments were impossible before bullet expansion. For example, we could not
annotate regulation types after sentence splitting, since the lines of text often had
too little context; these di culties disappeared once bulleted lists were expanded.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Acknowledgements</title>
      <p>The research described in this paper is supported by the Intelligence Advanced Research Projects Activity
(IARPA) via the Air Force Research Laboratory (AFRL) contract number FA8750-13-C-0085. The U.S.
Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any
copyright annotation thereon. Disclaimer: The views and conclusions contained herein are those of the authors
and should not be interpreted as necessarily representing the o cial policies or endorsements, either expressed
or implied, of IARPA, AFRL, or the U.S. Government.</p>
      <p>Thanks also to Adam Wyner, Ron Keesing, and Ted Senator for helpful ideas and suggestions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Buabuchachart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Charness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Metcalf</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Morgenstern</surname>
          </string-name>
          ,
          <source>Automated Methods for Extracting and Expanding Lists in Regulatory Text</source>
          , Working paper, at http://cs.nyu.edu/leora/papers .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Buabuchachart</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Metcalf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Charness</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Morgenstern</surname>
          </string-name>
          ,
          <source>Automated Classi cation of Regulatory Text by Discourse Structure</source>
          ,
          <string-name>
            <given-names>Reference</given-names>
            <surname>Structure</surname>
          </string-name>
          , and Regulation Type,
          <string-name>
            <surname>JURIX</surname>
          </string-name>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Dell'Orletta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montemagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Plank</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Venturi</surname>
          </string-name>
          , The SPLeT-2012
          <source>Shared Task on Dependency Parsing of Legal Texts, SPLeT</source>
          <year>2012</year>
          , Workshop on Semantic Processing of Legal Text,
          <source>at LREC</source>
          <year>2012</year>
          , Istanbul.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Wyner</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.</given-names>
            <surname>Peters</surname>
          </string-name>
          , On Rule Extraction from Regulations,
          <string-name>
            <surname>JURIX</surname>
          </string-name>
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>