<!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>Enhancing Semantic Annotation through Coreference Chaining: An Ontology-based Approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Till Christopher Lech CognIT as</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oslo till.christopher.lech@cognit.no</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Koenraad de Smedt University of Bergen</institution>
        </aff>
      </contrib-group>
      <fpage>131</fpage>
      <lpage>136</lpage>
      <abstract>
        <p>Semantic annotation of natural language text requires a certain degree of understanding of the document in question. Especially the resolution of unclear reference is a major challenge when detecting relevant information units in a document. The ongoing KunDoc project examines how domain specific ontologies can support the task of Coreference chaining in order to enhance applications such as automatic annotation, information extraction or automatic summarization. In this paper, we present a robust methodology for acquisition of semantic contexts that does not depend on a thorough syntactic parsing as necessary tools often are unavailable for “smaller” languages. Based on a shallow corpus-analysis, verb-subject relations constitute the framework for the extraction of semantic contexts. Our approach either adds the semantic contexts to concepts and instances in an existing ontology or builds up the domain knowledge necessary for coreference chaining from scratch.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Automatic semantic annotation of natural language text such as web documents
requires a certain degree of text understanding. An important task in order to
constitute a coherent semantic representation of a document is the resolution of
anaphoric expressions and coreference chains. In the current NLP landscape there are
numerous approaches for anaphora resolution based on either heuristics, such as
        <xref ref-type="bibr" rid="ref6">(Mitkov 1998)</xref>
        and (Stuckardt 2000), or statistics, such as
        <xref ref-type="bibr" rid="ref8">(Soon, Ng et al. 2001)</xref>
        or
        <xref ref-type="bibr" rid="ref3 ref7">(Ng and Cardie 2003)</xref>
        . Only few efforts have been made so far to explore background
knowledge stored in ontologies in order to resolve unclear reference. The aim of the
ongoing KunDoc Project1 is to examine how ontologies can be acquired, enhanced
and reused for detecting coreference chains in natural language text. In this paper, we
will describe a methodology for learning and use of domain specific ontologies in
order to support the coreference chaining task. We present a ontology-based
methodology for use of semantic contexts for coreference chaining, followed the
acquisition of these semantic contexts that can either be added to existing ontologies
or constitute a starting point for ontology engineering, based on verb-subject relations
extracted from a domain-specific text corpus.
      </p>
      <sec id="sec-1-1">
        <title>1 http://kundoc.net</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>The KunDoc Methodology</title>
      <p>Most of the heuristics-based methods for Coreference chaining rely mainly on
morpho-syntactic features such as number and gender agreement, syntactic function,
topicalisation etc. Only few efforts have been made – besides the knowledge-based
methods in the early days of AI, such as frames or scripts – in order to utilize
semantic cues in order to resolve anaphoric expressions. In the KunDoc project, these
semantic cues are retrieved from domain-specific ontologies. The semantic features
used in KunDoc consist of:
• Class/subclass relations according to the taxonomy used (e.g. person, organization,
etc.)
• Verbs or adjectives with which the concept in question frequently co-occurs</p>
      <p>
        As a methodological framework for extraction of possible referents and their
antecedents we used the CORPORUM system
        <xref ref-type="bibr" rid="ref3 ref7">(Engels and Lech 2003)</xref>
        , a toolkit for
semantic analysis of natural language text, which extracts the most relevant concepts
and proper nouns as well as associations between these concepts from text.
      </p>
      <p>During the text analysis, possible antecedents are collected and stored in a
candidate list. These candidates are enriched with their semantic features that are
retrieved from the ontology using the JENA2 interface. As soon potential anaphoric
expressions are encountered (definite noun phrases or pronouns), their features are
matched with the candidates in order to find the correct antecedent, as shown in
Figure 1. Whereas class/subclass relations are inherent in existing taxonomies, the
semantic contexts for coreference chaining may have to be added. The following
section presents a methodology for generating these contexts.</p>
      <sec id="sec-2-1">
        <title>2 http://jena.sourceforge.net/</title>
        <sec id="sec-2-1-1">
          <title>Enhancing Semantic Annotation through Coreference Chaining: An Ontology-based</title>
          <p>Approach 3</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Acquisition of Semantic Contexts</title>
      <p>
        The idea of deriving semantic classes from noun phrase/verb co-occurrences is not
new in itself. Most of the work in this area is based on the distributional hypothesis,
i.e. that nouns are similar to the extent that they share context. We assume that certain
actions – denoted by verbs – are typically performed by a semantically restricted set
of entities. Notable work in this area has been done by both Hindle
        <xref ref-type="bibr" rid="ref5">(Hindle 1990)</xref>
        , as
