<!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>Suggesting Model Fragments for Sentences in Dutch Law</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emile de Maat</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Radboud Winkels</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Leibniz Center for Law, University of Amsterdam</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2010</year>
      </pub-date>
      <fpage>19</fpage>
      <lpage>28</lpage>
      <abstract>
        <p>A main issue in the field of artificial intelligence and law is the translation of source of law that are written in natural language into formal models of law. This article describes a step in that transformation: the creation of models for individual sentences in a source of law. The approach uses a natural language parse to analyse the sentence, and then translates the resulting parse tree to a formal model, using both generic and law-specific attributes. 1 See http://www.metalex.eu/</p>
      </abstract>
      <kwd-group>
        <kwd>Automated Modelling</kwd>
        <kwd>Natural Language Processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>A main issue in the field of artificial intelligence and law is the transformation
of sources of law that are written in natural language (and therefore rather
informal) into formal models of law that computers can reason with. This is a
time and effort consuming process, error prone and different knowledge
engineers will arrive at different models for the same sources of law. Moreover,
these models should be closely linked to the original sources (and at the right
level of detail, i.e. isomorphic) since these sources tend to change over time
and maintenance of the models is a serious problem. This calls for tools and
a method for supporting this modelling process and increasing inter-coder
reliability.</p>
      <p>We have been researching a method to create isomorphic models
semi-automatically, focusing on (Dutch) laws. This article presents a next step in this
creation process.</p>
      <sec id="sec-1-1">
        <title>1.1. GENERAL APPROACH</title>
        <p>
          In order to achieve (semi-)automatic modelling of legal sources, we follow
a number of steps, as shown in figure 1. The process starts with the source
document, written in natural language (Dutch). Currently, we focus on laws,
though we hope to expand to other types of legal sources later on. We first
make the structure of the document explicit, by marking up the different
parts, such as chapters, paragraphs and sentences, and assigning identifiers
to each part. We then proceed to mark all references to other legal sources
that are contained in the text, using a parser based on patterns for references
(see
          <xref ref-type="bibr" rid="ref5">(de Maat, 2006)</xref>
          ). This structure and reference information is stored in
CEN/MetaLex XML1.
        </p>
        <p>
          The next step is to create models for each individual statement in the text. In
most cases, each sentence in Dutch law forms a complete statement (though
possibly part of a bigger construct), so we are, in fact, creating a model
for each sentence in the text. In the last step, these individual models are
integrated with each other to come to a complete model. In order to create
the models, we start by classifying each sentence in the text as a specific
provision, such as a definition, a duty, or a modification of an earlier law. In
total, we recognise ten different main categories. As with the references, this
is done by recognising certain patterns in the text
          <xref ref-type="bibr" rid="ref6">(de Maat, 2008)</xref>
          .
For several types of statements, such as modifications and setting the
enactment date or citation title, recognising the pattern and classifying the sentence
is also nearly sufficient for creating a model of the sentence. For example:
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Aliens Act 2000</title>
      <p>This law is referred to as: Aliens Act 2000.</p>
      <p>
        This sentence is classified by the pattern “is referred to as”, which splits the
sentence in two parts: a reference (recognised by the reference parse) to “this
law” and a citation title. This is all the information that is needed to represent
the meaning of this sentence2. More elaborate sentences, that contain terms
relating to the subject matter that the law is about, require more detailed
analysis3. A natural language parser can provide such a more detailed analysis.
This paper describes our initial experiences while using a natural language
parser to enhance the input for our modeller. For this research, we have used
the Alpino parser for Dutch
        <xref ref-type="bibr" rid="ref3">(Bouma, 2001)</xref>
        to parse the sentences. The Alpino
parser assigns a dependency structure to the sentence. These structures are
described by Bouma et al:
      </p>
      <p>2 As said, this also holds true for sentences containing modifications to other legal sources.
