Ruskey and Savage asked the following question: Does every matching of Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? J. Fink showed that the question is true for every perfect matching, and solved the Kreweras’ conjecture. In this paper we consider the question in hypercubes with faulty edges. We show that every matching M of at most 2n− 1 edges can be extended to a Hamiltonian cycle of Qn ...

We introduce an approach to question answering in the biomedical domain that utilises similarity matching of question/answer pairs in a document, or a set of background documents, to select the best answer to a multiple-choice question. We explored a range of possible similarity matching methods, ranging from simple word overlap, to dependency graph matching, to feature-based vector similarity ...

This report describes the work done by the RFIA group at the Departamento de Sistemas Informáticos y Computación of the Universidad Politécnica of Valencia for the 2005 edition of the CLEF Question Answering task. We participated in three monolingual tasks: Spanish, Italian and French, and in two cross-language tasks: spanish to english and english to spanish. Since this was our first participa...

A strategy of automatic answer retrieval for repeated or similar questions in user-interactive systems by employing semantic question patterns is proposed in this paper. The used semantic question pattern is a generalized representation of a group of questions with both similar structure and relevant semantics. Specifically, it consists of semantic annotations (or constraints) for the variable ...

Basing on the debate around the definition of paraphrase, this work aims to empirically clarify what is considered a paraphrase by humans. The experiment accomplished has its starting point in one of the several campaigns that every year generate large amounts of validated textual data, which can be reused for different purposes. This paper describes in detail a simple method –based on pattern–...

In this paper, we give an overview of our questionanswering system for the NTCIR-3 QAC. Our system is based on an information-retrieval technique and an information-extraction technique by pattern matching. The system has three main stages: question analysis, passage retrieval, and answer extraction. In the passage-retrieval stage, two types of retrieval method are applied sequentially to narro...

In this paper, we develop a new indexing method for large web access-logs. We are concerned with pattern queries, which advocate the search for access sequences that contain certain query patterns. They find applications in processing web-log mining results (e.g., finding typical/atypical access-sequences). The proposed method focuses on scalability to web-logs’ sizes. For this reason, we exami...

This paper introduces L2F’s (INESC-ID) question/answering system and presents its results in the QA@CLEF07 evaluation task. QA@LF bases its performance on a high-quality deep linguistic analysis of the question, which is strongly based on named entity recognition. However, if a precise analysis is not possible or if no answer is found in previous processed data, the system is also capable of re...

This paper describes a full data-driven system for question answering. The system uses pattern matching and statistical techniques to identify the relevant passages as well as the candidate answers for factoid and definition questions. Since it does not consider any sophisticated linguistic analysis of questions and answers, it can be applied to different languages without requiring major adapt...

In this paper we present a new Question Answering (QA) system based on redundancy and a new Passage Retrieval (PR) method oriented to QA. We suppose that in a large enough document collection we can find the answer to any question of several forms. Therefore, it is possible to find one or several sentences including the answers which contain part of the original questions. Next, we use Support ...