well as by Nédellec and Faure
        <xref ref-type="bibr" rid="ref4">(Faure and Nédellec 1998)</xref>
        Starting point for Hindle's
approach is the pointwise mutual information of verb-object and verb-subject
cooccurrences. In order to calculate a weighting for each verb-subject pair, Hindle (1)
derives a score from the observed frequencies of verb-subject co-occurrences,
where f(n v) is the frequency of a noun n occurring as subject of verb v, and N is
the total of all verb-subject pairs in the data set.
      </p>
      <p>The extraction of explicit Predicate-Argument Structures requires somewhat
accurate parses of the sentences in the corpus, which can be problematic, due to the
availability of the necessary tools for various languages. Especially for the “smaller”
languages, such as Norwegian, this is a well known obstacle for the development of
tools for information extraction or annotation. As an alternative – and more robust –
approach, a shallow parsing of the text was chosen by using the Oslo-Bergen Tagger
(OBT), a PoS-Tagger developed within a cooperation between the Universities of
Oslo and Bergen, Norway. The OBT consists of a morphologic tagger and a
CGbased module for disambiguation of tags. The CG component gives all found options
that cannot be excluded. This gives a fair recall, but low precision. As the analysis of
the data set will show, some of these mistakes will be filtered out as noise, whereas
others may obscure the results.</p>
      <p>The data set was extracted from a corpus of newspaper articles about a murder case
in the village of Førde, Norway. All 94 texts were published in the Norwegian online
newspaper VG Nett (www.vg.no), yielding a total of 1619 subject-verb structures. In
order to provide a basic benchmark for semantic classification all subjects were
grouped manually into 6 conceptual classes:
• politi (police)
• offer (victim)
• etterforskning (investigation)
• spor (trace)
• pårørende (relatives)
• gjerningsmann (perpetrator)</p>
      <p>
        We assume that subjects in most cases denote the agent of the action described by
the respective verbs. Therefore, in our first experiments, a co-occurrence score is
calculated for subject-verb pairs only. An alternative approach to Hindle’s similarity
measure – also based on the distributional hypothesis – is presented in
        <xref ref-type="bibr" rid="ref1">(Cimiano,
Staab et al. 2003)</xref>
        . Inspired by this work, we test the cosine similarity. In our approach
we compute the cosine similarity of the the co-occurrence weighting Csubj (v, n) of the
VSS, computed as mentioned above through the mutual information:
      </p>
      <p>SIM =</p>
      <p>(∑v∈A(n1 )∩ A(n2 )Csubj (v n1 )* Csubj (v n2 ))
∑v∈A(n1 )Csubj (v n1 )2 * ∑v∈A(n1 )Csubj (v n2 )
2
where for each subject n, A is the set of verbs v that share a subject-verb structures
with n. The results for the concept “police” are depicted in Table 1.</p>
      <p>politi
politi
politi
politi
politi
politi
politi
politi
politi
politi
politi
politi
politi (police)
etterforsker (detective)
lensmann (seargeant)
Politiet (police, definite form)
Broberg (person name)
tekniker (technician)
VG (name of newspaper)
mannskap (squad)
Fonn (person name)
vitne (witness)
Borlaug (person name)
Naustdal (person name)</p>
      <p>This approach seems promising as there is only little noise in the ten most similar
subjects, such as VG. In addition to the semantic classification of the concepts in the
corpus, based on the co-occurrence measure between verbs and subjects, we are able
to establish probable semantic contexts that can be added to concepts and instances in
the ontology as depicted in Table 2 for the three top terms in the “police” cluster:
etterforsker
lensmann
Broberg
fatte
overse
etterforske
utdype
avtale
erfare
antyde
fastholde
oppfordre
bekrefte
Table 2. Semantic contexts for concepts in the “police” cluster.</p>
      <sec id="sec-3-1">
        <title>Enhancing Semantic Annotation through Coreference Chaining: An Ontology-based</title>
        <p>Approach 5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Coreference Chaining</title>
      <p>
        As
        <xref ref-type="bibr" rid="ref2">(Eiken 2005)</xref>
        has shown, the choice between possible antecedents can be
positively influenced by exploiting the similarity between the semantic context of a
pronoun and its antecedent in terms of predicate-argument relations. For example, in
(3) it is correctly predicted that the most likely antecedent for the pronoun hun is vitne
(witness). Even without any further information, this is derived entirely from
cooccurrence relationships in the corpus.
      </p>
      <p>(3)</p>
      <p>Hun skal ha hørt rop.</p>
      <p>(She is supposed to have heard cries.)</p>
      <p>This analysis was extended by Eiken by a clustering of concepts, which implies
