<!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>CLaC Labs Processing Modality and Negation Working Notes for QA4MRE Pilot Task at CLEF 2012</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sabine Rosenberg</string-name>
          <email>ro@cse.concordia.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Halil Kilicoglu</string-name>
          <email>kilico@cse.concordia.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sabine Bergler</string-name>
          <email>bergler@cse.concordia.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CLaC Lab, Concordia University 1455 de Maisonneuve Blvd West</institution>
          ,
          <addr-line>Montreal, QC</addr-line>
          ,
          <country country="CA">Canada</country>
          ,
          <addr-line>H3W 2B3 sabin</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>For the QA4MRE 2012 Pilot Task on Negation and Modality, CLaC Labs implemented a general, lightweight negation and modality module based on linguistic rules. The strong results con rm the suitability of linguistic heuristics for low-level semantic features and showcase their robustness across the di erent subgenres of the QA4MRE corpora.</p>
      </abstract>
      <kwd-group>
        <kwd>shallow semantics</kwd>
        <kwd>negation</kwd>
        <kwd>modality</kwd>
        <kwd>factuality</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Processing negation and modality is very relevant for tasks like question
anwsering because extracted information that falls within the scope of a negation
cue (not, no, never, ...) cannot be presented as asserted information. Similarily,
information falling within the scope of a modal cue (could, should, would,...)
cannot be presented as factual or certain. Negation and modality have been
addressed as independent tasks themselves, rather than as components of other
tasks in recent shared tasks and workshops such as detection of negation and
hedging at CoNLL [3], BioNLP [6], the Negation and Speculation in NLP
Workshop [9] and the *Sem 2012 Shared Task on Processing the Scope and Focus of
Negation [10]. The availability of data sets such as the BioScope Corpus [13],
and the FactBank Corpus [12] have allowed for further progress on modality and
negation research. The QA4MRE Pilot Task: Processing Modality and Negation
at CLEF 2012 builds upon these recent e orts.</p>
      <p>
        The Pilot task has 3 main requirements: The rst one being to detect whether
