<!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>What's the intention behind your query? A few observations from a large developer community</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alexander Löser</string-name>
          <email>alexander.loeser@sap.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wojciech M. Barczyn´ski</string-name>
          <email>wojciech.barczynski@sap.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Falk Brauer</string-name>
          <email>falk.brauer@sap.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>SAP AG SAP Research CEC Dresden Chemnitzer Str.</institution>
          <addr-line>48e 01187 Dresden</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We study common query intentions in a software developer network with more than one million users. Based on a large query log analysis we could identify typical search intentions and identify common entities. For resolving most frequent query intentions and to identify entities and relationships from relevant pages we recommend state-of-the-art information extraction technologies.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Corporate portals often are the dominant source of information for employees,
customers and other company affiliates. E.g., SAP’s software developer network (SDN) at
http://sdn.sap.com is SAP’s premier community site for SAP developers, experts and
software engineers. In such portals users have access to documents about products by
browsing a predefined static taxonomy of software systems, or may use a full text search
option, which is based on keywords. One current problem is a lack of precision for
keyword based search queries. Table 1 shows the top 10 queries for March 2007 for SDN.
Even though the correct result for all of the queries is available via the SDN portal,
none of the right results was mentioned in the first three answer pages (or 30 result
links) from the search engine. However, the ultimate goal of any search system is to
answer the intention behind the query [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Recent research on Intranet search
technology established that for transactional queries e.g., download requests for software [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ],
and navigational queries e.g., home page search [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], precise answers could be derived
using information extraction techniques.
      </p>
      <p>However, developers of search portals seldom have a clear understanding about
common queries and potential answer pages from sources of consumer generated
content. E.g., if a source mostly contains high quality information, how often the
information changes, what is the social process the content is created etc. Based on a detailed
query log analysis we study common query intention classes for navigational,
informational and transactional queries for a corporate portal. Our contribution is to
identify common intention classes and suggest extraction technologies for each class. We
believe that our analysis is general approach for corporate portals e.g., help.sap.com,
sap.ittoolbox.com or msdn.microsoft.com. To summarize:
– We give a detailed query log analysis including frequent and infrequent queries
over a period of four weeks in May 2007.
– We analyze quantitative characteristics and unravel the most popular user
intentions.
– For the four most common query intention classes we recommend state-of-the-art
information extraction techniques to obtain correct answers.</p>
      <p>
        This paper is organized as follows: in Section 2 we give a detailed analysis on query
logs. In Section 3 we unravel common user intentions. Section 4 concludes with related
work.
We use a sample from SDN query logs of May 2007, including 470:973 total number
of queries and 12:609 unique entries (Table 2). Unique queries have been identified
after a normalization process including trimming white spaces at the beginning and the
end, lowercasing query terms and excluding empty queries. After normalization, unique
12:608 queries remained. In total, they have been submitted 408:370 times (Table 3).
The distribution of queries is similar to logs from Internet search engines in the sense
that they both have a long-tail distribution for query frequency [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]: A very few queries
are very common, but most of the workload is on queries that individually occur very
rarely. To provide an accurate measure of user intention study, we created two subsets:
Q1 includes the top 200 most frequent queries (Table 4) and Q2 includes 200 queries
randomly chosen from the less frequent queries (Table 5). The probability for choosing
an infrequent query was counted from its frequency divided by the sum over all other
infrequent queries. Table 3, 4 and 5 introduce common query characteristics. We derive
the following observations:
– One keyword queries are highly common. 68% of the most common and 40 %
of the less common unique queries are one keyword queries.
– Optimizing for top one keyword queries boosts precision. Only by optimizing
the search engine to the top 137 one keyword queries, the search system could give
an exact answer to nearly one quarter of the search requests (cf. Table 4).
# terms # total [%] total # unique [%] unique
1 kw 111; 669 83 136 68
2 kw 20; 845 16 55 27
3 kw 1; 754 0:7 7 4
4 kw 0 0 0
&gt;4 kw 419 0:3 2 1
total 134; 687 200
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Most common user intentions</title>
      <p>
        Recent research [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] has shown the importance of understanding the query intention.
In this section we first define classes of query intentions. We analyse how often users
a request matches a particular intention class and map intention classes to common
extraction technology.
Table 1 shows a sample of the top 10 queries. Except for workflow, all are of the type
navigational queries.
      </p>
      <p>
        Motivated by this observation we manually investigated the top 200 queries and
less frequent 200 queries. Given a particular query, we determined the most relevant
answer for the query in a gold standard. For spotting the answer documents we used
the current SDN search engine as initial seed answers and conducted further browsing.
For most queries only one answer was found. However for few queries we also spotted
two or more answers. Following [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] we structured our query set into navigational,
informational and transactional queries. However, for the special case of a software
developer portal we redefined the following query classes:
Navigational queries. Navigational queries are directed towards navigating three
different classes of web pages:
– Product sites. Typical queries are [solution manager],[visual composer] with the
intention to navigate towards the product web page or visit this site again.
Sometimes also abbreviated product names are used, such as [XI] for [exchange
infrastructure].
– Sub sites. These queries intent to visit sites related to the structure of the portal.
      </p>
      <p>Example queries are [wiki], [blogs]. The intention of these queries is to navigate to
site directly using a search query instead of browsing the link structure.
– Developer notes. The portal publishes ’developer notes’ describing solutions to
specific problems. They are identified by a six to seven digit number. Such numbers
are infrequently used as search request e.g., [701654].</p>
      <p>Informational queries. One of the portals major goals is to support software
developers with advice and support for common and rare software problems. Another goal is
to form a community and to present SAP’s product portfolio. Both tasks, listing
products and resolving problems, are typical candidates for informational queries. From our
sample we could discover several types of informational queries:
– Closed queries using question words. Users submit these queries and intend to
find web pages for solving a specific problem. Common question words, such as
”how to” or ”what is” are used. E.g., an example query is [How to create an XSLT
mapping file].
– List queries. These queries intend to list common products given a technical
concept without explicitly mentioning (or even knowing) the name of a particular
product. E.g., the query [data mining] intents to list data mining products like SAP
Business Intelligence suite or SAP Accelerator.
– Advice queries. Typical advice queries request instructions for installing or
configuring software products, such as [solution manager configuration].
– Locate queries. Often customers ”copy &amp; paste” messages directly from an
applications or from code files. Query examples are (error) messages, such as [OBJECTS_OBJREF_
NOT_ ASSIGNED], code fragments, such as [MESSAGE_ TYPE_X] or request
information on configuration parameters, such as [login/create_sso2_ticket]. The
search goal of such queries is to locate technical documents or relevant forum
threads, where the query request is mentioned.</p>
      <p>Transactional queries. The portal supports typical transactions for software products,
e.g. users may download or upgrade software. In this study we could only count those
download requests where potential software was available for download. We assume
that more queries intent towards downloading software.</p>
      <p>Unclear queries. Unfortunately, not every query could be mapped to one intention
class. We mapped a query to the unclear query class, if at least one of the following
conditions was true:
– No clear intention. For queries like [jdbc], [performance] or [install] we could
not identify a clear intention.
– Ambiguous intentions. Some queries could be mapped to more than one intention
classes. E.g., the query [widget] could refer to a list query - informational; or a
product site (SAP widgets) - navigational.
3.2</p>
      <sec id="sec-2-1">
        <title>Query intention distribution</title>
        <p>
          Table 6 shows detailed information about common query intentions. In contrast to a
previous study [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], where navigational queries are the most dominating class among the
frequent queries, in this study navigational and informational queries are nearly equally
often issued. Furthermore, informational queries are the most often requested class of
infrequent queries. Transactional queries (at least for software products) appear quite
infrequently. One explanation might be that the portal provides many documents about
help and problem solving, but only few software downloads. We focus our analysis to
the following three most requested query classes:
1. Informational ”What is” and ”How to” queries. Users frequently use closed
queries to address a request. 215 queries refer to this most frequent query intention
class.
2. Navigational queries for products. 85 belong to navigational queries for product
home pages. We could confirm the findings of [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]; both, long and abbreviated
forms, are equally often used.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>3. Informational queries listing technical concepts. 60 queries are related to list</title>
        <p>further information for given technical concept. These queries are slightly more
issued among the frequent queries than among the infrequent queries.
Unfortunately, building portals based on intention recognition technology remains a
time and cost intensive project. First, common intentions need to be unraveled. Next,
possible answer sources need to be identified. Third, for each potential source of
answers, specific information extraction technologies need to be developed to relevant
catch entities and relationships from documents. Last, user intentions and content sources
change over time, thus the search engine not only needs to be adjusted but also extend
to new search intention and content sources. Today, there is no ’best practice’ on how to
best ramp up and maintain such search portals. In particular, we identified the following
shortcomings of the current search solution:
1. Poor entity and relationship recognition capabilities. Search results are a
presented as a list starting with the most relevant result. Search relevance is computed
using traditional TF/IDF ranking techniques, without recognizing entities and
relationships. However, the user expects that the search engine would recognize
relevant entities and its relations in search queries documents. Specifically, relevant
entities could be relationships between product entities and error message entities
or between incompatible products.
2. Monolithic search engine architecture. The current search architecture is based
on a monolithic approach (cf. Section 4). It includes different services, such as
preprocessing, indexing and searching. For understanding entities and relations this
”one size fits all” approach is costly to maintain and to extent.</p>
      </sec>
      <sec id="sec-2-3">
        <title>3. Insufficient distinction of source quality. Most of the search portals integrate dif</title>
        <p>ferent sources (or sites) which differ in quality, moderation and presentation of the
content. We distinguish between sub sites that are generated by the users e.g., wikis
or forums, and content provided by professional authors, such as the product home
pages. The current search engine does not distinguish between these sources, their
different content quality or content production process.</p>
        <p>
          To address these challenges we give some preliminary solutions on how to resolve
different query intentions. Given table 6 we focus on navigational and informational
queries. By applying state-of-the art technology in this section we suggest approaches
for resolving the intention for more than half of the queries in our sample of 400 queries.
Navigational queries. We focus on the following query intention classes representing
91 navigational out of 400 unique queries:
– Queries for product home pages and sub sites. We observed that web page
authors mark a page as navigational by using a discriminating term, e.g. (abbreviated)
products, error messages, or names for sub sites of the portal. Furthermore in wikis,
forum and the main portal these entities appear in the URL and the title of the page.
For resolving such entities named entity recognition (NER) technology (e.g. based
on simple list based entity extraction methods as defined in [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]) or more complex
rule based approaches as defined in the AVATAR project [
          <xref ref-type="bibr" rid="ref19 ref7">7, 19</xref>
          ] are common. Such
navigational queries are resolved by spotting and indexing navigational pages a
priori [
          <xref ref-type="bibr" rid="ref21 ref5">21, 5</xref>
          ]. For each spotted navigational page n-grams titles, URLs and anchors,
are extracted and stored in a separate index. A query is matched against the index
and the top results of the most relevant types are returned. If the query does not
match this special-case-index, results from the organic search engine are returned.
– Developer note queries. These queries aim to spot a particular document given a
unique identifier of the document. Our approach is to recognize first if a page is
a developer note, e.g., by spotting the terms developer note in the title and check
for following six digit number identifying the note. We extract the ID from the
document and match queries against an index of all recognized developer notes
IDs.
        </p>
        <p>Informational queries We focus on the following query intention classes representing
119 informational out of 400 unique queries:
– What is/How to queries. Purpose of asking What is queries is getting an
definition of a product or technology. From our gold standard (cf. section 3) we observed
that 19 What is queries often could be answered with a wiki document. 14 How
to queries are resolved with a forum page and 62 in the Wiki. E.g., for query [lo
extraction step by step] the answer can be found at thread title Lo extraction.
Because the forum and the Wiki are moderated we expect a higher quality and more
consistent structure on these pages.
– System messages queries. Queries of this type include error and system messages.</p>
        <p>To create a query request, most users just copy a system message to the search
engine to locate more information e.g., why this message has been thrown. Another
interesting observation is that these queries have an interesting discriminating
feature: In our sample the messages either had a length of more than five keywords,
such as [A pop-up window was blocked in visual composer] or a length of one
keyword, such as [DATASET _ WRITE _ ERROR]. Please note that we expected the
relevant answer in a document covering all the error codes. However we observed
that for most of these queries the relevant answer was discussed in a thread of the
forum.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>There are four broad research areas of work that are relevant to the work presented in
this paper. The following section discusses related work.</p>
      <p>
        Understanding search goals. The classification of search queries into navigational,
transactional, and informational was originally proposed in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Several examples and
scenarios for each class of queries in the context of enterprise search are described
in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and a more recent analysis of user goals in Web search is presented in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
There has also been prior work in the use of techniques based on classification and user
behavior for automatic user goal identification [
        <xref ref-type="bibr" rid="ref10 ref12 ref9">9, 10, 12</xref>
        ].Transactional queries in the
Intranet has been investigated in [
        <xref ref-type="bibr" rid="ref13 ref8">13, 8</xref>
        ]. Analogous to our approach of pre-identifying
and separately indexing navigational pages, the work presented in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] describes a
similar process for the class of transactional queries.
      </p>
      <p>
        Intranet search. Upstill et. al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] investigate the use of evidence such as in-degree,
