<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T12:30:26Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7728" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7728</identifier><datestamp>2017-03-21T20:38:40Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="5afa6b01-7f86-49c9-9e7d-a612fe606f6e" confidence="600">Pound, Jeffrey</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-08-22T15:00:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-08-22T15:00:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-08-22T15:00:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2013-08-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7728</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Many keyword queries issued to Web search engines target information about real world entities,&#xd;
and interpreting these queries over Web knowledge bases can allow a search system to provide exact answers to keyword queries.&#xd;
Such an ability provides a useful service to end users, as their information need can be directly addressed and they need not&#xd;
scour textual results for the desired information. &#xd;
However, not all keyword queries can be addressed by even the most comprehensive knowledge base, and therefore equally &#xd;
important is the problem of recognizing when a reference knowledge base is not capable of modelling the keyword query&amp;apos;s intention. &#xd;
This may be due to lack of coverage of the knowledge base or lack of expressiveness in the underlying query representation formalism.&#xd;
&#xd;
This thesis presents an approach to computing structured representations of keyword queries over a reference knowledge base. &#xd;
Keyword queries are annotated with occurrences of semantic constructs by learning a sequential labelling model from an annotated&#xd;
Web query log. Frequent query structures are then mined from the query log and are used along with the annotations to map keyword&#xd;
queries into a structured representation over the vocabulary of a reference knowledge base. &#xd;
The proposed approach exploits coarse linguistic structure in keyword queries, and combines it with rich structured query &#xd;
representations of information needs. &#xd;
&#xd;
As an intermediate representation formalism, a novel query language is proposed that blends keyword search &#xd;
with structured query processing over large Web knowledge bases.&#xd;
The formalism for structured keyword queries combines the flexibility of keyword search with the expressiveness of &#xd;
structures queries. A solution to the resulting disambiguation problem caused by introducing keywords as primitives &#xd;
in a structured query language is presented. Expressions in our proposed language are rewritten using the&#xd;
vocabulary of the knowledge base, and different possible rewritings are ranked based on their syntactic relationship&#xd;
to the keywords in the query as well as their semantic coherence in the underlying knowledge base.&#xd;
&#xd;
The problem of ranking knowledge base entities returned as a query result is also explored from the perspective of &#xd;
personalized result ranking. User interest models based on entity types are learned from a Web search session by &#xd;
cross referencing clicks on URLs with known entity homepages. The user interest model is then used to effectively&#xd;
rerank answer lists for a given user.&#xd;
A methodology for evaluating entity-based search engines is also proposed and empirically evaluated.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Interpreting and Answering Keyword Queries using Web Knowledge Bases</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>