any elements of a text are negated. Within the context of this task, negation
is de ned as a grammatical device which is used to determine if an event or
situation has not taken place. Consider Example (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), where the event come is
negated, and one could now infer that half of Europe's electricity comes from
other than fossil fuels.
      </p>
      <p>
        (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Half of Europe's electricity does not come from fossil fuels.
      </p>
      <p>
        The second requirement is to detect whether any parts of the text are modalised.
For this task: if an event or situation is determined to not be certain nor
factual then it is modalised. In Example (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), the event come is considered to be
modalised due to the auxiliary might which renders the event to be uncertain
it is neither true nor false that half of Europe's electricity comes from fossil fuels
- but possibly it does.
      </p>
      <p>
        (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Half of Europe's electricity might come from fossil fuels.
      </p>
      <p>
        The third requirement of the task is the most complex: to determine, whether
and how the two cases might interact. Example (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) demonstrates that the event
come is modalised as in Example (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), however it is also negated as in
Example (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ). The interpretation of this sentence is completely di erent due to both
negation and modality a ecting the event come - it is not a certain fact that half
of Europe's electricity comes from other than fossil fuels - but it possibly does.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) Half of Europe's electricity might not come from fossil fuels.
      </p>
      <p>The pilot task is framed as an annotation task where each document in the
data set is pre-annotated for events. An event is de ned as any of the main
verbs mentioned within the text. The events are extracted automatically with
the Stanford POS Tagger (v. 3.0, 2010-05-10) [8]. The goal of the task is to then
determine whether an event present in the text is within the scope of a negation,
in the scope of a modal or within the scope of both.</p>
      <p>We present a linguistically inspired general Negation and Modality detection
system that identi es negation and modality triggers, and in a second step
determines their scope from dependency graphs. In the nal step, the only one
speci c to the pilot task, we determine whether any mentioned event within the
text is within the detected scopes of negation, modality or within the
intersection of both. Consequently, the output of the system is a list of all the events,
each one with a speci c label - the possible labels are NEG: the event is found
to be negated only, MOD: the event is found to be modalised only, NEGMOD:
the event is found to be both negated and modalised, or NONE: the event is
found neither to be negated nor modalised.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Data Set</title>
      <p>The test data set for the pilot task is composed of 8 English documents part of
the larger test set for the main QA4MRE Task. It is divided into 4 topics: AIDS,
Climate Change, Music and Society, and Alzheimer's Disease. Two documents
were taken from each topic. Each test document has at least 100 events (on
average) to which the relevent label should be assigned. The training set consisted
of one document from the Economist. It contained 96 events. 46 of the events
in the training example were labeled as MOD, 49 were labeled as NONE, 1 was
labeled as NEG and 0 were labeled as NEGMOD. The guidelines for the pilot
task [8] also contained some extra example sentences for each possible label
which proved helpful in developing our system. We also utilized the background
collection data available for the QA4MRE task in order to develop our heuristics.</p>
    </sec>
    <sec id="sec-3">
      <title>Our Approach</title>
      <p>For the pilot task, CLaC Labs implemented a general lightweight Negation and
Modality module. The heuristics-based system is composed of three modules for
the GATE [1] environment: the rst component detects and annotates negation
and modality cues present in the corpus, the second component detects and
annotates the syntactic scope of the detected instances of negation and modality.
We initally developed these rst two components for speci cally detecting and
annotating instances of negation within text. This base system NEGATOR was
developed independently drawing on data from MPQA [14] and TIMEBANK[11]
with validation on Bio-Scope [13], and the *SEM 2012 Task [10] on detecting
the focus of Negation. We extended NEGATOR for the requirements of the
Pilot task to include the functionality for also detecting instances of modality
within text. The third component was speci cally developed for the pilot task
and is intended to validate the rst two, now extended components and for the
determination of which of the annotated events are within the detected scopes
of negation, modality or within the intersection of both.
3.1</p>
      <sec id="sec-3-1">
        <title>Data Preprocessing</title>
        <p>Parser-based, our modality and negation detection pipeline requires as input
entire sentences. The system then performs standard preprocessing using prebuilt
GATE modules [1]: sentence splitting, tokenization, parsing using the Stanford
Parser [7, 2], morphological preprocessing, and VP chunking. In the nal
preprocessing step, the system extracts the pre-annotated events from the text already
present in the supplied corpus for the task in order for them to be available in
the nal step of the pipeline.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Detection of Negation and Modality Triggers</title>
        <p>The rst component in the CLaC System identi es and annotates any negation
or modality triggers present in the text. For the detection of negation triggers
we used 3 di erent xml formatted gazetteer lists. Each list contains entries for
a speci c negation type: Implicit, Explicit and A xal. The Explicit trigger list
includes not, never, no, don't, can't, ... The Implicit trigger list includes deny,
prevent, fail, reject, ... A xal triggers includes disagree, unimportant, impossible,
incoherence, ... Both the A xal and Implicit gazetteer lists are seeded from the
subjective word list from MPQA, complemented with words annotated in MPQA
[14] and nominalization/verbal form variants. For the detection of modality
triggers we used a comprehensive modality dictionary developed and compiled for
[5]. From the possible modals we chose the following categories according to
the task guidelines [8]: Assumptive, Conditional, Deductive, Epistemic, Hedge,
Intentional, Speculative, Obligative, Modal, Potential, and Volitive.</p>
        <p>Two additional modality trigger classes are (the trigger is underlined):
1. if the main verb is non nite then this verb is considered to be a modal
trigger: ... that accompany Alzheimer's memory loss ...
2. if the main verb is in the present particle tense then this verb is considered
to be a modal trigger: Finding evidence of Chlamydia...
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Syntactic Scope Detection of Negation and Modality</title>
        <p>
          The second component in the CLaC System identi es the syntactic scope for
an annotated negation or modal trigger present in a sentence within the text.
The method for detecting the syntactic scope in both cases is inspired by
heuristics de ned in [4], utilizing the parser-derived collapsed dependency graphs [2].
The heuristics specify the dependency relations which identify either a negation
or modality scope. Examples (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) and (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) from the test dataset show how the
resulting scope annotations (in angle brackets) are determined.
        </p>
        <p>
          In Example (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) the CLaC System will rst detect and annotate never as an
Explicit Negation Trigger. The CLaC component for identifying the syntactic
scope will then trigger the heuristic for the neg dependency relation as the
Explicit Negation Trigger never is a member of an instance of this relation.
The resulting syntactic scope is determined to be the VP headed by the verb
happened. The verb happened is consequently also marked as an event, therefore
the resulting label for this event will be NEG since happened is found by the
system to be within the scope of a negation.
        </p>
        <p>
          (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) Sentence: The cut never happened.
        </p>
        <p>Explicit Negation Trigger: never
Dependency Relation: neg(governor: happened, dependent: never)
Negation Syntactic Scope: The cut never hhappenedi.</p>
        <p>System Labeled Event: happened : LABEL =NEG</p>
        <p>
          The same process occurs in Example (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ): The system will rst detect and
annotate can as a Modality Trigger. It will then trigger the heuristic for the aux
dependency relation as the Modality Trigger can is a member of an instance of
this relation. The scope is the VP headed by the verb change. The verb change
is also marked as an event, therefore the resulting label for this event will be
MOD since changed is found by the system to be within the scope of a modal.
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) Sentence: But it is hardly evidence that hip-hop can change the world.
        </p>
        <p>Modality Trigger: can
Dependency Relation: aux(governor: change, dependent: can)
Modality Syntactic Scope: But it is hardly evidence that hip-hop can
hchange the worldi.</p>
        <p>System Labeled Event: change : LABEL =MOD</p>
        <p>There are two trigger classes that do not use the dependency relations to
determine the syntactic scope, but rather the constituent parse tree, because it
more accurately re ects the extent of the scope:
1. Modal verbal triggers not marked by a dependent relation already (the
syntactic scope is the VP complement: accompany Alzheimer's memory loss
2. not only, not just, are exception cases and the scope of the explicit negation
trigger is limited to: (only, just).
3.4</p>
      </sec>
      <sec id="sec-3-4">
        <title>Determination of Events: Modalised, Negated or both</title>
        <p>The nal component implemented for the pilot task iterates through all the
pre-annotated events within the text and will output the following labels:
1. NEG: if the event is determined to be negated
2. MOD: if the event is determined to be modalised
3. NEGMOD: if the event is determined to be both modalised and negated
4. NONE: if the event is neither negated nor modalised
For this task we submitted two di erent runs. The only di erence between the
two is how the nal component of the system determines the label for the event.
In the 1st run known as the "Narrow" run one mainly considers the direct
members of the dependency relation that triggered a relevent scope annotation.
In contrast, the 2nd run, known as the "Greedy" run, the entire scope annotation
in which an event is contained within is considered.</p>
        <p>Run 1: Narrow
1. The event is determined to be NEG only if it is contained within a negation
scope annotation, and is a direct member in the dependency relation with the
negation trigger as shown in Example 6. If the event is not a direct member,
but the event is contained within a negation scope annotation, and has the
in nitive form to be, and is the dependent in a copula dependency relation
and the governor of the copula dependency relation is a direct member in
the dependency relation with the negation trigger: then this event will also
be given the NEG label.</p>
        <p>
          (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) Sentence: The mutation means that Du y receptor proteins are not
made in red cells .
        </p>
        <p>Negation Trigger: not
Dependency Relation: neg (governor:made, dependent: not)
Negation Scope: The mutation means that Du y receptor proteins
are not hmade in red cellsi.</p>
        <p>System Labeled Event: made : LABEL =NEG
2. The event is determined to be MOD only if it is contained within a modal
scope annotation, and is a direct member in the dependency relation with
the modal trigger. If the event is not a direct member, but the event is
embedded in certain structural constructions, the event will also be given
the MOD label as seen in Example 7.</p>
        <p>
          (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ) Sentence: Sometimes the absence of something can be as telling as
its presence .
        </p>
        <p>Modal Trigger: can</p>
        <p>Dependency Relation: aux (governor: telling, dependent: can)</p>
        <p>Dependency Relation: cop (governor: telling, dependent: be)
Modal Scope: Sometimes the absence of something can hbe as telling
as its presencei .</p>
        <p>System Labeled Event: be : LABEL =MOD
3. The event is determined to be NEGMOD only if it has been allocated both
the preliminary MOD and NEG labels as shown in Example 8.</p>
        <p>
          (
          <xref ref-type="bibr" rid="ref8">8</xref>
          ) Sentence: So you can't simply look at temperature changes over the
20th century ...
        </p>
        <p>Modal Trigger: can
Dependency Relation: aux(governor: look, dependent: ca)
Preliminary System Labeled Event: look : LABEL =MOD
Modal Scope: So you ca hn't simply look at temperature changes over
the 20th centuryi ...</p>
        <p>Negation Trigger: n't
Dependency Relation: neg (governor: look, dependent: n't)
Negation Scope: So you ca n't hsimply look at temperature changes
over the 20th centuryi ...</p>
        <p>Preliminary System Labeled Event II: look : LABEL =NEG</p>
        <p>Final System Labeled Event: look : LABEL =NEGMOD
4. If none of the above is true then the event is labeled as NONE.</p>
      </sec>
      <sec id="sec-3-5">
        <title>Run 2: Greedy</title>
        <p>
          1. The event is determined to be NEG if it is contained within a negation scope
annotation as shown in Example 9.
it wowuld be better if the same example could showcase narrow
and greedy scope to highlight the di erence
(
          <xref ref-type="bibr" rid="ref9">9</xref>
          ) Sentence: Nor is it as widespread in Africa
        </p>
        <p>Negation Trigger: Nor
Dependency Relation: dep (governor: widespread, dependent: Nor)
Negation Scope: Nor his it as widespread in Africai</p>
        <p>System Labeled Event: is : LABEL =NEG
2. The event is determined to be MOD if it is contained within a modal scope
annotation as shown in Example 10. If the scope was determined not by a
dependency relation but by a structural trigger, then this event is labeled
MOD.</p>
        <p>
          (
          <xref ref-type="bibr" rid="ref10">10</xref>
          ) Sentence: If matter and antimatter were truly symmetrical...
        </p>
        <p>Modal Trigger: If
Dependency Relation: mark (governor: symmetrical, dependent:
if)
Modal Scope: If hmatter and antimatter were truly symmetricali...</p>
        <p>
          System Labeled Event: were : LABEL =MOD
3. The event is determined to be NEGMOD only if it has been allocated both
the preliminary MOD and NEG labels as shown in Example 11.
(
          <xref ref-type="bibr" rid="ref11">11</xref>
          ) Sentence: This would probably not be a person you would take very
seriously
Modal Trigger: would (2nd one)
Dependency Relation: aux(governor: take, dependent: would)
Modal Scope: This would probably not be a person you would htake
very seriouslyi .
        </p>
        <p>Preliminary System Labeled Event: take : LABEL =MOD
Negation Trigger: not
Dependency Relation: neg (governor: person, dependent: not)
Negation Scope: This would probably not hbe a person you would
take very seriouslyi.</p>
        <p>Preliminary System Labeled Event II: take : LABEL =NEG</p>
        <p>Final System Labeled Event: take : LABEL =NEGMOD
4. If none of the above is true then the event is labeled as NONE.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Global Results</title>
      <p>Two methods are used for calculating the performance of a system based on the
precision and recall measures: the Macroaverage and the Microaverage.</p>
      <p>The Microaverage F-Score will be the harmonic mean of the Microaverage
precision and recall. In contrast, the Macroaverage method will calculate the
Precision by simply taking the average of the Precision values calculated
individually for each category. Similarily to calculate the Recall, it will take the
average of the Recall values. The Macroaverage F-Score will be the harmonic
mean of the Macroaverage precision and recall, shown in Table 1.</p>
      <p>Macroaveraged F-measure(beta=1.0):
Microaveraged F-measure(beta=1.0):
Overall Accuracy:</p>
      <p>Narrow Greedy
0.6368 0.6196
0.7117 0.6750
0.7130 0.6688</p>
      <p>We observe that the Macroaveraged measure is balanced across both runs
with 64% for the Narrow run and 62% for the Greedy run. The Narrow run had
better overall performance. The method for allocating the labels in the Narrow
run was not overly generous in the MOD/NEG/NEGMOD labeling of the events.
Consequently, we observe in Table 2 the Narrow run performs better in detecting
the NONE label correctly for an event. The detection of the NEGMOD label
for an event is the worst performer for both runs. This is possibly due to the
manner in which the NEGMOD label is allocated: the correct determination
of an event being labeled NEGMOD is reliant on it having been previously
correctly allocated the NEG label and the MOD label. Any errors that occur
in the allocation of the NEG or MOD label to an event will propogate through</p>
      <p>Narrow Run</p>
      <p>TP FP TN FN Precision Recall F-Measure(beta =1.0)
MOD 315 158 612 159 0.6660 0.6646 0.6653
NEG 36 10 1170 28 0.7826 0.5625 0.6545
NEGMOD 18 19 1184 23 0.4865 0.4390 0.4615
NONE 518 170 409 147 0.7529 0.7789 0.7657</p>
      <p>Greedy Run</p>
      <p>TP FP TN FN Precision Recall F-Measure(beta =1.0)
MOD 357 252 518 117 0.5862 0.7532 0.6593
NEG 36 8 1172 28 0.8182 0.5625 0.6667
NEGMOD 28 55 1148 13 0.3373 0.6829 0.4516
NONE 411 97 482 254 0.8091 0.6180 0.7008
to the NEGMOD labeling task. In both runs the F-Measures for both the NEG
and MOD labels are fairly stable: 65%-66%.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Error Analysis</title>
      <p>This section reviews the results of each run from a more ne grained analysis than
the previous section. Here, we investigate how each document in the provided
data set performs, and identify the major sources of errors. We approach the
analysis of the results at two di erent levels of granularity.</p>
      <p>The averaged performance of the Narrow and Greedy run for each document
in the data set is depicted in Figures 1 and 2.</p>
      <p>The macroaveraged scores range between 50%- 80% for the Narrow run and
50%- 76% for the Greedy run. Given the very small size but very varied nature
of the test corpus, it is of interest to us to analyse where a particular document
falls within the given range. The worst performing document overall is the aids 2
document for both runs: 50.11% for the Narrow run and 49.24% for the Greedy
run. The best performing document in the Narrow run is Music &amp; Soc 1 with
79.55% and Alzheimers 2 second with 76.66%. In contrast, the best performer
in the Greedy run is Alzheimers 1 with 75.95% and Music &amp; Soc 1 second with
71.54% .</p>
      <p>The Figures 3 &amp; 4 depicts a further level of granularity on the results for
each document in the data set.</p>
      <p>
        Upon inspection of these gures we see that in both runs the aids 2 does
poorly in detecting the NEGMOD label. There is only one event in this document
that should have the NEGMOD label allocated; and in both runs the system
fails. In both runs as observed in Example 12, the event is labeled as MOD but
the system does not detect a negation trigger and therefore the event is not
allocated the NEG label:
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        ) Sentence: That is two years when a man ignorant of his infection would
be less likely to take precautions to stop it spreading.
      </p>
      <p>ModalTrigger: take
Modal Scope: That is two years when a man ignorant of his infection
would be less likely to take hprecautions to stop it spreadingi.</p>
      <p>System Labeled Event: take : LABEL =MOD</p>
      <p>Gold Labeled Event: take : LABEL =NEGMOD</p>
      <p>
        The aids 2 document is not the worst performer in either run for detection
of the MOD label. In both runs the worst performer when detecting the MOD
label is the aids 1 document. This poor performance is due in the majority of
cases to a mislabeling of the MOD label: the system labels them MOD and the
Gold Standard allocates the NONE label. This mislabeling is relatively frequent
and we illustrate it with a few examples:
1. The CLaC system detects a modal trigger that the Gold Standard does not:
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        ) Sentence: The fact that some matter was left over shows they are not
, in fact , symmetrical.
      </p>
      <p>ModalTrigger: fact
Modal Scope: The fact hthat some matter was left overi shows they
are not , in fact , symmetrical.</p>
      <p>System Labeled Event: left : LABEL =MOD</p>
      <p>
        Gold Labeled Event: left : LABEL =NONE
2. The Gold Standard considers the event to not be a ected by the modal
context, but the Greedy Run does:
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        ) Sentence: A tiny genetic change may help explain why AIDS is so
common in Africa.
      </p>
      <p>ModalTrigger: may