However, for such sentences, analysis of the modified text is needed to determine the full
impact (not meaning) of such a sentence.</p>
      <p>
        3 This applies to norms, definitions and many application provisions. Earlier research
        <xref ref-type="bibr" rid="ref6">(de
Maat, 2008)</xref>
        suggests that these comprise about 64% of the sentences encountered.
Dependency structures make explicit the dependency relations between
constituents in a sentence. Each non-terminal node in a dependency
structure consists of a head-daughter and a list of non-head daughters, whose
dependency relation to the head is marked.
      </p>
      <p>The dependency structure can be stored as an XML file, which is the format
we use as input for our modeller.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Creating Model Fragments</title>
      <p>
        Our approach is similar to that published in
        <xref ref-type="bibr" rid="ref1">(Biagioli, 2005)</xref>
        , where Italian
laws are modelled. However, Biagioli et al. aim for fairly rough frames; for
example, for an obligation, their approach attempts to fill the slots addressee,
action and third-party. We hope to achieve some more detail, splitting up these
fields in more parts. In this sense, our method comes closer to those of
        <xref ref-type="bibr" rid="ref8">(Sarwar Bajwa, 2009)</xref>
        , who generates UML models from parse trees,
        <xref ref-type="bibr" rid="ref7">(McCarty,
2007)</xref>
        , who transforms parse trees to quasi-logical form, or
        <xref ref-type="bibr" rid="ref2">(Bos, 2004)</xref>
        , who
translate parse trees to first order logic statements. Both these methods map
individual words to model elements. An example by Bos et al:
The school-board hearing at which she was dismissed was crowded with
students and teachers.
      </p>
      <p>This results in the following first-order logic statement:
9a((school board(a) ^ hearing(a)) ^ 9b( f emale(b) ^ 9c(dismiss(c) ^
(patient(c; b)^(at(a; c)^9d(crowd(d)^(patient(d; a)^(9e(student(e)^
with(d; e)) ^ 9 f (teacher( f ) ^ with(d; f ))) ^ event(d)))))))))
We wish to mix these approaches. For normative sentences, this means that
we see each normative sentence as describing a situation that is allowed or
disallowed. We consider the main verb of a sentence as the action that is
allowed or disallowed, with the other elements being modifiers or properties
of that action. For example:</p>
      <p>Our Minister issues a warrant to the negligent person.</p>
      <p>The main verb of this sentence is to issue, so that is considered the action.
Properties of this action are the subject (Our Minister), the direct object (a
warrant) and the indirect object (the negligent person). All these elements
are distinguished by the Alpino parser, allowing us to extract them for our
model. Within Dutch law, this sentence format expresses an obligation, so
the action as a whole is classified as an obligation.</p>
      <sec id="sec-3-1">
        <title>Obligation</title>
      </sec>
      <sec id="sec-3-2">
        <title>Action</title>
        <p>Subject
Direct Object
Indirect Object
issue
Our Minister
warrant
negligent person
The articles (the, a) are left out of the model, though they are stored internally,
as they are of importance during later integration of the model; the negligent
person often is a reference to an earlier sentence, whereas a negligent person
is not.</p>
        <p>Further detail can be added by splitting of adjectives and relative clauses
from the noun they modify. For example, negligent person has two
properties: being a person and being negligent. Splitting adjectives from nouns is
not always desirable; it is preferable to leave multiword expressions intact.
European Union is not any union that is also European; Our Minister of
Finance is not any minister that is also ours, and of finance4. Instead, these are
references to concepts that have been defined elsewhere: the common sense
domain, the juridical domain or elsewhere in this law. Common multiword
expressions are recognised by the Alpino parser; juridical domain or
lawdependent expressions need be filtered out separately.</p>
        <p>Relative clauses are more complex then adjectives, as they contain a complete
new sentence. In this case, we repeat the procedure for the main sentence,
identifying the main action and all properties of that action. For example:</p>
        <p>Our Minister issues a warrant to the person that neglected his duties.
