{ "paper_id": "A00-1025", "header": { "generated_with": "S2ORC 1.0.0", "date_generated": "2023-01-19T01:12:02.578390Z" }, "title": "Examining the Role of Statistical and Linguistic Knowledge Sources in a General-Knowledge Question-Answering System", "authors": [ { "first": "Claire", "middle": [], "last": "Cardie", "suffix": "", "affiliation": { "laboratory": "", "institution": "Cornell University", "location": { "postCode": "148531", "settlement": "Ithaca", "region": "NY", "country": "SaBIR Research" } }, "email": "cardie@cs.cornell.edu" }, { "first": "Vincent", "middle": [], "last": "Ng", "suffix": "", "affiliation": { "laboratory": "", "institution": "Cornell University", "location": { "postCode": "148531", "settlement": "Ithaca", "region": "NY", "country": "SaBIR Research" } }, "email": "" }, { "first": "David", "middle": [], "last": "Pierce", "suffix": "", "affiliation": { "laboratory": "", "institution": "Cornell University", "location": { "postCode": "148531", "settlement": "Ithaca", "region": "NY", "country": "SaBIR Research" } }, "email": "pierce@cs.cornell.edu" }, { "first": "Chris", "middle": [], "last": "Buckley", "suffix": "", "affiliation": { "laboratory": "", "institution": "Cornell University", "location": { "postCode": "148531", "settlement": "Ithaca", "region": "NY", "country": "SaBIR Research" } }, "email": "chrisb@sabir.com" } ], "year": "", "venue": null, "identifiers": {}, "abstract": "We describe and evaluate an implemented system for general-knowledge question answering. The system combines techniques for standard ad-hoc information retrieval (IR), query-dependent text summarization, and shallow syntactic and semantic sentence analysis. In a series of experiments we examine the role of each statistical and linguistic knowledge source in the question-answering system. In contrast to previous results, we find first that statistical knowledge of word co-occurrences as computed by IR vector space methods can be used to quickly and accurately locate the relevant documents for each question. The use of query-dependent text summarization techniques, however, provides only small increases in performance and severely limits recall levels when inaccurate. Nevertheless, it is the text summarization component that allows subsequent linguistic filters to focus on relevant passages. We find that even very weak linguistic knowledge can offer substantial improvements over purely IRbased techniques for question answering, especially when smoothly integrated with statistical preferences computed by the IR subsystems.", "pdf_parse": { "paper_id": "A00-1025", "_pdf_hash": "", "abstract": [ { "text": "We describe and evaluate an implemented system for general-knowledge question answering. The system combines techniques for standard ad-hoc information retrieval (IR), query-dependent text summarization, and shallow syntactic and semantic sentence analysis. In a series of experiments we examine the role of each statistical and linguistic knowledge source in the question-answering system. In contrast to previous results, we find first that statistical knowledge of word co-occurrences as computed by IR vector space methods can be used to quickly and accurately locate the relevant documents for each question. The use of query-dependent text summarization techniques, however, provides only small increases in performance and severely limits recall levels when inaccurate. Nevertheless, it is the text summarization component that allows subsequent linguistic filters to focus on relevant passages. We find that even very weak linguistic knowledge can offer substantial improvements over purely IRbased techniques for question answering, especially when smoothly integrated with statistical preferences computed by the IR subsystems.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Abstract", "sec_num": null } ], "body_text": [ { "text": "In this paper, we describe and evaluate an implemented system for general-knowledge question answering. Open-ended question-answering systems that allow users to pose a question of any type, in any language, without domain restrictions, remain beyond the scope of today's text-processing systems. We investigate instead a restricted, but nevertheless useful variation of the problem (TREC-8, 2000) :", "cite_spans": [ { "start": 383, "end": 397, "text": "(TREC-8, 2000)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Given a large text collection and a set of questions specified in English, find answers to the questions in the collection.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "In addition, the restricted task guarantees that:", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "\u2022 the answer exists in the collection,", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "\u2022 all supporting information for the answer lies in a single document, and", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "\u2022 the answer is short m less than 50 bytes in length.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Consider, for example, the question Which country has the largest part of the Amazon rain forest?, taken from the TREC8 Question Answering development corpus. The answer (in document LA032590-0089) is Brazil Previous research has addressed similar questionanswering (QA) scenarios using a variety of natural language processing (NLP) and information retrieval (IR) techniques. Lehnert (1978) tackles the difficult task of answering questions in the context of story understanding. Unlike our restricted QA task, questions to Lehnert's system often require answers that are not explicitly mentioned in the story. Her goal then is to answer questions by making inferences about actions and actors in the story using world knowledge in the form of scripts, plans, and goals (Schank and Abelson, 1977) . More recently, Burke et al. (1995; 1997) describe a system that answers natural language questions using a database of question-answer pairs built from existing frequentlyasked question (FAQ) files. Their FAQFinder system uses IR techniques to match the given question to questions in the database. It then uses the Word-Net lexical semantic knowledge base (Miller et al., 1990; Fellbaum, 1998) to improve the quality of the match. Kupiec (1993) investigates a closed-class QA task that is similar in many respects to the TREC8 QA task that we address here: the system answers general-knowledge questions using an encyclopedia. In addition, Kupiec assumes that all answers are noun phrases. Although our task does not explicitly include a \"noun phrase\" constraint, the answer length restriction effectively imposes the same bias toward noun phrase answers. Kupiec's MURAX system applies a combination of statistical (IR) and linguistic (NLP) techniques. A series of secondary boolean search queries with proximity constraints is combined with shallow parsing methods to find relevant sections of the encyclopedia, to extract answer hypotheses, and to confirm phrase relations specified in the question. In an evaluation on 70 \"Trivial Pursuit\" who and what questions, Kupiec concludes that robust natural language analysis can add to the quality of the information retrieval process. In addition, he claims that, for their closed-class QA task, vector space IR methods (Salton et al., 1975) appear inadequate.", "cite_spans": [ { "start": 377, "end": 391, "text": "Lehnert (1978)", "ref_id": "BIBREF12" }, { "start": 771, "end": 797, "text": "(Schank and Abelson, 1977)", "ref_id": "BIBREF23" }, { "start": 815, "end": 834, "text": "Burke et al. (1995;", "ref_id": "BIBREF6" }, { "start": 835, "end": 840, "text": "1997)", "ref_id": "BIBREF7" }, { "start": 1157, "end": 1178, "text": "(Miller et al., 1990;", "ref_id": "BIBREF15" }, { "start": 1179, "end": 1194, "text": "Fellbaum, 1998)", "ref_id": "BIBREF10" }, { "start": 1232, "end": 1245, "text": "Kupiec (1993)", "ref_id": "BIBREF11" }, { "start": 2269, "end": 2290, "text": "(Salton et al., 1975)", "ref_id": "BIBREF20" } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "We present here a new approach to the restricted question-answering task described above. Like MURAX, our system draws from both statistical and linguistic sources to find answers to generalknowledge questions. The underlying architecture of the system, however, is very different: it combines vector space IR techniques for document retrieval, a vector space approach to query-dependent text summarization, shallow corpus-based syntactic analysis, and knowledge-based semantic analysis. We evaluate the system on the TREC8 QA development corpus as well as the TREC8 QA test corpus. In particular, all parameters for the final QA system are determined using the development corpus. Our current results are encouraging but not outstanding: the system is able to correctly answer 22 out of 38 of the development questions and 91 out of 200 of the test questions given five guesses for each question. Furthermore, the first guess is correct for 16 out of the 22 development questions and 53 out of 91 of the test questions.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "More importantly, we investigate the relative role of each statistical and linguistic knowledge source in the proposed IR/NLP question-answering system. In contrast to previous results, we find that statistical knowledge of word co-occurrences as computed by vector space models of IR can be used to quickly and accurately locate relevant documents in the restricted QA task. When used in isolation, vector space methods for query-dependent text summarization, however, provide relatively small increases in performance. In addition, we find that the text summarization component can severely limit recall levels. Nevertheless, it is the summarization component that allows the linguistic filters to focus on relevant passages. In particular, we find that very weak linguistic knowledge can offer substantial improvements over purely IR-based techniques for question answering, especially when smoothly integrated with the statistical preferences computed by the IR subsystems.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "In the next section, we describe the general architecture of the question-answering system. Section 3 describes the baseline system and its information retrieval component. Sections 4-7 describe and evaluate a series of variations to the baseline system that incorporate, in turn, query-dependent text summarization, a syntactic filter, a semantic filter, and an algorithm that allows syntactic knowledge to influence the initial ordering of summary extracts. Section 8 compares our approach to some of those in the recent TREC8 QA evaluation (TREC-8, 2000) and describes directions for future work.", "cite_spans": [ { "start": 543, "end": 557, "text": "(TREC-8, 2000)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "The basic architecture of the question-answering system is depicted in Figure 1 . It contains two main components: the IR subsystems and the linguistic filters. As a preliminary, ofl]ine step, the IR subsystem first indexes the text collection from which answers are to be extracted. Given a question, the goal of the IR component is then to return a ranked list of those text chunks (e.g. documents, sentences, or paragraphs) from the indexed collection that are most relevant to the query and from which answer hypotheses can he extracted. Next, the QA system optionally applies one or more linguistic filters to the text chunks to extract an ordered list of answer hypotheses. The top hypotheses are concatenated to form five 50-byte guesses as allowed by the TREC8 guidelines. Note that many of these guesses may be difficult to read and judged as incorrect by the TREC8 assessors: we will also describe the results of generating single phrases as guesses wherever this is possible. In the sections below, we present and evaluate a series of instantiations of this general architecture, each of which makes different assumptions regarding the type of information that will best support the QA task. The next section begins by describing the baseline QA system.", "cite_spans": [], "ref_spans": [ { "start": 71, "end": 79, "text": "Figure 1", "ref_id": "FIGREF0" } ], "eq_spans": [], "section": "System Architecture", "sec_num": "2" }, { "text": "It is clear that a successful QA system will need some way to find the documents that are most relevant to the user's question. In a baseline system, we assume that standard IR techniques can be used for this task. In contrast to MURAX, however, we hypothesize that the vector space retrieval model will suffice. In the vector space model, both the question and the documents are represented as vectors with one entry for every unique word that appears in the collection. Each entry is the term weight, a real number that indicates the presence or absence of the word in the text. The similarity between a question vector, Q = ql,q2,... ,qn, and a document vector, D = dl, d2,..., tin, is traditionally computed using a cosine similarity measure:", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "n 8im(Q,D) = Z d, .q, i..~ l", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "Using this measure, the IR system returns a ranked list of those documents most similar to the question.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "The Baseline QA System: The Smart Vector Space Model. For the IR component of the baseline QA system, we use Smart (Salton, 1971 ), a sophisticated text-processing system based on the vector space model and employed as the retrieval engine for a number of the top-performing systems at recent Text REtrieval Conferences (e.g. Buckley et al., 1998a Buckley et al., , 1998b . Given a question, Smart returns a ranked list of the documents most relevant to the question. For the baseline QA system and all subsequent variations, we use Smart with standard term-weighting strategies I and do not use automatic relevance feedback (Buckley, 1995) . In addition, the baseline system applies no linguistic filters. To generate answers for a particular question, the system starts at the beginning of the top-ranked document returned by Smart for the question and constructs five 50-byte chunks consisting of document text with stopwords removed.", "cite_spans": [ { "start": 115, "end": 128, "text": "(Salton, 1971", "ref_id": null }, { "start": 326, "end": 347, "text": "Buckley et al., 1998a", "ref_id": "BIBREF1" }, { "start": 348, "end": 371, "text": "Buckley et al., , 1998b", "ref_id": "BIBREF3" }, { "start": 625, "end": 640, "text": "(Buckley, 1995)", "ref_id": "BIBREF5" } ], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "lWe use Lnu term weighting for documents and Itu term weighting for the question (Singhal et al., 1996) .", "cite_spans": [ { "start": 81, "end": 103, "text": "(Singhal et al., 1996)", "ref_id": "BIBREF24" } ], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "Evaluation. As noted above, we evaluate each variation of our QA system on 38 TREC8 development questions and 200 TREC8 test questions. The indexed collection is TREC disks 4 and 5 (without Congressional Records). Results for the baseline Smart IR QA system are shown in the first row of Table 1 . The system gets 3 out of 38 development questions and 29 out of 200 test questions correct. We judge the system correct if any of the five guesses contains each word of one of the answers. The final column of results shows the mean answer rank across all questions correctly answered.", "cite_spans": [], "ref_spans": [ { "start": 288, "end": 295, "text": "Table 1", "ref_id": null } ], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "Smart is actually performing much better than its scores would suggest. For 18 of the 38 development questions, the answer appears in the top-ranked document; for 33 questions, the answer appears in one of the top seven documents. For only two questions does Smart fail to retrieve a good document in the top 25 documents. For the test corpus, over half of the 200 questions are answered in the top-ranked document (110); over 75% of the questions (155) are answered in top five documents. Only 19 questions were not answered in the top 20 documents.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The Vector Space Model for Document Retrieval", "sec_num": "3" }, { "text": "for Question", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Summarization", "sec_num": null }, { "text": "We next hypothesize that query-dependent text summarization algorithms will improve the performance of the QA system by focusing the system on the most relevant portions of the retrieved documents. The goal for query-dependent summarization algorithms is to provide a short summary of a document with respect to a specific query. Although a number of methods for query-dependent text summarization are beginning to be developed and evaluated in a variety of realistic settings (Mani et al., 1999) , we again propose the use of vector space methods from IR, which can be easily extended to the summarization task (Salton et al., 1994) :", "cite_spans": [ { "start": 477, "end": 496, "text": "(Mani et al., 1999)", "ref_id": "BIBREF13" }, { "start": 612, "end": 633, "text": "(Salton et al., 1994)", "ref_id": "BIBREF21" } ], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "1. Given a question and a document, divide the document into chunks (e.g. sentences, paragraphs, 200-word passages).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "2. Generate the vector representation for the question and for each document chunk.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "3. Use the cosine similarity measure to determine the similarity of each chunk to the question.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "4. Return as the query-dependent summary the most similar chunks up to a predetermined summary length (e.g. 10% or 20% of the original document).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "This approach to text summarization was shown to be quite successful in the recent SUMMAC evaluation of text summarization systems (Mani et al., 1999; Buckley et al., 1999) . Our general assumption here is that Ii~ approaches can be used to quickly and accurately find both relevant documents and relevant document portions. In related work, Chali et al. (1999) also propose text summarization techniques as a primary component for their QA system. They employ a combination of vector-space methods and lexical chaining to derive their sentencebased summaries. We hypothesize that deeper analysis of the summary extracts is better accomplished by methods from NLP that can determine syntactic and semantic relationships between relevant constituents. There is a risk in using query-dependent summaries to focus the search for answer hypotheses, however: if the summarization algorithm is inaccurate, the desired answers will occur outside of the summaries and will not be accessible to subsequent components of the QA system.", "cite_spans": [ { "start": 131, "end": 150, "text": "(Mani et al., 1999;", "ref_id": "BIBREF13" }, { "start": 151, "end": 172, "text": "Buckley et al., 1999)", "ref_id": "BIBREF4" }, { "start": 342, "end": 361, "text": "Chali et al. (1999)", "ref_id": "BIBREF9" } ], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "The Query-Dependent Text Summarization QA System. In the next version of the QA system, we augment the baseline system to perform query-dependent text summarization for the top k retrieved documents. More specifically, the IR subsystem returns the summary extracts (sentences or paragraphs) for the top k documents after sorting them according to their cosine similarity scores w.r.t, the question. As before, no linguistic filters are applied, and answers are generated by constructing 50-byte chunks from the ordered extracts after removing stopwords. In the experiments below, k = 7 for the development questions and k = 6 for the test questions. 2 Evaluation. Results for the Text Summarization QA system using sentence-based summaries are shown in the second row of Table 1 . Here we see a relatively small improvement: the system now answers four development and 45 test questions correctly. The mean answer rank, however, improves noticeably from 3.33 to 2.25 for the development corpus and from 3.07 to 2.67 for the test corpus. Paragraph-based summaries yield similar but slightly smaller improvements; as a result, sentence summaries are used exclusively in subsequent sections. Unfortunately, the system's reliance on querydependent text summarization actually limits its potential: in only 23 of the 38 development questions (61%), for example, does the correct answer appear in the summary for one of the top k --7 documents. The QA system cannot hope to answer correctly any of the remaining 15 questions. For only 135 of the 200 questions in the test corpus (67.5%) does the correct answer appear in the summary for one of 2The value for k was chosen so that at least 80% of the questions in the set had answers appearing in the retrieved documents ranked 1-k. We have not experimented extensively with many values of k and expect that better performance can be obtained by tuning k for each text collection.", "cite_spans": [], "ref_spans": [ { "start": 771, "end": 778, "text": "Table 1", "ref_id": null } ], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "the top k --6 documents. 3 It is possible that automatic relevance feedback or coreference resolution would improve performance. We are investigating these options in current work.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "The decision of whether or not to incorporate text summarization in the QA system depends, in part, on the ability of subsequent processing components (i.e. the linguistic filters) to locate answer hypotheses. If subsequent components are very good at discarding implausible answers, then summarization methods may limit system performance. Therefore, we investigate next the use of two linguistic filters in conjunction with the query-dependent text summarization methods evaluated here.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Answering", "sec_num": null }, { "text": "Incorporating the Noun Phrase Filter", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "The restricted QA task that we investigate requires answers to be short --no more than 50 bytes in length. This effectively eliminates how or why questions from consideration. Almost all of the remaining question types are likely to have noun phrases as answers. In the TREC8 development corpus, for example, 36 of 38 questions have noun phrase answers.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "As a result, we next investigate the use of a very simple linguistic filter that considers only noun phrases as answer hypotheses. The filter operates on the ordered list of summary extracts for a particular question and produces a list of answer hypotheses, one for each noun phrase (NP) in the extracts in the left-to-right order in which they appeared.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "The NP-based QA System. Our implementation of the NP-based QA system uses the Empire noun phrase finder, which is described in detail in Cardie and Pierce (1998) . Empire identifies base NPs --non-recursive noun phrases --using a very simple algorithm that matches part-of-speech tag sequences based on a learned noun phrase grammar. The approach is able to achieve 94% precision and recall for base NPs derived from the Penn Treebank Wall Street Journal (Marcus et al., 1993) . In the experiments below, the NP filter follows the application of the document retrieval and text summarization components. Pronoun answer hypotheses are discarded, and the NPs are assembled into 50-byte chunks.", "cite_spans": [ { "start": 137, "end": 161, "text": "Cardie and Pierce (1998)", "ref_id": "BIBREF8" }, { "start": 455, "end": 476, "text": "(Marcus et al., 1993)", "ref_id": "BIBREF14" } ], "ref_spans": [], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "Evaluation. Results for the NP-based QA system are shown in the third row of Table 1 . The noun phrase filter markedly improves system performance for the development corpus, nearly dou-3Paragraph-based summaries provide better coverage on the test corpus than sentence-based summaries: for 151 questions, the correct answer appears in the summary for one of the top k documents. This suggests that paragraph summaries might be better suited for use with more sophisticated linguistic filters that are capable of discerning the answer in the larger summary. bling the number of questions answered correctly. We found these results somewhat surprising since this linguistic filter is rather weak: we expected it to work well only in combination with the semantic filter described below. The noun phrase filter has much less of an effect on the test corpus, improving performance on questions answered from 45 to 50. In a separate experiment, we applied the NP filter to the baseline system that includes no text summa\u00b0 rization component. Here the NP filter does not improve performance --the system gets only two questions correct. This indicates that the NP filter depends critically on the text summarization component. As a result, we will continue to use querydependent text summarization in the experiments below.", "cite_spans": [], "ref_spans": [ { "start": 77, "end": 84, "text": "Table 1", "ref_id": null } ], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "The NP filter provides the first opportunity to look at single-phrase answers. The preceding QA systems produced answers that were rather unnaturally chunked into 50-byte strings. When such chunking is disabled, only one development and 20 test questions are answered. The difference in performance between the NP filter with chunking and the NP filter alone clearly indicates that the NP filter is extracting good guesses, but that subsequent linguistic processing is needed to promote the best guesses to the top of the ranked guess list.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "5", "sec_num": null }, { "text": "The NP filter does not explicitly consider the question in its search for noun phrase answers. It is clear, however, that a QA system must pay greater attention to the syntactic and semantic constraints specified in the question. For example, a question like Who was president of the US in 19957 indicates that the answer is likely to be a person. In addition, there should be supporting evidence from the answer document that the person was president, and, more specifically, held this office in the US and in 1995.", "cite_spans": [ { "start": 284, "end": 295, "text": "US in 19957", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "We introduce here a second linguistic filter that considers the primary semantic constraint from the question. The filter begins by determining the ques-tion type, i.e. the semantic type requested in the question. It then takes the ordered set of summary extracts supplied by the IR subsytem, uses the syntactic filter from Section 5 to extract NPs, and generates an answer hypothesis for every noun phrase that is semantically compatible with the question type. Our implementation of this semantic class filter is described below. The filter currently makes no attempt to confirm other linguistic relations mentioned in the question.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "The Semantic Type Checking QA System. For most questions, the question word itself determines the semantic type of the answer. This is true for who, where, and when questions, for example, which request a person, place, and time expression as an answer. For many which and what questions, however, determining the question type requires additional syntactic analysis. For these, we currently extract the head noun in the question as the question type. For example, in Which country has the largest part o$ the Amazon rain :forest? we identify country as the question type. Our heuristics for determining question type were based on the development corpus and were designed to be general, but have not yet been directly evaluated on a separate question corpus.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "\u2022 Given the question type and an answer hypothesis, the Semantic Type Checking QA System then uses WordNet to check that an appropriate ancestordescendent relationship holds. Given Brazil as an answer hypothesis for the above question, for example, Wordnet's type hierarchy confirms that Brazil is a subtype of country, allowing the system to conclude that the semantic type of the answer hypothesis matches the question type.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "For words (mostly proper nouns) that do not appear in WordNet, heuristics are used to determine semantic type. There are heuristics to recognize 13 basic question types: Person, Location, Date, Month, Year, Time, Age, Weight, Area, Volume, Length, Amount, and Number. For Person questions, for example, the system relies primarily on a rule that checks for capitalization and abbreviations in order to identify phrases that correspond to people. There are approximately 20 such rules that together cover all 13 question types listed above. The rules effectively operate as a very simple named entity identifier. Evaluation. Results for the Semantic Type Checking variation of the QA system are shown in the fourth row of Table 1 . Here we see a dramatic increase in performance: the system answers three times as many development questions (21) correctly over the previous variation. This is especially encouraging given that the IR and text summarization components limit the maximum number correct to 23. In addition, the mean answer rank improves from 2.29 to 1.38. A closer look at Table 1 , however, indicates problems with the semantic type checking linguistic filter. While performance on the development corpus increases by 37 percentage points (from 18.4% correct to 55.3% correct), relative gains for the test corpus are much smaller. There is only an improvement of 18 percentage points, from 25.0% correct (50/200) to 43.0% correct (86/200). This is a clear indication that the heuristics used in the semantic type checking component, which were designed based on the development corpus, do not generalize well to different question sets. Replacing the current heuristics with a Named Entity identification component or learning the heuristics using standard inductive learning techniques should help with the scalability of this linguistic filter.", "cite_spans": [], "ref_spans": [ { "start": 721, "end": 728, "text": "Table 1", "ref_id": null }, { "start": 1086, "end": 1093, "text": "Table 1", "ref_id": null } ], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "Nevertheless, it is somewhat surprising that very weak syntactic information (the NP filter) and weak semantic class information (question type checking) can produce such improvements. In particular, it appears that it is reasonable to rely implicitly on the IR subsystems to enforce the other linguistic relationships specified in the query (e.g. that Clinton is president, that this office was held in the US and in 1995).", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "Finally, when 50-byte chunking is disabled for the semantic type checking QA variation, there is a decrease in the number of questions correctly answered, to 19 and 57 for the development and test corpus, respectively.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Incorporating Semantic Type Information", "sec_num": "6" }, { "text": "Syntactic and semantic linguistic knowledge has been used thus far as post-processing filters that locate and confirm answer hypotheses from the statistically specified summary extracts. We hypothesized that further improvements might be made by allowing this linguistic knowledge to influence the initial ordering of text chunks for the linguistic filters. In a final system, we begin to investigate this claim. Our general approach is to define a new scoring measure that operates on the summary extracts and can be used to reorder the extracts based on linguistic knowledge. The QA System with Linguistic Reordering of Summary Extracts. As described above, our final version of the QA system ranks summary extracts according to both their vector space similarity to the question as well as linguistic evidence that the answer lies within the extract. In particular, each summary extract E for question q is ranked according to a new score, Sq:", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Extracts", "sec_num": null }, { "text": "The intuition behind the new score is to prefer summary extracts that exhibit the same linguistic relationships as the question (as indicated by LRq) and to give more weight (as indicated by w) to linguistic relationship matches in extracts from higher-ranked documents. More specifically, LRq(E ) is the number of linguistic relationships from the question that appear in E. In the experiments below, LRq(E) is just the number of base NPs from the question that appear in the summary extract. In future work, we plan to include other pairwise linguistic relationships (e.g. subject-verb relationships, verbobject relationships, pp-attachment relationships).", "cite_spans": [ { "start": 402, "end": 408, "text": "LRq(E)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "sq(E) = w(E) . LRq(E)", "sec_num": null }, { "text": "The weight w(E) is a number between 0 and 1 that is based on the retrieval rank r of the document that contains E: w(E) = max (m, 1 -p. r) In our experiments, m = 0.5 and p = 0.1. Both values were selected manually based on the development corpus; an extensive search for the best such values was not done.", "cite_spans": [ { "start": 126, "end": 138, "text": "(m, 1 -p. r)", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "sq(E) = w(E) . LRq(E)", "sec_num": null }, { "text": "The summary extracts are sorted according to the new scoring measure and the ranked list of sentences is provided to the linguistic filters as before.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "sq(E) = w(E) . LRq(E)", "sec_num": null }, { "text": "Evaluation. Results for this final variation of the QA system are shown in the bottom row of Table 1. Here we see a fairly minor increase in performance over the use of linguistic filters alone: the system answers only one more question correctly than the previous variation for the development corpus and answers five additional questions for the test corpus. The mean answer rank improves only negligibly. Sixteen of the 22 correct answers (73%) appear as the top-ranked guess for the development corpus; only 53 out of 91 correct answers (58%) appear as the top-ranked guess for the test corpus. Unfortunately, when 50-byte chunking is disabled, system performance drops precipitously, by 5% (to 20 out of 38) for the development corpus and by 13% (to 65 out of 200) for the test corpus. As noted above, this indicates that the filters are finding the answers, but more sophisticated linguistic sorting is needed to promote the best answers to the top. Through its LRq term, the new scoring measure does provide a mechanism for allowing other linguistic relationships to influence the initial ordering of summary extracts. The current results, however, indicate that with only very weak syntactic information (i.e. base noun phrases), the new scoring measure is only marginally successful in reordering the summary extracts based on syntactic information.", "cite_spans": [], "ref_spans": [ { "start": 93, "end": 101, "text": "Table 1.", "ref_id": null } ], "eq_spans": [], "section": "sq(E) = w(E) . LRq(E)", "sec_num": null }, { "text": "As noted above, the final system (with the liberal 50-byte answer chunker) correctly answers 22 out of 38 questions for the development corpus. Of the 16 errors, the text retrieval component is responsible for five (31.2%), the text summarization component for ten (62.5%), and the linguistic filters for one (6.3%). In this analysis we consider the linguistic filters responsible for an error if they were unable to promote an available answer hypothesis to one of the top five guesses. A slightly different situation arises for the test corpus: of the 109 errors, the text retrieval component is responsible for 39 (35.8%), the text summarization component for 26 (23.9%), and the linguistic filters for 44 (40.4%). As discussed in Section 6, the heuristics that comprise the semantic type checking filter do not scale to the test corpus and are the primary reason for the larger percentage of errors attributed to the linguistic filters for that corpus.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "sq(E) = w(E) . LRq(E)", "sec_num": null }, { "text": "We have described and evaluated a series of question-answering systems, each of which incorporates a different combination of statistical and linguistic knowledge sources. We find that even very weak linguistic knowledge can offer substantial improvements over purely IR-based techniques especially when smoothly integrated with the text passage preferences computed by the IR subsystems. Although our primary goal was to investigate the use of statistical and linguistic knowledge sources, it is possible to compare our approach and our results to those for systems in the recent TREC8 QA evaluation. Scores on the TREC8 test corpus for systems participating in the QA evaluation ranged between 3 and 146 correct. Discarding the top three scores and the worst three scores, the remaining eight systems achieved between 52 and 91 correct. Using the liberal answer chunker, our final QA system equals the best of these systems (91 correct); without it, our score of 65 correct places our QA system near the middle of this group of eight. Like the work described here, virtually all of the top-ranked TREC8 systems use a combination of IR and shallow NLP for their QA systems. IBM's AnSel system (Prager et al., 2000) , for example, employs finite-state patterns as its primary shallow NLP component. These are used to recognize a fairly broad set of about 20 named entities. The IR component indexes only text passages associated with these entities. The AT&T QA system (Singhal et al., 2000) , the Qanda system (Breck et al., 2000) , and the SyncMatcher system (Oard et al., 2000) all employ vector-space methods from IR, named entity identifiers, and a fairly simple question type determiner. In addition, SyncMatcher uses a broad-coverage dependency parser to enforce phrase relationship constraints. Instead of the vector space model, the LASSO system (Moldovan et al., 2000) uses boolean search operators for paragraph retrieval. Recognition of answer hypotheses in their system relies on identifying named entities. Finally, the Cymphony QA system (Srihari and Li, 2000) relies heavily on named entity identification; it also employs standard IR techniques and a shallow parser.", "cite_spans": [ { "start": 1194, "end": 1215, "text": "(Prager et al., 2000)", "ref_id": "BIBREF19" }, { "start": 1469, "end": 1491, "text": "(Singhal et al., 2000)", "ref_id": "BIBREF25" }, { "start": 1511, "end": 1531, "text": "(Breck et al., 2000)", "ref_id": "BIBREF0" }, { "start": 1561, "end": 1580, "text": "(Oard et al., 2000)", "ref_id": "BIBREF18" }, { "start": 1855, "end": 1878, "text": "(Moldovan et al., 2000)", "ref_id": "BIBREF16" }, { "start": 2053, "end": 2075, "text": "(Srihari and Li, 2000)", "ref_id": "BIBREF26" } ], "ref_spans": [], "eq_spans": [], "section": "Related Work and Conclusions", "sec_num": "8" }, { "text": "In terms of statistical and linguistic knowledge sources employed, the primary difference between these systems and ours is our lack of an adequate named entity tagger. Incorporation of such a tagger will be a focus of future work. In addition, we believe that the retrieval and summarization components can be improved by incorporating automatic relevance feedback (Buckley, 1995) and coreference resolution. Morton (1999) , for example, shows that coreference resolution improves passage retrieval for their question-answering system. We also plan to reconsider paragraph-based summaries given their coverage on the test corpus. The most critical area for improvement, however, is the linguistic filters. The semantic type filter will be greatly improved by the addition of a named entity tagger, but we believe that additional gains can be attained by augmenting named entity identification with information from WordNet. Finally, we currently make no attempt to confirm any phrase relations from the query. Without this, system performance will remain severely limited.", "cite_spans": [ { "start": 366, "end": 381, "text": "(Buckley, 1995)", "ref_id": "BIBREF5" }, { "start": 410, "end": 423, "text": "Morton (1999)", "ref_id": "BIBREF17" } ], "ref_spans": [], "eq_spans": [], "section": "Related Work and Conclusions", "sec_num": "8" } ], "back_matter": [ { "text": "This work was supported in part by NSF Grants IRI-9624639 and GER-9454149.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Acknowledgments", "sec_num": null } ], "bib_entries": { "BIBREF0": { "ref_id": "b0", "title": "A Sys Called Qanda", "authors": [ { "first": "E", "middle": [], "last": "Breck", "suffix": "" }, { "first": "J", "middle": [], "last": "Burger", "suffix": "" }, { "first": "L", "middle": [], "last": "Ferro", "suffix": "" }, { "first": "D", "middle": [], "last": "House", "suffix": "" }, { "first": "M", "middle": [], "last": "Light", "suffix": "" }, { "first": "I", "middle": [], "last": "Mani", "suffix": "" } ], "year": 2000, "venue": "Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "E. Breck, J. Burger, L. Ferro, D. House, M. Light, and I. Mani. 2000. A Sys Called Qanda. In E. Voorhees, editor, Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Spe- cial Publication. In press.", "links": null }, "BIBREF1": { "ref_id": "b1", "title": "SMART high precision: TREC 7", "authors": [ { "first": "C", "middle": [], "last": "Buckley", "suffix": "" }, { "first": "M", "middle": [], "last": "Mitra", "suffix": "" }, { "first": "J", "middle": [], "last": "Walz", "suffix": "" }, { "first": "C", "middle": [], "last": "Cardie", "suffix": "" } ], "year": 1998, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "C. Buckley, M. Mitra, J. Walz, and C. Cardie. 1998a. SMART high precision: TREC 7. In", "links": null }, "BIBREF2": { "ref_id": "b2", "title": "Proceedings of the Seventh Text REtrieval Conference TREC 7", "authors": [], "year": null, "venue": "", "volume": "", "issue": "", "pages": "500--242", "other_ids": {}, "num": null, "urls": [], "raw_text": "E. Voorhees, editor, Proceedings of the Seventh Text REtrieval Conference TREC 7, pages 285- 298. NIST Special Publication 500-242.", "links": null }, "BIBREF3": { "ref_id": "b3", "title": "Using clustering and superconcepts within SMART : TREC 6", "authors": [ { "first": "C", "middle": [], "last": "Buckley", "suffix": "" }, { "first": "M", "middle": [], "last": "Mitra", "suffix": "" }, { "first": "J", "middle": [], "last": "Walz", "suffix": "" }, { "first": "C", "middle": [], "last": "Cardie", "suffix": "" } ], "year": 1998, "venue": "Proceedings of the Sixth Text REtrieval Conference TREC 6", "volume": "", "issue": "", "pages": "500--240", "other_ids": {}, "num": null, "urls": [], "raw_text": "C. Buckley, M. Mitra, J. Walz, and C. Cardie. 1998b. Using clustering and superconcepts within SMART : TREC 6. In E. Voorhees, editor, Pro- ceedings of the Sixth Text REtrieval Conference TREC 6, pages 107-124. NIST Special Publica- tion 500-240.", "links": null }, "BIBREF4": { "ref_id": "b4", "title": "The Smart/Empire TIPSTER IR System", "authors": [ { "first": "C", "middle": [], "last": "Buckley", "suffix": "" }, { "first": "C", "middle": [], "last": "Cardie", "suffix": "" }, { "first": "S", "middle": [], "last": "Mardis", "suffix": "" }, { "first": "M", "middle": [], "last": "Mitra", "suffix": "" }, { "first": "D", "middle": [], "last": "Pierce", "suffix": "" }, { "first": "K", "middle": [], "last": "Wagstaff", "suffix": "" }, { "first": "J", "middle": [], "last": "Walz", "suffix": "" } ], "year": 1999, "venue": "Proceedings, TIPSTER Text Program (Phase III). Morgan Kauhnann", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "C. Buckley, C. Cardie, S. Mardis, M. Mitra, D. Pierce, K. Wagstaff, and J. Walz. 1999. The Smart/Empire TIPSTER IR System. In Proceed- ings, TIPSTER Text Program (Phase III). Mor- gan Kauhnann. To appear.", "links": null }, "BIBREF5": { "ref_id": "b5", "title": "Massive Query Expansion /or Relevance Feedback", "authors": [ { "first": "Chris", "middle": [], "last": "Buckley", "suffix": "" } ], "year": 1995, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Chris Buckley. 1995. Massive Query Expansion /or Relevance Feedback. Cornell University, Ph.D. Thesis, Ithaca, New York.", "links": null }, "BIBREF6": { "ref_id": "b6", "title": "Knowledge-Based Information Retrieval from Semi-Structured Text", "authors": [ { "first": "R", "middle": [], "last": "Burke", "suffix": "" }, { "first": "K", "middle": [], "last": "Hammond", "suffix": "" }, { "first": "J", "middle": [], "last": "Kozlovsky", "suffix": "" } ], "year": 1995, "venue": "Working Notes of the AAAI Fall Symposium on AI Applications in Knowledge Navigation and Retrieval", "volume": "", "issue": "", "pages": "19--24", "other_ids": {}, "num": null, "urls": [], "raw_text": "R. Burke, K. Hammond, and J. Kozlovsky. 1995. Knowledge-Based Information Retrieval from Semi-Structured Text. In Working Notes of the AAAI Fall Symposium on AI Applications in Knowledge Navigation and Retrieval, pages 19-24. AAAI Press.", "links": null }, "BIBREF7": { "ref_id": "b7", "title": "question answering from Frequently-Asked Question Files", "authors": [ { "first": "K", "middle": [], "last": "Burke", "suffix": "" }, { "first": "V", "middle": [], "last": "Hammond", "suffix": "" }, { "first": "S", "middle": [], "last": "Kulyukin", "suffix": "" }, { "first": "N", "middle": [], "last": "Lytihen", "suffix": "" }, { "first": "S", "middle": [], "last": "Tomuro", "suffix": "" }, { "first": "", "middle": [], "last": "Schoenberg", "suffix": "" } ], "year": 1997, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Burke, K. Hammond, V. Kulyukin, S. Lyti- hen, N. Tomuro, and S. Schoenberg. 1997. ques- tion answering from Frequently-Asked Question Files. Technical Report TR-97-05, University of Chicago.", "links": null }, "BIBREF8": { "ref_id": "b8", "title": "Error-Driven Pruning of Treebank Grammars for Base Noun Phrase Identification", "authors": [ { "first": "C", "middle": [], "last": "Cardie", "suffix": "" }, { "first": "D", "middle": [], "last": "Pierce", "suffix": "" } ], "year": 1998, "venue": "Proceedings of the 36th Annual Meeting of the Association .for Computational Linguistics and COLING-98", "volume": "", "issue": "", "pages": "218--224", "other_ids": {}, "num": null, "urls": [], "raw_text": "C. Cardie and D. Pierce. 1998. Error-Driven Prun- ing of Treebank Grammars for Base Noun Phrase Identification. In Proceedings of the 36th An- nual Meeting of the Association .for Computa- tional Linguistics and COLING-98, pages 218- 224, University of Montreal, Montreal, Canada. Association for Computational Linguistics.", "links": null }, "BIBREF9": { "ref_id": "b9", "title": "Query-Biased Text Summarization as a Question-Answering Technique", "authors": [ { "first": "Y", "middle": [], "last": "Chali", "suffix": "" }, { "first": "S", "middle": [], "last": "Matwin", "suffix": "" }, { "first": "S", "middle": [], "last": "Szpakowicz", "suffix": "" } ], "year": 1999, "venue": "Proceedings o.f the AAAI Fall Symposium on Question Answering Systems", "volume": "", "issue": "", "pages": "52--56", "other_ids": {}, "num": null, "urls": [], "raw_text": "Y. Chali, S. Matwin, and S. Szpakowicz. 1999. Query-Biased Text Summarization as a Question- Answering Technique. In Proceedings o.f the AAAI Fall Symposium on Question Answering Systems, pages 52-56. AAAI Press. AAAI TR FS-99-02.", "links": null }, "BIBREF10": { "ref_id": "b10", "title": "WordNet: An Electronical Lexiced Database", "authors": [ { "first": "C", "middle": [], "last": "Fellbaum", "suffix": "" } ], "year": 1998, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "C. Fellbaum. 1998. WordNet: An Electronical Lex- iced Database. MIT Press, Cambridge, MA.", "links": null }, "BIBREF11": { "ref_id": "b11", "title": "MURAX: A Robust Linguistic approach For Question Answering Using An On-Line Encyclopedia", "authors": [ { "first": "J", "middle": [], "last": "Kupiec", "suffix": "" } ], "year": 1993, "venue": "Proceedings of A CM SI-GIR", "volume": "", "issue": "", "pages": "181--190", "other_ids": {}, "num": null, "urls": [], "raw_text": "J. Kupiec. 1993. MURAX: A Robust Linguistic ap- proach For Question Answering Using An On- Line Encyclopedia. In Proceedings of A CM SI- GIR, pages 181-190.", "links": null }, "BIBREF12": { "ref_id": "b12", "title": "The Process o/ Question Answering", "authors": [ { "first": "W", "middle": [], "last": "Lehnert", "suffix": "" } ], "year": 1978, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "W. Lehnert. 1978. The Process o/ Question Answer- ing. Lawrence Erlbaum Associates, Hillsdale, NJ.", "links": null }, "BIBREF13": { "ref_id": "b13", "title": "The TIPSTER SUMMAC Text Summarization Evaluation", "authors": [ { "first": "T", "middle": [], "last": "Mani", "suffix": "" }, { "first": "D", "middle": [], "last": "Firmin", "suffix": "" }, { "first": "G", "middle": [], "last": "House", "suffix": "" }, { "first": "B", "middle": [], "last": "Klein", "suffix": "" }, { "first": "L", "middle": [], "last": "Sundheim", "suffix": "" }, { "first": "", "middle": [], "last": "Hirschman", "suffix": "" } ], "year": 1999, "venue": "Ninth Annual Meeting o.f the EACL", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Mani, T. Firmin, D. House, G. Klein, B. Sund- heim, and L. Hirschman. 1999. The TIPSTER SUMMAC Text Summarization Evaluation. In Ninth Annual Meeting o.f the EACL, University of Bergen, Bergen, Norway.", "links": null }, "BIBREF14": { "ref_id": "b14", "title": "Building a Large Annotated Corpus of English: The Penn Treebank", "authors": [ { "first": "M", "middle": [], "last": "Marcus", "suffix": "" }, { "first": "M", "middle": [], "last": "Marcinkiewicz", "suffix": "" }, { "first": "B", "middle": [], "last": "Santorini", "suffix": "" } ], "year": 1993, "venue": "Computational Linguistics", "volume": "19", "issue": "2", "pages": "313--330", "other_ids": {}, "num": null, "urls": [], "raw_text": "M. Marcus, M. Marcinkiewicz, and B. Santorini. 1993. Building a Large Annotated Corpus of En- glish: The Penn Treebank. Computational Lin- guistics, 19(2):313-330.", "links": null }, "BIBREF15": { "ref_id": "b15", "title": "WordNet: an on-line lexical database", "authors": [ { "first": "G", "middle": [ "A" ], "last": "Miller", "suffix": "" }, { "first": "R", "middle": [], "last": "Beckwith", "suffix": "" }, { "first": "C", "middle": [], "last": "Feubaum", "suffix": "" }, { "first": "D", "middle": [], "last": "Gross", "suffix": "" }, { "first": "K", "middle": [ "J" ], "last": "Miller", "suffix": "" } ], "year": 1990, "venue": "International Journal of Lexicography", "volume": "3", "issue": "4", "pages": "235--245", "other_ids": {}, "num": null, "urls": [], "raw_text": "G. A. Miller, R. Beckwith, C. FeUbaum, D. Gross, and K. J. Miller. 1990. WordNet: an on-line lex- ical database. International Journal of Lexicogra- phy, 3(4):235-245.", "links": null }, "BIBREF16": { "ref_id": "b16", "title": "LASSO: A Tool for Surfing the Answer Net", "authors": [ { "first": "D", "middle": [], "last": "Moldovan", "suffix": "" }, { "first": "S", "middle": [], "last": "Harabagiu", "suffix": "" }, { "first": "M", "middle": [], "last": "Pa~ca", "suffix": "" }, { "first": "R", "middle": [], "last": "Mihalcea", "suffix": "" }, { "first": "R", "middle": [], "last": "Goodrum", "suffix": "" }, { "first": "R", "middle": [], "last": "Girju", "suffix": "" }, { "first": "V", "middle": [], "last": "Rus", "suffix": "" } ], "year": 2000, "venue": "Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "D. Moldovan, S. Harabagiu, M. Pa~ca, R. Mihal- cea, R. Goodrum, R. Girju, and V. Rus. 2000. LASSO: A Tool for Surfing the Answer Net. In E. Voorhees, editor, Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Spe- cial Publication. In press.", "links": null }, "BIBREF17": { "ref_id": "b17", "title": "Using Coreference to Improve Passage Retrieval for Question Answering", "authors": [ { "first": "T", "middle": [ "S" ], "last": "Morton", "suffix": "" } ], "year": 1999, "venue": "Proceedings of the AAAI Fall Symposium on Question Answering Systems", "volume": "", "issue": "", "pages": "72--74", "other_ids": {}, "num": null, "urls": [], "raw_text": "T. S. Morton. 1999. Using Coreference to Im- prove Passage Retrieval for Question Answering. In Proceedings of the AAAI Fall Symposium on Question Answering Systems, pages 72-74. AAAI Press. AAAI TR FS-99-02.", "links": null }, "BIBREF18": { "ref_id": "b18", "title": "TREC-8 Experiments at Maryland: CLIR, QA and Routing", "authors": [ { "first": "D", "middle": [ "W" ], "last": "Oard", "suffix": "" }, { "first": "J", "middle": [], "last": "Wang", "suffix": "" }, { "first": "D", "middle": [], "last": "Lin", "suffix": "" }, { "first": "I", "middle": [], "last": "Soboroff", "suffix": "" } ], "year": 2000, "venue": "Proceedings o.f the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "D. W. Oard, J. Wang, D. Lin, and I. Soboroff. 2000. TREC-8 Experiments at Maryland: CLIR, QA and Routing. In E. Voorhees, editor, Proceedings o.f the Eighth Text REtrieval Conference TREC 8. NIST Special Publication. In press.", "links": null }, "BIBREF19": { "ref_id": "b19", "title": "The Use of Predictive Annotation for Question Answering in TRECS", "authors": [ { "first": "J", "middle": [], "last": "Prager", "suffix": "" }, { "first": "D", "middle": [], "last": "Radev", "suffix": "" }, { "first": "E", "middle": [], "last": "Brown", "suffix": "" }, { "first": "A", "middle": [], "last": "Coden", "suffix": "" }, { "first": "V", "middle": [], "last": "Samn", "suffix": "" } ], "year": 2000, "venue": "Proceedings o/ the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "J. Prager, D. Radev, E. Brown, A. Coden, and V. Samn. 2000. The Use of Predictive Anno- tation for Question Answering in TRECS. In E. Voorhees, editor, Proceedings o/ the Eighth Text REtrieval Conference TREC 8. NIST Spe- cial Publication. In press.", "links": null }, "BIBREF20": { "ref_id": "b20", "title": "A vector space model for information retrieval", "authors": [ { "first": "G", "middle": [], "last": "Salton", "suffix": "" }, { "first": "A", "middle": [], "last": "Wong", "suffix": "" }, { "first": "C", "middle": [ "S" ], "last": "Yang", "suffix": "" } ], "year": 1975, "venue": "Communications o/the ACM", "volume": "18", "issue": "", "pages": "613--620", "other_ids": {}, "num": null, "urls": [], "raw_text": "G. Salton, A. Wong, and C.S. Yang. 1975. A vector space model for information retrieval. Communi- cations o/the ACM, 18(11):613-620.", "links": null }, "BIBREF21": { "ref_id": "b21", "title": "Automatic analysis, theme generation and summarization of machine-readable texts", "authors": [ { "first": "G", "middle": [], "last": "Salton", "suffix": "" }, { "first": "J", "middle": [], "last": "Allan", "suffix": "" }, { "first": "C", "middle": [], "last": "Buckley", "suffix": "" }, { "first": "M", "middle": [], "last": "Mitra", "suffix": "" } ], "year": 1994, "venue": "Science", "volume": "264", "issue": "", "pages": "1421--1426", "other_ids": {}, "num": null, "urls": [], "raw_text": "G. Salton, J. Allan, C. Buckley, and M. Mitra. 1994. Automatic analysis, theme generation and sum- marization of machine-readable texts. Science, 264:1421-1426, June.", "links": null }, "BIBREF22": { "ref_id": "b22", "title": "The SMART Retrieval System--Experiments in Automatic Document Processing", "authors": [], "year": 1971, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Gerard Salton, editor. 1971. The SMART Re- trieval System--Experiments in Automatic Doc- ument Processing. Prentice Hall Inc., Englewood Cliffs, NJ.", "links": null }, "BIBREF23": { "ref_id": "b23", "title": "Scripts, plans, goals, and understanding", "authors": [ { "first": "R", "middle": [ "C" ], "last": "Schank", "suffix": "" }, { "first": "R", "middle": [ "P" ], "last": "Abelson", "suffix": "" } ], "year": 1977, "venue": "Lawrence Erlbantu Associates", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "R. C. Schank and R. P. Abelson. 1977. Scripts, plans, goals, and understanding. Lawrence Erl- bantu Associates, Hillsdale, NJ.", "links": null }, "BIBREF24": { "ref_id": "b24", "title": "Pivoted document length normalization", "authors": [ { "first": "Amit", "middle": [], "last": "Singhal", "suffix": "" }, { "first": "Chris", "middle": [], "last": "Buckley", "suffix": "" }, { "first": "Mandar", "middle": [], "last": "Mitra", "suffix": "" } ], "year": 1996, "venue": "Proceedings o/the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval", "volume": "", "issue": "", "pages": "21--29", "other_ids": {}, "num": null, "urls": [], "raw_text": "Amit Singhal, Chris Buckley, and Mandar Mitra. 1996. Pivoted document length normalization. In H. Frei, D. Harman, P. Schauble, and R. Wilkin- son, editors, Proceedings o/the Nineteenth An- nual International ACM SIGIR Conference on Research and Development in Information Re- trieval, pages 21-29. Association for Computing Machinery.", "links": null }, "BIBREF25": { "ref_id": "b25", "title": "AT&T at TREC-8", "authors": [ { "first": "A", "middle": [], "last": "Singhal", "suffix": "" }, { "first": "S", "middle": [], "last": "Abney", "suffix": "" }, { "first": "M", "middle": [], "last": "Bacchiani", "suffix": "" }, { "first": "M", "middle": [], "last": "Collins", "suffix": "" }, { "first": "D", "middle": [], "last": "Hindle", "suffix": "" }, { "first": "F", "middle": [], "last": "Pereira", "suffix": "" } ], "year": 2000, "venue": "Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "A. Singhal, S. Abney, M. Bacchiani, M. Collins, D. Hindle, and F. Pereira. 2000. AT&T at TREC- 8. In E. Voorhees, editor, Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Special Publication. In press.", "links": null }, "BIBREF26": { "ref_id": "b26", "title": "Question Answering Supported by Information Extraction", "authors": [ { "first": "R", "middle": [], "last": "Srihari", "suffix": "" }, { "first": "W", "middle": [], "last": "Li", "suffix": "" } ], "year": 2000, "venue": "Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Special Publication", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "R. Srihari and W. Li. 2000. Question Answer- ing Supported by Information Extraction. In E. Voorhees, editor, Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST Spe- cial Publication. In press.", "links": null }, "BIBREF27": { "ref_id": "b27", "title": "Proceedings of the Eighth Text REtrieval Conference TREC 8. NIST. In press", "authors": [], "year": null, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "TREC-8. 2000. Proceedings of the Eighth Text RE- trieval Conference TREC 8. NIST. In press.", "links": null } }, "ref_entries": { "FIGREF0": { "type_str": "figure", "num": null, "text": "General Architecture of the Question-Answering System", "uris": null } } } }