Modal Scope: A tiny genetic change may hhelp explain why AIDS
is so common in Africai .</p>
      <p>System Labeled Event: explain : LABEL =MOD</p>
      <p>Gold Labeled Event: explain : LABEL =NONE
3. The ClaC System wrongly allocates a term to be a modal trigger - the term
may be a modal trigger but in a di erent context:
(15) Sentence: Dr Gallo had initially suggested that AIDS was caused by
HTLV-I , a virus that no one disputes he discovered.</p>
      <p>ModalTrigger: had
Modal Scope: Dr Gallo had hinitially suggested that AIDS was caused
by HTLV-I, a virus that no one disputes he discovered.i
System Labeled Event: suggested : LABEL =MOD</p>
      <p>Gold Labeled Event: suggested : LABEL =NONE</p>
      <p>The worst performer of the NEG label for both the Narrow and Greedy run
is Music &amp; Soc 2. This is in part due to the small number of NEG events in
comparison to the other documents. The second worst performer of the NEG
label in the Narrow run is Alzheimers 1 and in the Greedy Run it is aids 1.
The Alzheimers 1 was quite a good NEG Performer in the Greedy Run (2nd
best). Of interest is that in the Alzheimers 1 document the Greedy run holds
the advantage. As seen in Example 16, the event in question is not directly
related to the negation trigger through the relevent dependency relation:
(16) Sentence: Nor does the apparent correlation with Alzheimer 's prove
anything.</p>
      <p>NegTrigger: Nor