This sentence would yield a frame like5:</p>
      </sec>
      <sec id="sec-3-3">
        <title>Obligation</title>
      </sec>
      <sec id="sec-3-4">
        <title>Action</title>
        <p>Subject
Direct Object
Indirect Object
issue
Our Minister
warrant
person
subjectOf
Action
Direct Object
neglect
his duties
4 In Dutch laws, Our Minister of Finance is a reference to the (Dutch) Minister of Finance.
No more detailed model is needed, as no derivations need to be made.</p>
        <p>
          5 For the moment we use a frame-like representation. These look somewhat like the frames
presented by
          <xref ref-type="bibr" rid="ref4">(van Kralingen, 1995)</xref>
          , but these were more legally oriented and had a fixed
number of slots, while our structures are more dynamic and language oriented
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>2.1. FILTERING OUT SIGNAL WORDS</title>
        <p>The sentences we showed above are examples of normative sentences that
do not use signal words; only the desired situation is described, and it is left
implicit that this is an obligation. Other sentences in the law use signal words
to make the kind of norm explicit, such as:</p>
        <p>The buyer is obliged to pay the price.6
This sentence uses is obliged to make it clear that this is an obligation. Other
examples of signal words are must, may and is allowed. These sentences
require a different approach than the sentences without signal words. If we
were to use the same approach, the result would be something like:</p>
      </sec>
      <sec id="sec-3-6">
        <title>Obligation</title>
      </sec>
      <sec id="sec-3-7">
        <title>Action is obliged to pay</title>
        <p>Subject buyer</p>
        <p>Direct Object price
This is not a desirable outcome, as the action that this norm deals with is pay
rather than is obliged to pay. When modelling these sentences, these signal
words should not be included in the model of the situation (their meaning is
translated into whether the situation is allowed or disallowed). Ideally, after
we have categorised the sentence (based on the signal words), we would like
to transform the sentence to a sentence without signal words, like:</p>
        <p>The buyer pays the price.</p>
        <p>We could then model that sentence to come to a correct frame. Simply leaving
out the signal words may lead to errors, since the role of the other words might
need to shift as well. However, the parse of the sentence actually contains this
“transformed sentence” that we want to model. This is shown in figure 2.</p>
        <p>Beneath the body node, we find exactly the sentence that we are looking
for. Alpino assigns this dependency structure to any sentence that follows this
pattern. This makes it easy to filter out the signal words by simply focusing
on the part of the parse tree that contains the transformed sentence. For each
pattern we use for classification, it seems possible to define a part of the parse
tree that should be ignored in order to come up with a correct model.</p>
      </sec>
      <sec id="sec-3-8">
        <title>2.2. PASSIVE VOICE</title>
        <p>Many sentences in Dutch law are phrased in the passive voice, such as this
instruction:</p>
      </sec>
      <sec id="sec-3-9">
        <title>6 Dutch Civil Code, BW7, article 6 sub 1.</title>
        <p>An English translation is added to this report.7
A sentence in the passive voice cannot be modelled in the same way as a
regular sentence, as the subject of the sentence is actually the direct object,
and should be modelled as such. Again, the parse of the sentence gives us an
easy way to do this:</p>
        <p>The verb clause (vc) of the sentence holds the sentence in active voice,
with the subject re-cast in the role of object. By modelling the verb clause
instead of the sentence as a whole, we get the correct model, with the correct
object, and without the auxiliary verb. If the actual subject is present in the
sentence (for example, if the sentence would readAn English translation is
added to this report by the organiser), then this prepositional object is not
re-cast in the role of object in the tree. We will have to detect its presence by
scanning for signal words like by. As this does not always indicate a subject,
this will be one of the cases were human validation is necessary.</p>
      </sec>
      <sec id="sec-3-10">
        <title>7 Law for the protection of Antarctica, article 33, sub 3</title>
        <p>2.3. LISTS