that concepts no longer need to be matched perfectly, but the coreferent must be part
of a concept group. In (4), for example the pronoun hun (she) is first linked to the
concept kvinne (woman), which is not among the candidates. However, the correct
concept Slåtten, which is among the candidates is clustered together with kvinne and
can therefore be selected.</p>
      <p>(4)</p>
      <p>Hun ble funnet omkommet.</p>
      <p>(She was found dead.)</p>
      <p>In this way, a certain fuzziness of the matching is achieved, which enhances the
possibility of finding coreferents in a set of candidates. In the KunDoc project this
analysis is again extended by using the relations in the extracted ontologies.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Further Work</title>
      <p>We have presented a method for the enhancement of information extraction and
semantic annotation through Coreference chaining. We have shown how a shallow
and robust analysis of a domain specific text corpus yields Verb-Subject-Structures
that can be exploited in order to extend domain-specific ontologies by adding
semantic contexts to the concepts and instances in the taxonomy. The robustness of
the proposed methodology is constituted by the fact that it does not require tools for
extensive parsing of natural language, but only a part-of-speech tagger and rather
simple statistical models. This will also ensure an easy transfer to other languages.</p>
      <p>The next steps in the KunDoc project will be a thorough evaluation of precision
and recall of the resolution of anaphoric expressions and an evaluation on how this
improves the quality of information extraction. Future work in the KunDoc project
will look into the feasibility of the methodology for other knowledge domains and
text genres.</p>
      <p>Stuckardt, R. (2000). Robust Anaphor Resolution: Design and Evaluation of the ROSANA
System. 1st workshop on RObust Methods in Analysis of Natural language Data. Lausanne.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Cimiano</surname>
            , P.,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Staab</surname>
          </string-name>
          , et al. (
          <year>2003</year>
          ).
          <article-title>Deriving Concept Hierarchies from Text by Smooth Formal Concept Analysis</article-title>
          .
          <source>GI Workshop "</source>
          Lehren - Lernen
          <string-name>
            <surname>- Wissen - Adaptivität</surname>
          </string-name>
          <article-title>" (LLWA)</article-title>
          . Karlsruhe, Germany.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Eiken</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>Corpus-based Semantic Categorisation for Anaphora Resolution</article-title>
          . Bergen, University of Bergen. M.A. Thesis.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Engels</surname>
            ,
            <given-names>R. H. P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>T. C. Lech</surname>
          </string-name>
          (
          <year>2003</year>
          ).
          <article-title>Generating Ontologies for the Semantic Web: OntoBuilder. Towards the Semantic Web</article-title>
          . J.
          <string-name>
            <surname>Davies</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Fensel</surname>
            and
            <given-names>F. v.</given-names>
          </string-name>
          <string-name>
            <surname>Harmelen</surname>
          </string-name>
          . The Atrium, Chichester, John Wiley &amp; Sons, Ltd:
          <fpage>91</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Faure</surname>
            , D. and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Nédellec</surname>
          </string-name>
          (
          <year>1998</year>
          ).
          <article-title>A Corpus-based Conceptual Clustering Method for Verb Frames and Ontology Acquisition</article-title>
          .
          <article-title>LREC workshop on Adapting lexical and corpus resources to sublanguages and applications</article-title>
          . Granada, Spain.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Hindle</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>1990</year>
          ).
          <article-title>Noun classification from predicate-argument structure. 28th annual meeting of the Association for Computational Linguistics</article-title>
          . Pittsburg, Pa.:
          <fpage>268</fpage>
          -
          <lpage>275</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Mitkov</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>1998</year>
          ).
          <article-title>Robust Pronoun Resolution with Limited Knowledge</article-title>
          .
          <source>17th International Conference on Computational Linguistics (COLING'98/ACL'98)</source>
          . Montreal, Canada:
          <fpage>969</fpage>
          -
          <lpage>875</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Ng</surname>
            , V. and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Cardie</surname>
          </string-name>
          (
          <year>2003</year>
          ).
          <source>Bootstrapping Coreference Classifiers with Multiple Machine Learning Algorithms. 2003 Conference on Empirical Methods in Natural Language Processing (EMNLP).</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Soon</surname>
            ,
            <given-names>W. M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>H. T.</given-names>
            <surname>Ng</surname>
          </string-name>
          , et al. (
          <year>2001</year>
          ).
          <article-title>"A Machine Learning Approach to Coreference Resolution of Noun Phrases."</article-title>
          <source>Computational Linguistics</source>
          (
          <volume>27</volume>
          ):
          <fpage>285</fpage>
          -
          <lpage>291</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>