Studies comparing Boolean and natural language searching with actual end-users are still inconclusive. The TREC interactive track provides a consensus-developed protocol for assessing this and other useroriented information retrieval research questions. We recruited 28 experienced information professionals with library degrees to participate in this year’s TREC-7 interactive experiment. Our res...

boolean Element::isConnectedTo(Element n); An implementation, with the same signature (i.e., name and input/output types), should be defined for all concrete classes that inherit from Element, namely for the classes ANode, CNode and Link. We define different implementations for Link and Node (i.e., for both ANode and CNode). Here is the implementation for the abstract class Node: boolean Node::...

8.1 Introduction For most of recorded history, textual data have existed primarily in hardcopy format, and the related document retrieval process was essentially a manual task, possibly involving the assistance of cross-reference catalogs. By the mid-1960s, work was under way at the University of Pittsburgh to develop computer-assisted legal research systems [Harrington, 1984–85]. Also, during ...

We present a two-stage system for information exploration and retrieval. The first stage, named GALOIS, organizes the information contained into a database into a particular lattice structure; the second stage, named ULYSSES, is a visual interface to access the structure built in the earlier stage. In this paper we focus on the latter. ULYSSES is based on a tight integration of traditional and ...

We consider the problem of efficiently indexing Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) Boolean expressions over a high-dimensional multi-valued attribute space. The goal is to rapidly find the set of Boolean expressions that evaluate to true for a given assignment of values to attributes. A solution to this problem has applications in online advertising (where a Boolean...

Introduction Structure in documents has been a part of Information Retrieval as long as the field has existed. There have always been documents with metadata information such as authors and creation dates. Researchers have always recognized that document structure is important to effective retrieval. The earliest systems supporting structure focused on providing support for querying of the fiel...

This is our second participation in the TREC Legal Track. The TREC Legal Track 2011 featured only the Learning Task. We participated in Topics 401 and 403. We used Lemur 4.11 for Boolean retrieval and followed it with a clustering technique, where we chose members from each cluster (which we called seeds) for relevance judgement by the TA and assumed all other members of the cluster whose seeds...

class SSO { ... public: SessionID createSession(ClientID,SessionInfo, SessionPermission); boolean destroySession(ClientID,SessionID); boolean joinSession(ClientID,SessionID); boolean leaveSession(ClientID,SessionID); boolean inviteSession(ClientID,SessionID, ClientID); int howManySessions(SystemID); SessionID getSessionID(SystemID,Order); SessionInfo getSessionInfo(SessionID); SessionPermission...

In the official runs, statistics are produced using the MG (Witten, Moffat, Bell, 1994)) search engine, and the terms are in fact stems, rather than complete terms. The top 25 terms selected from the positive and negative examples are merged, to form a list with no more than 50 terms. The MG retrieval system is used (massively) to transform every judged document into a Boolean vector with one c...