Lists are also recognised by the Alpino parser, and can therefore easily be
added to our models as the union or intersection of the different list items,
depending on the conjunction used. However, though the conjunction and
suggests an intersection, it often expresses a union instead. For example:</p>
        <p>Advances and duties are paid in cash.</p>
        <p>In this sentence, it is the union of advancesand dutiesthat is meant. Our
current approach is to translate andwith a union if it appears in a relative clause,
and with an intersection otherwise.</p>
      </sec>
      <sec id="sec-3-11">
        <title>2.4. NEGATION</title>
        <p>Negative sentences should also be recognised, and modelled as the “positive”
sentence, with the additional notion that it is inverted. This can usually be
done by not including certain signal words as element in the model, but by
inverting the model if it is encountered. The most common signal word is not.
If it is encountered, it is not added to the frame, but instead, the containing
element is marked as inverted. The determinerno is another example of a
signal word for negation. However, it can affect more than its containing
element. For example:</p>
        <p>No bodies are interred on a closed cemetery.</p>
        <p>This is an obligation, and the direct object of this sentence is no bodies.
However, if we apply the negation simply to the object, i.e. the object is “not
a body”, it would imply the obligation of to bury something that is not a body
on the cemetery. Instead, we need to apply the negation to the entire sentence:
On is obliged not to bury bodies at a closed cemetery.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Experiences</title>
      <p>At this moment, we do not have a fully automated process to create the
models, and have not yet tested this method on a large body of sentences. Instead,
random sentences have been selected, parsed using Alpino and then fed into
our modeller.</p>
      <p>There is a clear difference between the computer generated models and those
created by a human expert with regard to the granularity of the model. Our
method will create models with model elements that represent one word from
the original sentence, whereas a human expert is more likely to include some
sentence fragments as a whole. For example, one Dutch law defines an
alcoholic drink as the drink that, at a temperature of twenty degrees Celsius,
consists of alcohol for fifteen or more volume percents, with the exception
of wine. Our algorithm will dissect this sentence, whereas most human
modellers will leave the first subordinate sentence intact and add it to the model
as a single attribute (most likely abbreviated to alcohol by volume). A more
detailed model seems not necessarily wrong, but quite possibly over-the-top
and inconvenient for many applications.</p>
      <p>The method assigns rather broad categorisations to each object (it is either
a direct, indirect or prepositional object), but does not yet assign a legal
meaning to such an object. It may be a third party involved or the instrument.
Perhaps this is not an obstacle; users dealing with a system based on such
models are likely to recognise the roles from the context and language used,
whereas a computer does not need this information for the derivations we
currently want to make. For future projects, though, the information may be
required, and some way to automatically recognise it is desired.
For the modelling of norms, we have been focussing on the sentences that
represent an obligation, duty or right. For those sentences, the method seems
adequate. However, for other types of sentences, such as delegation, we have
not come to an acceptable approach yet. Dealing with these sentences will
require first of all that we recognise them. Currently, our classifier
distinguishes only between obligation/prohibition and right/permission. Several of
the patterns used clearly indicate delegations, but we have not yet established
whether these patterns cover all delegations in Dutch laws.</p>
      <p>A minor problem with regard to the parses made by Alpino is that most often,
the correct parse is not the one preferred by Alpino, but second, third or
fourth. If we make several suggestions (each suggestion based on a parse by
Alpino), this means that it will often not be the first suggestion that is correct,
which means more effort is needed by a human expert who is verifying the
models.</p>
      <p>We expect that by expanding the lexicon used by Alpino, and perhaps by
recalibrating the disambiguation on a written legal corpus, these problems
will disappear.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusion</title>
      <p>We have presented a next step towards a method and tools for supporting the