variants of Page-Rank, and URL-type, when identifying home pages on several test
collections including an intranet data set. Their results indicate that of the three types
of evidence investigated, re-ranking based on URL-type provided the maximum
benefit. The study on “workplace web search” by [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] established that several conventional
ranking approaches that find favor in Web search are effective discriminators when
applied to intra net pages. The authors of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] also elucidate the differences between search
systems for the Web and those designed for enterprises. How to resolve navigational
queries in the intranet was studied by the authors of [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Their approach is based on
off-line identification of navigational pages, intelligent generation of term variants to
associate with each page, and the construction of separate indices exclusively devoted
to answer navigational queries.
      </p>
      <p>
        Web Page Search. There is a large amount of work in the area of using structural
information on a Web page (such as URL, anchor text, and title) to improve general
Web search and link-based page classification [
        <xref ref-type="bibr" rid="ref11 ref3 ref8">3, 8, 11</xref>
        ].
      </p>
      <p>
        Text Analytics. Text analytics is a mature area of research concerned with the problem
of automatically analyzing text to extract structured information. Examples of common
text analytic tasks include entity identification (e.g., identifying persons, locations,
organizations, etc.) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], relationship detection (e.g., person X works in company Y)[
        <xref ref-type="bibr" rid="ref15 ref18">15,
18</xref>
        ] and co-reference resolution (identifying different variants of the same entity either
in the same document or different documents) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Text analytic programs used for
information extraction are called annotators and the objects extracted by them are called
annotations. Traditionally, such annotations have been directly absorbed into
applications. A prominent example is the AVATAR Information Extraction System (IES) which
tackles some of these challenges [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
5
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>A major part of corporate search portals currently are not able to analyze the user
intention and thus often confront the user with imprecise answers. Based on a large query
log for a corporate portal we could identify common search intentions e.g., for
product home pages, sub sites as common navigational query intentions and What is and
How to, system messages queries as common informational queries. State-of-the-art
information extraction technologies are able to identify entities and relationships from
relevant pages.</p>
      <p>Our work has only scratched the surface of potential research questions: Could we
apply our study to other sources of unstructured information than the corporate web e.g.,
to customer relationship management systems or product information systems? Could
we use existing corporate structured data to discover entities and potential relationships
between them? How could we share extraction knowledge and the extracted information
itself? It is our hope, that by applying the operators to different company scenarios we
will improve the abstraction level and inspire a large community to write and share
efficient implementing for new and existing operators.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>A.</given-names>
            <surname>Broder</surname>
          </string-name>
          .
          <article-title>A taxonomy of web search</article-title>
          .
          <source>SIGIR Forum</source>
          ,
          <volume>36</volume>
          (
          <issue>2</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>10</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A. Z.</given-names>
            <surname>Broder</surname>
          </string-name>
          and
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Ciccolo</surname>
          </string-name>
          .
          <article-title>Towards the next generation of enterprise search technology</article-title>
          .
          <source>IBM SYSTEMS JOURNAL</source>
          ,
          <volume>43</volume>
          (
          <issue>3</issue>
          ):
          <fpage>451</fpage>
          -
          <lpage>454</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Robertson</surname>
          </string-name>
          .
          <article-title>Effective site finding using link anchor information</article-title>
          .
          <source>In SIGIR</source>
          , pages
          <fpage>250</fpage>
          -
          <lpage>257</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          .
          <article-title>Information extraction - a user guide</article-title>
          .
          <source>Technical Report CS-97-02</source>
          , University of Sheffield,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>R.</given-names>
            <surname>Fagin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. S.</given-names>
            <surname>McCurley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Novak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sivakumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Tomlin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Williamson</surname>
          </string-name>
          .
          <article-title>Searching the workplace web</article-title>
          .
          <source>In WWW '03: Proceedings of the 12th international conference on World Wide Web</source>
          , pages
          <fpage>366</fpage>
          -
          <lpage>375</lpage>
          , New York, NY, USA,
          <year>2003</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          .
          <article-title>Challenges in enterprise search</article-title>
          .
          <source>In 15th. Australasian Database Conference</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>E.</given-names>
            <surname>Kandogan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Krishnamurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <article-title>Avatar semantic search: a database approach to information retrieval</article-title>
          .
          <source>In SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data</source>
          , pages
          <fpage>790</fpage>
          -
          <lpage>792</lpage>
          , New York, NY, USA,
          <year>2006</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>I.-H.</given-names>
            <surname>Kang</surname>
          </string-name>
          .
          <article-title>Transactional query identification in Web search</article-title>
          .
          <source>In Asian Information Retrieval Symposium</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>I.-H.</given-names>
            <surname>Kang</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Kim</surname>
          </string-name>
          .
          <article-title>Query type classification for web document retrieval</article-title>
          .
          <source>In SIGIR</source>
          , pages
          <fpage>64</fpage>
          -
          <lpage>71</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. I.
          <string-name>
            <surname>-H. Kang</surname>
            and
            <given-names>G. C.</given-names>
          </string-name>
          <string-name>
            <surname>Kim</surname>
          </string-name>
          .
          <article-title>Integration of multiple evidences based on a query type for web search</article-title>
          .
          <source>Information Processing Management</source>
          ,
          <volume>40</volume>
          (
          <issue>3</issue>
          ):
          <fpage>459</fpage>
          -
          <lpage>478</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. W. Kraaij,
          <string-name>
            <given-names>T.</given-names>
            <surname>Westerveld</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          .
          <article-title>The importance of prior probabilities for entry page search</article-title>
          .
          <source>In SIGIR '02: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          , pages
          <fpage>27</fpage>
          -
          <lpage>34</lpage>
          , New York, NY, USA,
          <year>2002</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>U.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Cho</surname>
          </string-name>
          .
          <article-title>Automatic identification of user goals in web search</article-title>
          .
          <source>In WWW05</source>
          , pages
          <fpage>391</fpage>
          -
          <lpage>400</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Krishnamurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.V.</given-names>
            <surname>Jagadish</surname>
          </string-name>
          .
          <article-title>Getting work done on the web: Supporting transactional queries</article-title>
          .
          <source>In SIGIR</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>J. F. McCarthy</surname>
            and
            <given-names>W. G.</given-names>
          </string-name>
          <string-name>
            <surname>Lehnert</surname>
          </string-name>
          .
          <article-title>Using decision trees for coreference resolution</article-title>
          .
          <source>In IJCAI</source>
          , pages
          <fpage>1050</fpage>
          -
          <lpage>1055</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>K.</given-names>
            <surname>Nanda</surname>
          </string-name>
          .
          <article-title>Combining lexical, syntactic and semantic features with maximum entropy models for extracting relations</article-title>
          .
          <source>In Proc. of the 42nd Anniversary Meeting of the Association for Computational Linguistics (ACL04)</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>D. E.</given-names>
            <surname>Rose</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Levinson</surname>
          </string-name>
          .
          <article-title>Understanding user goals in web search</article-title>
          .
          <source>In WWW '04: Proceedings of the 13th international conference on World Wide Web</source>
          , pages
          <fpage>13</fpage>
          -
          <lpage>19</lpage>
          , New York, NY, USA,
          <year>2004</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>A.</given-names>
            <surname>Spink</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wolfram</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. B. J. Jansen</surname>
            , and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Saracevic</surname>
          </string-name>
          .
          <article-title>Searching the web: the public and their queries</article-title>
          .
          <source>J. Am. Soc. Inf. Sci. Technol</source>
          .,
          <volume>52</volume>
          (
          <issue>3</issue>
          ):
          <fpage>226</fpage>
          -
          <lpage>234</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>F. M. Suchanek</surname>
            ,
            <given-names>G.</given-names>
            Kasneci, and G.
          </string-name>
          <string-name>
            <surname>Weikum.</surname>
          </string-name>
          <article-title>Yago: a core of semantic knowledge</article-title>
          .
          <source>In WWW '07: Proceedings of the 16th international conference on World Wide Web</source>
          , pages
          <fpage>697</fpage>
          -
          <lpage>706</lpage>
          , New York, NY, USA,
          <year>2007</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. T.S.Jayram,
          <string-name>
            <given-names>R.</given-names>
            <surname>Krishnamurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Raghavan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhu</surname>
          </string-name>
          .
          <article-title>Avatar information extraction system</article-title>
          .
          <source>IEEE Data Engineering Bulletin</source>
          , May
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. T. Upstill,
          <string-name>
            <given-names>N.</given-names>
            <surname>Craswell</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Hawking</surname>
          </string-name>
          .
          <article-title>Query-independent evidence in home page finding</article-title>
          .
          <source>ACM Trans. Inf</source>
          . Syst.,
          <volume>21</volume>
          (
          <issue>3</issue>
          ):
          <fpage>286</fpage>
          -
          <lpage>313</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. H.
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Löser</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Raghavan</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Vaithyanathan</surname>
          </string-name>
          .
          <article-title>Navigating the intranet with high precision</article-title>
          .
          <source>In WWW '07: Proceedings of the 16th international conference on World Wide Web</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>