<!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>RealTextlex: A Lexicalization Framework for Linked Open Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rivindu Perera</string-name>
          <email>rperera@aut.ac.nz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Parma Nand</string-name>
          <email>pnand@aut.ac.nz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gisela Klette</string-name>
          <email>gklette@aut.ac.nz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer and Mathematical Sciences, Auckland University of Technology</institution>
          ,
          <country country="NZ">New Zealand</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Linked Open Data (LOD) is growing rapidly as a source of structured knowledge used in a variety of text processing applications. However, the applications using the LOD need to be able to mediate between the front end user interfaces and LOD. This often requires a natural language interpretation of this structured, linked data. We demonstrate a middle-tier framework that can generate patterns which can be used to transform LOD triples back into natural text. The framework utilizes preprocessed free text to extract a wide range of relations which are then aligned with triples to identify possible lexicalization patterns. These lexicalization patterns can then be used to transform a given triple into natural language sentence.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The goal of the demonstration will be to show the whole of the RealTextlex
work ow from the extraction and preprocessing of unstructured text to the
generation of lexicalization patterns. The demonstration will utilize a Java client
application built on top of the RealTextlex framework. In essence, the
demonstration will focus on how the lexicalization patterns can be extracted from the
unstructured text and the techniques of utilizing extracted patterns to transform
a given Linked Data triple into natural text.
For the purpose of this demonstration we focus on triples belonging to ve
randomly selected DBpedia ontology classes; Bridge, Actor, Publisher, River,
and Radio Host. These ve classes o er 132 unique predicates which can be
lexicalized. A detailed description on the datasets used to evaluate the framework
can be found in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Candidate sentence extraction The input to the candidate sentence
extraction module is an ontology class represented in DBpedia (e.g., Bridge). This
module attempts to select a random set of DBpedia RDF les (e.g.,
Brooklyn Bridge.rdf) which belong to the given ontology class and extracts triples
from the selected Resource Description Framework (RDF) les.
      </p>
      <p>In the next phase, the module extract text related to the selected DBpedia
RDF le (e.g., Wikipedia page for Brooklyn Bridge). The main source of free
RealTextlex: A Lexicalization Framework
text extraction are the Wikipedia pages for selected DBpedia RDF le. However,
Wikipedia on its own is not su cient to create a rich enough natural language
representation of RDF triples. In order to enrich the possible patterns, a web
search module (based on Bing API2) was integrated to extract more text snippets
related to the RDF le from websites. The extracted text was cleaned using the
shallow text feature based boilerplate removal algorithm3 and the co-references
were resolved using the Stanford CoreNLP.</p>
      <p>The resulting sentence collection from above step was analysed to determine
the candidate sentences that have RDF triple elements corresponding to subject,
predicate, and object. The candidate sentences were then assigned to triples with
a score proportional level of presence of the individual triple elements.
Relation extraction and alignment In the next step we extracted the
relations (arg1$ rel $ arg2) from the generated candidate sentences from the
previous step. For this we employed the self-supervised Open Information
Extraction (Open IE) module4 which enables us to identify a large number of
relations and to associate them with triples. Our hypothesis is that a relation
can be aligned with a triple structure to identify potential lexicalization of the
triple under consideration. We aligned each relation with the triple and assigned
a score based on the level of alignment. The aligned relations were then
processed to extract the patterns which were used to lexicalize the triple as natural
text.</p>
      <p>Ensemble pattern processing and combination In this phase, we rst
transformed the aligned relations to patterns by substituting subject and
objects literal values with generic expressions (e.g., h arg1: Brooklyn Bridge, rel: is
designed by, arg2: John Roebling i) s? is designed by o? ). The success of Open
IE based pattern extraction is based on the availability of the textual
representation of the required triple. Therefore, we consider alternatives to generating
patterns which work with the main module. For this we utilized the verb frames
from lexical semantic resources, mainly from WordNet and VerbNet. The pattern
processing module generates patterns that can be extracted from relations
followed by the attempt to lookup the predicate in the verb frame database5. If the
module is able to nd a pattern of NP$VP$NP structure for the given verb,
then a predetermined pattern of [subject]$VP$[object] is created. A
predetermined set of properties of entities (e.g., eye colour, hair colour) are lexicalized
with a pre-processed set of patterns.</p>
      <p>Pattern enrichment and persistence Some features of triples can result in
patterns that cannot be generalized to other triples with the same predicate. We</p>
      <sec id="sec-1-1">
        <title>2 http://www.bing.com/toolbox/bingsearchapi</title>
        <p>
          3 https://code.google.com/p/boilerpipe/
4 http://knowitall.github.io/ollie/
5 An embedded database which contains verb frames from WordNet and VerbNet.
have identi ed three such features in our investigations; grammatical gender,
ne ontology class, and object multiplicity. A detailed explanation of how these
features a ect patterns to be in a di erent form is given in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The generated
patterns are stored in a SQLite database and version 1.3 of this database can be
found on the project web site6.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Recent frameworks like Lemon[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and LOD-DEF[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] have also studied the
lexicalization problem with a particular focus on Linked Data. However, these systems
lack three main concepts which were presented in this paper; the use of rich
textual sources for pattern extraction (including boilerplate removal and
coreference resolution), the cohesive pattern generation, and the investigation of
encoded features. For instance, the concept recently proposed in Lemon is based
on dependency paths to nd the pattern which will eventually raise the need for
a large syntactic rule set. Furthermore, we have brought up the need for
identifying features (for more information see [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]) before coming up with frameworks
to generate patterns.
4
      </p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and future work</title>
      <p>
        The approach for LOD lexicalization presented in this paper o ers new insights
into generating lexicalization patterns for Linked Open Data cloud by applying
Open IE on automatically collected and processed free text. The lexicalization
module described here is part of a parent Natural Language Generation project
[
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ] currently underway at Auckland University of Technology. In future, we
expect to expand our framework by analysing the missing features that can a ect
the lexicalization patterns and to improve the text extraction and processing
module to support extracting a large number of accurate lexicalization patterns.
      </p>
      <sec id="sec-3-1">
        <title>6 http://rivinduperera.com/information/realtextlex.html</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Perera</surname>
          </string-name>
          , R.: Scholar:
          <article-title>Cognitive Computing Approach for Question Answering</article-title>
          .
          <source>Honours thesis</source>
          , University of Westminster (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Perera</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nand</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>A multi-strategy approach for lexicalizing linked open data</article-title>
          .
          <source>In: CICLing-2015</source>
          . (
          <year>2015</year>
          )
          <volume>348</volume>
          {
          <fpage>363</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Walter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Unger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>A corpus-based approach for the induction of ontology lexica</article-title>
          .
          <source>In: NLDB-2013</source>
          . (
          <year>2013</year>
          )
          <volume>102</volume>
          {
          <fpage>113</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Duma</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
          </string-name>
          , E.:
          <article-title>Generating natural language from linked data: Unsupervised template extraction</article-title>
          .
          <source>In: IWCS-2013</source>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Perera</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nand</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Real text-cs - corpus based domain independent content selection model</article-title>
          .
          <source>In: ICTAI-2014</source>
          . (
          <year>2014</year>
          )
          <volume>599</volume>
          {
          <fpage>606</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Perera</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nand</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>The role of linked data in content selection</article-title>
          .
          <source>In: PRICAI-2014</source>
          . (
          <year>2014</year>
          )
          <volume>573</volume>
          {
          <fpage>586</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>