<!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>Discovering and Querying Hybrid Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zareen Syed</string-name>
          <email>zsyed@umbc.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tim Finin</string-name>
          <email>finin@cs.umbc.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Muhammad Rahman</string-name>
          <email>mrahman1@umbc.edu</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>James Kukla</string-name>
          <email>jkukla@redshred.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jeehye Yun</string-name>
          <email>jyun@redshred.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>RedShred 5520</institution>
          <addr-line>Research Park Drive, Suite 100 Baltimore, MD 21228</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Maryland</institution>
          <addr-line>Baltimore County 1000 Hilltop Circle, MD, USA 21250</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we present a unified framework for discovering and querying hybrid linked data. We describe our approach to developing a natural language query interface for a hybrid knowledge base Wikitology, and present that as a case study for accessing hybrid information sources with structured and unstructured data through natural language queries. We evaluate our system on a publicly available dataset and demonstrate improvements over a baseline system. We describe limitations of our approach and also discuss cases where our system can complement other structured data querying systems by retrieving additional answers not available in structured sources.</p>
      </abstract>
      <kwd-group>
        <kwd>knowledge discovery</kwd>
        <kwd>semantic web</kwd>
        <kwd>text mining</kwd>
        <kwd>information retrieval</kwd>
        <kwd>question answering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        There are numerous benefits of extracting structured data from raw text in the form of