semi-automatic modelling of sources of law, necessary for an efficient,
effective, and more reliable and pragmatic use of knowledge technology in the
legal domain. We were already able to reliably detect structure in sources of
law, find and resolve references in and between them, and classify individual
sentences. Now we are able to suggest formal model fragments for certain
types of the classifications. Though we are convinced that these model
fragments will be a useful in supporting human experts creating models, we do
feel that the approach is still too general. A more elaborate method is needed
to create appropriate model fragments for different subtypes of sentences.
Some method to avoid too granular models is desirable as well.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Biagioli</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Francesconi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passerini</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montemagni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Soria</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2005</year>
          ),
          <article-title>Automatic semantics extraction in law documents</article-title>
          ,
          <source>in “Proceedings of the Tenth International Conference on Artificial Intelligence and Law (ICAIL '05)”</source>
          , ACM, New York, pp.
          <fpage>133</fpage>
          -
          <lpage>140</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Bos</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steedman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Curran</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hockenmaier</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2004</year>
          ),
          <article-title>Wide-Coverage Semantic Representations from a CCG Parser</article-title>
          ,
          <source>in 'Proceedings of the 20th international conference on Computational Linguistics”</source>
          , pp.
          <fpage>1240</fpage>
          -
          <lpage>1246</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bouma</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noord</surname>
          </string-name>
          , G. van, and
          <string-name>
            <surname>Malouf</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2001</year>
          ),
          <article-title>Alpino: Wide Coverage Computational Analysis of Dutch</article-title>
          , in Daelemans, W.,
          <string-name>
            <surname>Sima</surname>
            'an,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veenstra</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Zavrel</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          . (Eds.), “
          <article-title>Computational Linguistics in the Netherlands CLIN 2000</article-title>
          .
          <article-title>Selected Papers from the Eleventh CLIN Meeting</article-title>
          .”, Rodopi, Amsterdam, pp.
          <fpage>45</fpage>
          -
          <lpage>59</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Kralingen</surname>
          </string-name>
          , R. W. van (
          <year>1995</year>
          ),
          <article-title>Frame-based Conceptual Models of Statute Law</article-title>
          ,
          <source>PhD thesis</source>
          , Kluwer Law International, The Hague.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Maat</surname>
            , E. de, Winkels,
            <given-names>R.</given-names>
          </string-name>
          and Engers, T. van (
          <year>2006</year>
          ),
          <source>Automated Detection of Reference Structures in Law</source>
          , in Engers, T.M. van (Ed.),
          <source>“Legal Knowledge and Information Systems. Jurix</source>
          <year>2006</year>
          :
          <article-title>The Nineteenth Annual Conference”</article-title>
          , IOS Press, Amsterdam, pp.
          <fpage>41</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Maat</surname>
            , E. de and Winkels,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2008</year>
          ),
          <article-title>Automatic Classification of Sentences in Dutch Laws</article-title>
          , in
          <string-name>
            <surname>Francesconi</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Sartor</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Tiscornia</surname>
          </string-name>
          , D. (Eds.),
          <source>“Legal Knowledge and Information Systems. Jurix</source>
          <year>2008</year>
          :
          <article-title>The Twenty-First Annual Conference”</article-title>
          , IOS Press, Amsterdam, pp.
          <fpage>207</fpage>
          -
          <lpage>216</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>McCarty</surname>
            ,
            <given-names>L.T.</given-names>
          </string-name>
          (
          <year>2007</year>
          ),
          <article-title>Deep semantic interpretations of legal texts</article-title>
          ,
          <source>in “Proceedings of the 11th International Conference on Artificial Intelligence and Law”</source>
          , ACM Press, New York, pp.
          <fpage>217</fpage>
          -
          <lpage>224</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Sarwar</given-names>
            <surname>Bajwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Samad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            and
            <surname>Mumtaz</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          (
          <year>2009</year>
          ),
          <article-title>Object Oriented Software Modeling Using NLP Based Knowledge Extraction</article-title>
          ,
          <source>European Journal of Scientific Research</source>
          , Vol.
          <volume>35</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>22</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>