Negation Scope: Nor hdoes the apparent correlation with Alzheimer's
prove anythingi.</p>
      <p>System Labeled Event: prove : LABEL =NEG</p>
      <p>Gold Labeled Event: prove : LABEL =NEG
Error cases illustrating NEG labeling errors from the aids 1 document:
1. The CLaC System erroneously allocates NEG and MOD labels:
(17) Sentence: Dr Gallo had initially suggested that AIDS was caused by
HTLV-I , a virus that no one disputes he discovered.</p>
      <p>ModalTrigger: suggested
Modal Scope: Dr Gallo had initially suggested hthat AIDS was caused
by HTLV-I, a virus that no one disputes he discoveredi.</p>
      <p>NegTrigger: no
Negation Scope: Dr Gallo had initially suggested that AIDS was
caused by HTLV-I, a virus that nohone disputes he discoveredi.</p>
      <p>System Labeled Event: disputes : LABEL =NEGMOD</p>
      <p>Gold Labeled Event: disputes : LABEL =NEG
2. The CLaC System does not recognise the Negation Scope:
(18) Sentence: What the committee did not do was name a third HIV
researcher, Robert Gallo, to share the glory and the SKr 10m ($1.4m).
NegTrigger: not
ModTrigger share
Negation Scope: What the committee did not hdo was name a third
HIV researcher,i Robert Gallo, to share the glory and the SKr 10m
($1.4m).</p>
      <p>System Labeled Event: share : LABEL =MOD</p>
      <p>Gold Labeled Event: share : LABEL =NEG
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>The QA4MRE Pilot Task on Negation and Modality has added crucial data to
the analysis not only of the two targeted linguistic phenomena, but indeed to
the study of interactions between modules in the light of increased complexity.</p>
      <p>CLaC Labs converted prototype systems to detect negation and modality