attribute value pairs aka slots and fillers, it gives the ability to go beyond keyword
queries and perform structured queries, such as, get a list of “equipment”, “software” or
“devices” mentioned in the document or in the corpus as a whole. Furthermore, linking
extracted slots and fillers to the knowledge base can greatly increase the recall of such
queries by supporting transitivity and other types of inference. For example, a “Digital
Camera” is a type of “Camera” which is a type of “Device” in DBpedia Ontology [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
In addition, a clear taxonomy and aligned attributes enable faceted browsing, which is
a powerful and popular way to select articles of interest and also explore corpus
statistics. The extracted slots and fillers can serve to provide interesting and informative
structured summaries over the raw content of text documents thus helping the reader to
quickly decide if the document is of interest. Structured data extracted from text can
provide useful semantic features for a variety of tasks such as indexing, clustering,
retrieval, and summarization to name a few.
      </p>
      <p>
        One of the biggest challenges faced by the Semantic Web vision is the availability
of structured data that can be published as RDF. One approach is to develop techniques
to translate information in spreadsheets, databases, XML documents and other
traditional data formats into RDF [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Another is to refine the technology needed to extract
structured information from unstructured free text [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. Once linked data becomes
available, a second challenge arises in being able to easily query large linked data
collections such as DBpedia. Using the SPARQL query language requires not only
mastering its syntax but also understanding the RDF data model, large ontology
vocabularies and URIs for denoting entities. Over the past few years natural language interfaces
are becoming popular as they permit users to express queries in natural language
without needing to know about the underlying schema or query syntax. Recently, numerous
approaches have been developed to address this challenge [
        <xref ref-type="bibr" rid="ref14 ref7">7, 14, 25, 26</xref>
        ], showing
significant advances towards answering natural language questions with respect to large
and heterogeneous structured data sources. However, a lot of information is still
available only in textual form, both on the web and in the form of labels and abstracts in
linked data sources. Therefore approaches are needed that can not only deal with
structured data but also with finding information in several sources, processing both
structured and unstructured information, and combining such gathered information into one
answer.
      </p>
      <p>
        In this paper, we present exploratory work on a unified framework for discovering
as well as querying linked hybrid data collections. The proposed unified framework
builds on our previous work on discovering ontology elements from text documents
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and our new work on developing a natural language interface for a hybrid
knowledge base Wikitology [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], which we present as a case study for accessing hybrid
information sources through natural language queries.
      </p>
      <p>One motivation for our work is an enhancement to a system we are developing with
RedShred, LLC that will help people identify and analyze business documents that
include Request for Proposals (RFPs), Request for Quotes (RFQs), calls for proposals,
Broad Agency Announcements (BAAs), solicitations and similar business documents.
Our prototype uses document analysis, information retrieval, NLP information
extraction and question answering techniques and is largely domain independent. It
understands general RFP-related concepts (e.g., proposal deadlines, duration, deliverables,
security requirements, points of contacts, etc.) and can extract and organize information
to help someone quickly evaluate opportunities. However, it does not have built-in
knowledge of any particular domain, such as software development or material science,
and is thus unable to address potentially critical characteristics involving them. For
software, for example, we may need to know if the work requires a particular
programming language (e.g., Java), is targeted for a given system or architecture (e.g., iOS), or
has special requirements (e.g., 3DES encryption). Given the breadth and variety of
domains of interest, manually developing and maintaining custom ontologies, language
models and systems for each is not viable. We plan to build on the results of this work
to be able to automatically extend a base ontology by identifying and incorporating
important domain-specific concepts, relations and axioms.</p>
      <p>We see several contributions that this work has to offer:
1. We present a natural language interface over hybrid linked data and present
Wikitology Hybrid Knowledge Base as a case study.
2. We discuss examples where the hybrid system retrieves correct results that are not
available in the structured source.
3. We describe a unified architecture for discovery and querying of linked data.
In the remainder of the paper, we introduce the Wikitology knowledge base and present
a novel natural language query system over the hybrid knowledge base. We perform
the evaluation of our system over a publicly available dataset and discuss the results
and limitations of our approach and mention related work. Finally, we present a unified
framework for discovering and querying linked hybrid data and provide some
conclusions and future work directions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Wikitology</title>
      <p>
        Wikitology [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] is a hybrid knowledge base of structured and unstructured information
extracted from Wikipedia augmented by RDF data from DBpedia [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], YAGO Ontology
[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], WordNet [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and Freebase [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Wikitology is not unique in using Wikipedia to
form the backbone of a knowledge base, see [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and [23] for examples, however, it is
unique in incorporating and integrating structured, semi-structured and unstructured
information accessible through a single query interface. The query interface supports a
variety of queries ranging from simple keyword queries to queries with structural
constraints and returns ranked results based on relevance. Wikitology has been tested for a
variety of use-cases [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and has proven to be effective in generating useful features
for a variety of tasks.
      </p>
      <p>
        At the core of Wikitology is an information retrieval (IR) index which is enhanced
with fields containing instance data taken from other data structures such as graphs,
tables or triples. It also stores references to related instances in native data structures
for applications that might need to run data-structure specific algorithms. The
specialized IR index enables applications to query the knowledge base using either simple free
text queries or complex queries over multiple fields in the index with structural
constraints. The current version of Wikitology has 13 fields, the details on the contents of
the fields are available in [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Natural Language Queries over Wikitology</title>
      <p>Our natural language question answering system consists of a number of modules,
namely, Answer Type Extraction, Property versus Type identification, Named Entity
and Concept Linking, and Wikitology Query Formulation. We describe these modules
below.
3.1</p>
      <sec id="sec-3-1">
        <title>Answer Type Extraction</title>
        <p>
          For answer type extraction we extract noun chunks from question text using OpenNLP
[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. We generate inflected forms of extracted nouns and map them types to DBpedia
classes based on exact match. For example, we match “songs” in question text with
“song” DBpedia class. In case we don’t find a matching class in DBpedia, we match
with WordNet nouns. If we don’t find a matching WordNet noun and the noun chunk
is composed of multiple words, we remove the first word and try to match with
WordNet to match a more generic type, for example, “music albums” is reduced to “albums”.
We repeat the process until we are left with just one word. If we still don’t find a match,
we do not detect an answer type and leave the answer type empty when querying
Wikitology. In case we detect more than one types, we use the first type. This might not
always work for example for queries with conjunctions such as “Which commercial
companies and academic universities have collaborated before?” there are more than
one types mentioned which are equally important. We currently limit our system to
handle simple cases and plan to address complex cases in our future work. For the
selected type we further test if it is a property using a heuristic defined in the next section.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Property vs. Type Identification</title>
        <p>
          In DBpedia, nouns can denote properties or classes. For example, there is a property
for “album” and a class for “song” in DBpedia. We use a simple heuristic to
differentiate properties from classes i.e. if the noun is followed by the preposition “of” we
consider it a property, otherwise a class. We observed that this simple heuristic worked
well for several cases in QALD training dataset [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. We plan to add more heuristics to
cover other cases in the future.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Named Entity and Concept Linking</title>
        <p>
          We use entity linking approach [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] based on Wikitology to link any named entities to
concepts in Wikitology. We further enhanced Wikitology’s entity linking system with
gazetteers of named entities. For linking other concepts we used Wikipedia Miner
service [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Wikipedia Miner also links named entities, however when we tested with few
examples we found Wikitology’s named entity linking relatively more accurate and
therefore we used Wikitology for named entity linking and Wikipedia Miner for linking
other types of concepts. For Wikipedia Miner we used a probability threshold of 0.4.
We tested with a lower threshold to improve recall but observed decrease in accuracy.
For example, for the question “Which river does the Brooklyn Bridge cross?”, the
service predicted a link for “cross” to “http://en.wikipedia.org/wiki/Cross” which was not
relevant. A threshold of 0.4 worked much better.
For questions that ask about a property of a named entity such as “Who is the husband
of Amanda Palmer?”, we extract the property using the Property Identification heuristic
mentioned earlier. For the linked entity we fetch all properties related to the entity from
DBpedia. We rank the fetched properties based on semantic similarity with the
extracted property using the Semantic Similarity measure in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. For example, for the
question “Who is the creator of Wikipedia?”, we were able to match “creator” with
“author”. For these types of questions we do not send a query to Wikitology.
3.5
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>Wikitology Query Formulation</title>
        <p>We briefly describe the Wikitology fields that we used for question answering and the
query formation below:
a) wikiTitle: The ‘wikiTitle’ field contains the Wikipedia title for a given
Wikipedia page.
b) contents: The ‘contents’ field contains the full text of the Wikipedia article
including categories, infobox properties, links as well as any redirects to the
Wikipedia article.
c) types: The ‘types’ field contains structured data in RDF from the YAGO
ontology and the DBPedia Infobox Ontology. The structured data was encoded
in an RDFa-like format in the types field for the Wikipedia page. This enables
one to query the Wikitology knowledge base using both text (e.g., an entity
document) and structured constraints (e.g., rdfs:type =YAGO:President).
Freebase resource contained a more comprehensive list of Named Entities
(Persons, Locations and Organizations) as compared to YAGO and DBpedia
ontology, we therefore generated a list of Wikipedia articles on Persons,
Locations and Organizations by extracting all Wikipedia articles defined under
the corresponding types in the Freebase resource. We also added the DBpedia</p>
        <sec id="sec-3-4-1">
          <title>Input: topN</title>
        </sec>
        <sec id="sec-3-4-2">
          <title>Output: Query =</title>
          <p>question text, answer type, links 1.. N,</p>
        </sec>
        <sec id="sec-3-4-3">
          <title>Top N concepts</title>
          <p>types: (answer type) OR
linkedConcepts: (link1, link2 .. linkN) OR
contents: (link1, link2 .. linkN) OR
contents: (question text)
List topNConcepts = Wikitology.searchQuery(Query,
topN)</p>
        </sec>
        <sec id="sec-3-4-4">
          <title>Return topNConcepts</title>
          <p>
            WordNet Mappings 5 that are manually created for about 400,000 Wikipedia
articles. As Wikipedia has more than 2 million articles we used the Wikipedia
Categories to WordNet mappings [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] to heuristically assign a WordNet type
to any remaining Wikipedia articles [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ].
d) linkedConcepts: This field lists the out-links of Wikipedia pages. This field
can be used to retrieve linked concepts and also to impose structural
constraints while querying (e.g., linkedConcepts = Michelle_Obama,
linkedConcepts = Chicago).
          </p>
          <p>Based on the analysis of the question text, we map different query components to
different fields in Wikitology index. We create a specialized query to Wikitology by
mapping answer type to types field, extracted links to linkedConcepts field as well as
contents field, and question text to contents field as seen Table 1.
3.6</p>
        </sec>
      </sec>
      <sec id="sec-3-5">
        <title>Evaluation</title>
        <p>
          For evaluating our system, we used the English questions from the QALD-4 dataset
[
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. We restricted to only those questions which had an answer type of “resource” i.e.
a URI is provided, and had “aggregation” as false which deals with counting, filtering
or ordering, as our system does not currently support these types of queries. We also
removed any questions with comparatives and superlatives and which returned Boolean
answers i.e. True or False. The total number of questions we considered was 112. We
created a baseline system for comparison. The baseline system queried the question text
against only the “contents” field in Wikitology. Some questions in QALD dataset have
a list of answers. We consider our answer to be correct if any of the top N retrieved
concepts are present in the given answers list. We tested both the baseline and the
hybrid system using N = 1 and N = 10. The results are shown in Table 2. The simple
search system retrieved one of the correct answers as a top answer in only 5 cases
whereas, the Wikitology Query was able to retrieve one of the correct answers as a top
answer for 29 queries. Considering top 10 retrieved results, the simple search system
retrieved one of the correct answers for 30 questions versus 46 questions by the
Wikitology Query.
3.7
        </p>
      </sec>
      <sec id="sec-3-6">
        <title>Discussion</title>
        <p>
          We experimented with a Wikitology version that was built from Wikipedia dump of
March 2010. The QALD-4 dataset uses a more recent version of DBpedia. Using
Wikitology constructed from a more recent dump may help in improving recall. We
manually looked into answers returned by our system for few queries and found a few cases
where the returned concept was correct but was not present in the results of the
translated DBpedia SPARQL query in QALD-4 dataset. For example, for the question
“Which professional surfers were born in Australia?”, our system retrieved the top
concept “Layne_Beachley” which is a correct answer, however it is not available as an
answer in QALD dataset and hence was not marked as correct in evaluation. Another
example is for the question “Which ships were called after Benjamin Franklin?”, the
system retrieved “French_ship_Franklin_(1797)”, which is a correct answer but was
not present in QALD answers since those answers are based on DBpedia dataset only.
These examples show that a hybrid question answering system that uses linked data as
well as text can help in improving recall and complement other natural language query
systems that retrieve answers from structured sources only. We also observed that some
error was introduced due to linking with a wrong entity, for example, for the query “List
all games by GMT.”, “GMT” was linked to “Greenwich_Mean_Time” instead of
“GMT_Games”. In addition to that we came across a number of cases in QALD dataset
which required multi-hop path queries. Since our system does not currently support
path queries it did not perform well on these types of questions. Another source of error
was questions with conjunctions, for example, “Give me all people that were born in
Vienna and died in Berlin”. Our system does not handle conjunctions yet and hence
missed this query. We have employed a basic analysis of the input question, we can
improve the approach by exploiting a dependency parse and extracting grammatical
relations.
Question Answering systems can be categorized into three different types. 1)
Textbased QA systems [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] which first retrieve a relevant set of documents and then extract
the answers from these documents. 2) Collaboration-based QA systems [24] exploit
answers from the similar questions which have been answered by users on collaborative
QA platforms, such as Quora and Yahoo! Answer. 3) Structured data-based QA
systems find answers by searching the database instead of the corpus, where the natural
language questions are usually translated into some structural queries, such as SQL or
SPARQL [
          <xref ref-type="bibr" rid="ref14 ref21 ref4 ref5">4, 5, 14, 21</xref>
          ]. Recently the QALD-4 [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] task introduced a hybrid question
answering track, in which given a natural language question or keywords, the system is
required to retrieve the correct answer(s) from a given repository containing both RDF
data and free text. This track was introduced last year, however there was just one
submission which was later withdrawn. We find our system in line with the new hybrid
question answering track.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Unified Framework for Discovering and Querying</title>
      <p>We have already discussed our system for natural language querying over hybrid linked
data. In this section we describe our earlier work on discovering slots and fillers and
how both systems can be integrated to provide a unified framework for discovering and
querying semantic data from a given corpus. The unified framework will take as input
a corpus of text documents and discover slots and fillers by linking keywords to
concepts in the knowledge base using a slot filler discovery approach described below. The
discovered slots and fillers will be added to the knowledge base along with the article
text. The natural language query interface discussed earlier will provide support for
querying over discovered slots and fillers along with associated document text using a
hybrid Wikitology query.
4.1</p>
      <sec id="sec-4-1">
        <title>Discovering Slots and Fillers</title>
        <p>
          The approach for discovering slots and fillers is based on the observation that linked
concepts can serve as candidate fillers and the “types” associated with linked concepts
can serve as candidate slot labels. For example, the Wikipedia article on “Microsoft”
links to “Windows”, “Office”, “Skype” etc. All three of these are a type of “Software”
in DBpedia Ontology. By exploiting the types associated with fillers (linked concepts)
we can discover a slot for “Software” and provide answers to a structured query such
as retrieve list of softwares by Microsoft. The same slot can also serve as a useful facet
and enable users to select all articles that are related to “software”. The slots and fillers
can serve as informative structured summaries like info-boxes in Wikipedia. This
approach can be extended to non-Wikipedia articles by first linking keywords and entities
to concepts in Wikitology and using the type information in Wikitology to predict a slot
label. Not all candidate slots and fillers discovered using the links might be meaningful
and will need further selection. Based on the observation that slots are related to entity
type and entities of the same type share slots, the documents can be clustered and the
top ‘n’ most frequent slots can be selected for each cluster whereas, rare slots can be
discarded. For more information please see our detailed paper on this approach and its
performance [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we presented exploratory work on a unified framework for discovering
as well as querying linked hybrid data collections. We described our approach to
developing a natural language interface for a hybrid knowledge base Wikitology, which
we presented as a case study for accessing hybrid information sources through natural
language queries. We evaluated our system on a publicly available dataset and
demonstrated improvements over a baseline system. We described limitations of our system
and also presented examples where our system was able to retrieve additional answers
that were not available in structured sources and may complement existing natural
language querying systems that retrieve answers from structured sources only. Our current
system performs a basic analysis of the input question and therefore can handle limited
types of queries, we plan to improve the approach by exploiting a dependency parse
and extracting grammatical relations. In addition to that we plan to support path queries
by translating natural language queries to SPARQL queries.
6
23. Wu, F. and Weld, D. S.: Automatically Refining the Wikipedia Infobox Ontology. In Proc.</p>
      <p>of the 17th International Conference on World Wide Web, ACM, (2008) 635-644
24. Wu, Y., Hori, C., Kawai, H., and Kashioka, H.: Answering Complex Questions via
Exploiting Social Q&amp;A Collection. In: IJCNLP (2011) 956–964
25. Xu, K., Feng, Y., and Zhao, D.: Xser@ QALD-4: Answering Natural Language Questions
via Phrasal Semantic Parsing. QALD-4 (2014)
26. Song, D., Schilder, F., Smiley, C. and Brew, C.: Natural Language Question Answering and
Analytics for Diverse and Interlinked Datasets. The 2015 Conference of the North American
Chapter of the Association for Computational Linguistics – Human Language Technologies.
NAACL HLT 2015 (2015)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baldridge</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The OpenNLP Project</article-title>
          . URL: http://Opennlp. Apache.Org/Index.html,
          <source>(Accessed March</source>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>The Emerging Web of Linked Data</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          <volume>24</volume>
          (
          <issue>5</issue>
          ) (
          <year>2009</year>
          )
          <fpage>87</fpage>
          -
          <lpage>92</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bollacker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Evans</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paritosh</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sturge</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , J.:
          <article-title>Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge</article-title>
          .
          <source>In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data</source>
          , ACM (
          <year>2008</year>
          )
          <fpage>1247</fpage>
          -
          <lpage>1250</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dima</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Answering Natural Language Questions With Intui3</article-title>
          .
          <article-title>Conference and Labs of the Evaluation Forum (CLEF) (</article-title>
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Schema-Free Structured Querying of Dbpedia Data</article-title>
          .
          <source>In Proceedings of the 21st ACM International Conference on Information and Knowledge Management</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2012</year>
          )
          <fpage>2090</fpage>
          -
          <lpage>2093</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McNamee</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joshi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Yesha</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          , IEEE Computer Society, (
          <year>2013</year>
          )
          <fpage>1307</fpage>
          -
          <lpage>1322</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            and
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.:</surname>
          </string-name>
          <article-title>CASIA@ V2: A MLN-Based Question Answering System Over Linked Data</article-title>
          .
          <source>In: Proc. of QALD-4</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ji</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dang</surname>
            ,
            <given-names>H. T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nothman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hachey</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Overview of TAC-KBP 2014 Entity Discovery and Linking Tasks</article-title>
          .
          <source>In Proc. of TAC-2014</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>McNamee</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Dang</surname>
          </string-name>
          , H.:
          <article-title>Overview of the TAC 2009 Knowledge Base Population Track</article-title>
          .
          <source>In: Proc. of TAC-2009</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Milne</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I. H.</given-names>
          </string-name>
          :
          <article-title>Learning to Link with Wikipedia</article-title>
          .
          <source>In: Proc. of the 17th ACM Conference on Information and Knowledge Management</source>
          (
          <year>2008</year>
          )
          <fpage>509</fpage>
          -
          <lpage>518</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>G. A.</given-names>
          </string-name>
          :
          <article-title>Wordnet: A Lexical Database For English</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>38</volume>
          , No.
          <volume>11</volume>
          (
          <year>1995</year>
          )
          <fpage>39</fpage>
          -
          <lpage>41</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Etzioni</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kautz</surname>
          </string-name>
          , H.:
          <article-title>Towards a Theory of Natural Language Interfaces to Databases</article-title>
          .
          <source>In: Proc. of the 8th International Conference on Intelligent User Interfaces</source>
          ,
          <source>ACM</source>
          (
          <year>2003</year>
          )
          <fpage>149</fpage>
          -
          <lpage>157</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ponzetto</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Strube</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>WikiTaxonomy: A Large Scale Knowledge Resource</article-title>
          .
          <source>In: Proc. of ECAI</source>
          <year>2008</year>
          , Amsterdam, The Netherlands, IOS Press.
          <article-title>(</article-title>
          <year>2008</year>
          )
          <fpage>751</fpage>
          -
          <lpage>752</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shim</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>G. G.</given-names>
          </string-name>
          :
          <article-title>ISOFT at QALD-4: Semantic Similarity-Based Question Answering System Over Linked Data</article-title>
          .
          <source>In Proc. of CLEF-2014</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ravichandran</surname>
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hovy</surname>
          </string-name>
          , E.:
          <article-title>Learning Surface Text Patterns for a Question Answering System</article-title>
          .
          <source>In: Proc. of The 40th Annual Meeting On Association For Computational Linguistics</source>
          , ACL'
          <volume>02</volume>
          (
          <year>2002</year>
          )
          <fpage>41</fpage>
          -
          <lpage>47</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kasneci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>Yago: A Core of Semantic Knowledge</article-title>
          .
          <source>In: Proc. of the 16th International Conference on World Wide Web</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , (
          <year>2007</year>
          )
          <fpage>697</fpage>
          -
          <lpage>706</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kasneci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G. :
          <article-title>Yago: A Large Ontology from Wikipedia and Wordnet</article-title>
          .
          <source>Web Semant</source>
          .
          <volume>6</volume>
          (
          <issue>3</issue>
          ) (
          <year>2008</year>
          )
          <fpage>203</fpage>
          -
          <lpage>217</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Syed</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Techniques for Discovering Ontology Elements from Wikipedia Article Links</article-title>
          .
          <source>In: Proc. of the NAACL HLT 2010</source>
          First International Workshop on Formalisms and
          <article-title>Methodology for Learning by Reading</article-title>
          . Association for Computational Linguistics (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Syed</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Wikitology: A Novel Hybrid Knowledge Base Derived From Wikipedia</article-title>
          . Dissertation, University Of Maryland (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Syed</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Creating and Exploiting a Hybrid Knowledge Base for Linked Data</article-title>
          .
          <source>In Agents and Artificial Intelligence, Revised Selected Papers Series: Communications in Computer and Information Science, V129</source>
          , Springer, April (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Unger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bühmann</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngomo</surname>
            ,
            <given-names>N. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gerber</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Template-Based Question Answering Over RDF Data. In</surname>
            <given-names>WWW</given-names>
          </string-name>
          , (
          <year>2012</year>
          )
          <fpage>639</fpage>
          -
          <lpage>648</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Unger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forascu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngomo</surname>
            ,
            <given-names>N. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabrio</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Walter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Question Answering Over Linked Data (QALD-4)</article-title>
          .
          <source>In Working Notes for CLEF 2014 Conference</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>