2 resultados para query rewriting
em Glasgow Theses Service
Resumo:
This thesis compares contemporary anglophone and francophone rewritings of traditional fairy tales for adults. Examining material dating from the 1990s to the present, including novels, novellas, short stories, comics, televisual and filmic adaptations, this thesis argues that while the revisions studied share similar themes and have comparable aims, the methods for inducing wonder (where wonder is defined as the effect produced by the text rather than simply its magical contents) are diametrically opposed, and it is this opposition that characterises the difference between the two types of rewriting. While they all engage with the hybridity of the fairy-tale genre, the anglophone works studied tend to question traditional narratives by keeping the fantasy setting, while francophone works debunk the tales not only in relation to questions of content, but also aesthetics. Through theoretical, historical, and cultural contextualisation, along with close readings of the texts, this thesis aims to demonstrate the existence of this francophone/anglophone divide and to explain how and why the authors in each tradition tend to adopt such different views while rewriting similar material. This division is the guiding thread of the thesis and also functions as a springboard to explore other concepts such as genre hybridity, reader-response, and feminism. The thesis is divided into two parts; the first three chapters work as an in-depth literature review: after examining, in chapters one and two, the historical and contemporary cultural field in which these works were created, chapter three examines theories of fantasy and genre hybridity. The second part of the thesis consists of textual studies and comparisons between francophone and anglophone material and is built on three different approaches. The first (chapter four) looks at selected texts in relation to questions of form, studying the process of world building and world creation enacted when authors combine and rewrite several fairy tales in a single narrative world. The second (chapter five) is a thematic approach which investigates the interactions between femininity, the monstrous, and the wondrous in contemporary tales of animal brides. Finally, chapter six compares rewritings of the tale of ‘Bluebeard’ with a comparison hinged on the representation of the forbidden room and its contents: Bluebeard’s cabinet of wonder is one that he holds sacred, one where he sublimates his wives’ corpses, and it is the catalyst of wonder, terror, and awe. The three contextual chapters and the three text-based studies work towards tracing the tangible existence of the division postulated between francophone and anglophone texts, but also the similarities that exist between the two cultural fields and their roles in the renewal of the fairy-tale genre.
Resumo:
Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.