that were combined for this Shared Task. We attribute our strong results to the
careful linguistic analysis that went into the component systems. The Shared
Task con rmed our pretheoretic assumptions that for low-level semantic
features, linguistic rules will trump statistical methods for some time to come, since
the amount of coherently annotated data is not available for such approaches
to excel. We have also been able to show that these general (and very simple)
linguistic rules perform similar in the di erent subgenres of the QA4MRE
corpora, an encouraging result. The data set for the shared task is insu cient to
make any stronger claims, but we certainly feel encouraged to extend our
current approach to more interacting modules. The careful and explicit study of the
interactions will, in our opinion, shed light on complexity issues in general, well
beyond the task issues annotated.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Cunningham</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maynard</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bontcheva</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tablan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aswani</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gorrell</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Damljanovic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heitz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greenwood</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saggion</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Petrak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , W.:
          <article-title>Text Processing with GATE (Version 6)</article-title>
          .
          <source>GATE (April</source>
          <volume>15</volume>
          ,
          <year>2011</year>
          ) (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. de Marne e,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Generating typed dependency parses from phrase structure parses</article-title>
          .
          <source>In: LREC</source>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Farkas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vincze</surname>
            , V.,
            <given-names>G.</given-names>
            Mora, Csirik, J., G.
          </string-name>
          <article-title>Szarvas: The conll-2010 shared task: Learning to detect hedges and their scope in natural language text</article-title>
          .
          <source>In: Proceedings of the Fourteenth Conference on Computational Natural Language Learning</source>
          . (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kilicoglu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergler</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>E ective bio-event extraction using trigger words and syntactic dependencies</article-title>
          .
          <source>Computational Intelligence</source>
          <volume>27</volume>
          (
          <issue>4</issue>
          ) (
          <year>2011</year>
          )
          <volume>583</volume>
          {
          <fpage>609</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kilicoglu</surname>
            ,
            <given-names>H.H.</given-names>
          </string-name>
          :
          <article-title>Embedding Predications</article-title>
          .
          <source>PhD thesis</source>
          , Concordia University, Montreal, Quebec (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takagi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yonezawa</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Overview of genia event task in bionlp shared task 2011</article-title>
          .
          <source>In: Proceedings of BioNLP Shared</source>
          Task 2011 Workshop at ACL-HLT. (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Accurate unlexicalized parsing</article-title>
          .
          <source>In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics</source>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Morante</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daelemans</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Processing modality and negation. a pilot task of the qa4mre lab, CLEF 2012 Notebook papers (</article-title>
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Morante</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sporleder</surname>
          </string-name>
          , C., eds.:
          <source>NeSp-NLP '10: Proceedings of the Workshop on Negation and Speculation in Natural Language Processing</source>
          , Stroudsburg, PA, USA, Association for Computational Linguistics (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Morante</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blanco</surname>
          </string-name>
          , E.: *
          <article-title>SEM 2012 Shared Task: Resolving the Scope and Focus of Negation</article-title>
          .
          <source>In: Proceedings of the First Joint Conference on Lexical and Computational Semantics (*SEM</source>
          <year>2012</year>
          ), Montreal, Canada (
          <year>June 2012</year>
          )
          <volume>265</volume>
          {
          <fpage>274</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Pustejovsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanks</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sauri</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>See</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaizauskas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Setzer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Radev</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sundheim</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Day</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lazo</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The timebank corpus</article-title>
          .
          <source>In: Proceedings of Corpus Linguistics</source>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sauri</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pustejovsky</surname>
          </string-name>
          , J.:
          <article-title>Factbank: a corpus annotated with event factuality</article-title>
          .
          <source>Language Resources and Evaluation</source>
          <volume>43</volume>
          (
          <issue>3</issue>
          ) (
          <year>2009</year>
          )
          <volume>227</volume>
          {
          <fpage>268</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Vincze</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szarvas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farkas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mra</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Csirik</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The bioscope corpus: annotation for negation, uncertainty and their scope in biomedical texts</article-title>
          .
          <source>BMC Bioinformatics 9(Suppl</source>
          <volume>11</volume>
          )
          <article-title>:S9 (</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wiebe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Wilson,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Cardie</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>Annotating expressions of opinions and emotions in language</article-title>
          .
          <source>Language Resources and Evaluation</source>
          <volume>39</volume>
          (
          <issue>2-3</issue>
          ) (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>