<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1"/><title>Learning How to Answer Questions Using Trivia Games</title><author surname="Mann" givenname="Gideon S."><org  name="Johns Hopkins University" country="USA" city="Baltimore"/></author></firstpageheader><frontmatter><p>Learning How to Answer Questions Using Trivia Games</p><p>Gideon S. Mann</p><p>Department of Computer Science Johns Hopkins University Baltimore, Maryland 21218 gsm@cs.jhu.edu</p></frontmatter><abstract>In this paper we examine a sentence comprehen­sion task: given a question, and an extended sen­tence known to answer that question, the goal is to extract the short answer to the question. As an initial solution, a novel robust statistical model is presented which combines the semantics of the expected answer with the expected context within which the answer will be found. Two distinct trivia game databases, with no additional annotation, are used to train and test the model. </abstract></header><body><section number="1" title="Introduction"><p>Recent work in automated question answering has suggested that extracting precise short answers is more difficult than extracting full sentence or pas­sage length ones.<footnote anchor="1"/> Also, retrieving answers from smaller document spaces may be more difficult than retrieving answers from larger ones, if the smaller spaces have less redundant coverage of potential an­swers.<footnote anchor="2"/> This paper examines the problem of extract­ing short answers from a single sentence, where there is virtually no redundancy. The focus on word-level analysis of a single sentence may uncover aspects of semantics which have heretofore been masked in sentence granularity answers.</p><p>To approach this sentence comprehension task, we introduce a novel robust statistical model. One of the barriers to building statistical models for ques­tion answering has been the lack of suitable training data, and the cost associated with annotating data when available (Ittycheriah et al., 2001). Here we ex­plore the use of raw, unannotated "found" data from the Web and present the first system that exploits whole sentence explanations in training a short an­swer extraction model.<footnote anchor="3"/> An example of these data is shown in Figure 1.</p><footnote label="1">In the TREC-8 (1999) conference, performance on the 50-byte track was 10%-20% lower than performance on the 250-byte track for systems tested on both.</footnote><footnote label="2">Light et al. (2001) shows that the TREC corpus has more potential answers per question than the CBC reading comprehension task, and that the prescence of more potential answers leads to higher average system performance.</footnote><footnote label="3">Berger et al. (2000) uses explanations for modeling whole sentence retrieval.</footnote><p>The model we propose integrates information from two different sources: semantic class preferences (re­strictions on the type of answer expected, e.g. a person or a plant) and answer context (words likely to appear near the answer). Answer context is ex­ploited using a new local alignment method. After training, the complete model achieves 70% match accuracy on one dataset, and 59% on another.</p><p>Class Preference       Answer Context</p><p>Question : Who      'invented <b><i>'eyeglasses?</i></b></p><p>Explanation : Marco Polo reported seeing many pairs of <b><i>eyeglasses</i></b> worn by the Chinese as early as 1275, 500 years before lens grinding became an art in the West.</p><p>Answer : The Chinese (not Marco Polo or the West)</p><p>Figure 1: TS Trivia Database Entry #42764. Both class preference and context must be used to extract the correct answer.</p></section><section number="2" title="Trivia Games as Training Data"><p>A practical problem in developing a statistical model for question answering is the lack of training data. We explore the use of unmodified, unannotated trivia games as data, as suggested in (Mann, 2001).</p><p>With the increasing mass appeal of the Web, trivia games are becoming big business. The general pub­lic submits questions, and trivia game companies award prizes to those who correctly answer the most questions, and in the process profit from advertising. Some trivia databases are quite large, containing up to two hundred thousand entries (Ford, 1999).</p><p>In this paper we use two trivia databases as main resources: "Phishy" - PH (MacDonald, 1998) and "TriviaSpot" - TS (Trivia Machine Inc., 1999). PH has approximately 5,000 questions, each with the correct answer. TS is larger (more than 50,000 ques­tions), but only a small part (11,000 questions) was made available for this research. Each TS database entry, along with the correct answer, includes three wrong answers and in many cases an explanation. The explanations in TS vary in content. Some are justifications for the answer as in Figure 1. Others provide additional information (e.g. <i>"Leonardo Da Vinci outlined the idea of contact lenses in 1508") </i>or refute wrong answers (e.g. <i>"Franklin wore glasses, but didn't invent them").</i><page local="2"/><i> </i>Both of these databases contain questions and answers written by many dif­ferent people, and there is no guarantee that the answers to the questions are correct.</p><p>Trivia games like these are an appealing source of data for those interested in question answering. First, they cover a wide domain of knowledge and are grammatically complex. Second, the questions typically ask for simple facts whose answer is often only a word or two, which is similar to other question answering tasks. Finally, trivia databases encode a tremendous amount of semi-structured information. In this paper we extract two types of knowledge from this heterogeneous database: class preference for se­mantic tags, and mixture parameters for our final model. These databases doubtlessly contain addi­tional information.</p><p>While the TS database contains explanations, the PH database does not. To generate explanations for the PH questions, we searched the Web using the Google search engine with both the question words and the short answer as the query terms. We re­trieved the top 100 ranked pages for each query and segmented the sentences automatically. From those sentences, we selected as explanations the sentences which had both the highest word overlap with the question and contained a word in the short answer.</p><p>As a result of this search procedure, we collected nearly 22,000 explanations for approximately 3,000 questions. Of course, the explanations were quite noisy. Some, though they included the short answer terms, did not have enough information to conclude that the short answer in fact answered the question. Many explanations were ungrammatical or odd mix­tures of sentence fragments and spurious punctua­tion. Since the explanations were collected automat­ically, in some cases we found multiple explanations for the same question. For evaluation purposes, a sample of 1,000 sentences were randomly selected from each corpus.</p></section><section number="3" title="Using and Detecting Class Preferences in the Question"><p>Many questions give a clear class preference on the types of answers they expect. For example, the question <i>"The Star of Africa is what type of gem?' </i>strongly prefers the answer to be a gem. Intuitively, class preferences can be described as words in the question which are somewhat unlikely to appear in the answer sentence, and instead serve to restrict the types of entities suitable as answers. Sometimes, these preferences can be found in the WH phrase it­self (e.g. "Who", "Where", "What type of fruit"). In other questions, more useful preferences can be found in different locations. For example in <i>"What is the profession of James Herriot", </i>profession is the class preference.</p><p>Class preferences fall into two broad categories: preferences for proper nouns and for common nouns. Proper nouns exhibit great plasticity in use, some­times even ranging over lexical elements which are primarily function words (e.g. the rock band "The The"). In contrast, common noun classes, while open to novel constructions, are much more static. One example of a common noun class preference is for color names, which are dominated by a static fixed set, with rare additions in popular usage (e.g. "teal").</p><p>Since these two classes of preferences exhibit such different characteristics, different types of processes may be used to deal with both. In order to detect proper nouns, a dynamic algorithm which tags to­kens according to a set of contextual and intra-word features (Brecket al., 1999; Cucerzan and Yarowsky, 1999) must be used. For common nouns, a large, static hand-crafted knowledge base is more appro­priate. The next two sections describe methods to handle both types of categories.</p><subsection number="3.1" title="A Mutual Information (MI) Model for Proper Nouns"><p>The main focus of work in question answering has been on identifying answers which are proper nouns, where most methods predict likely semantic tags from WH heads or phrases (Prager et al., 1999). In these schemes a "Who" question would predict "People" and perhaps "Organizations". Typically these correspondences have been manually identi­fied. Mann (2001) presents the following method for learning these correspondences using unannotated training data which results in a more flexible and effective match module.</p><p>Formally, given a question <i>q </i>with a unique WH head c, and an explanation <i>E </i>which is a set of words <i>w, </i>where each word <i>w </i>has a distribution over seman­tic tags <i>st, </i>the model picks = argmax<page local="3"/></p><doubt alpha="62.5" length="16" tooSmall="False" monospace="0.0">w= argmaxI(q; w)</doubt><doubt alpha="60.0" length="15" tooSmall="False" monospace="0.0">« argmax J(c;w)</doubt><doubt alpha="50.0" length="6" tooSmall="False" monospace="0.0">P(w\c)</doubt><doubt alpha="57.1" length="14" tooSmall="False" monospace="0.0">P(w\st)P{st\c)</doubt><doubt alpha="60.0" length="15" tooSmall="False" monospace="0.0">EP(st\w)P(st\c)</doubt><doubt alpha="62.5" length="24" tooSmall="False" monospace="0.0">= argmax^PP(si|w)I(c;st)</doubt><doubt alpha="0.0" length="3" tooSmall="False" monospace="0.0">(1)</doubt><p>Table 1: Tags having high Mutual Information with Who, I(who ; <i>st), </i>as estimated from the Phishy (PH) trivia database</p><p>This derivation shows that we can approximate the Mutual Information between a question and a word, <i>I(q;w), </i>assuming the independence of the question class and answer given the semantic tag, using the probabilities in (1). To train the model, we need to estimate <b><i>I(c;st) - </i></b>how much a class prefers a se­mantic tag. Table 1 gives an example of the type of information learned by the MI model.</p><p>The above probabilities can be estimated using a trivia database that contains a large number of questions and answers. The method follows:</p><p>• For each question, identify the question class.</p><p>• Apply a semantic tagger<footnote anchor="4"/> to the trivia database to generate <b><i>P(st\w). </i></b>Thereby, a distribution over possible semantic tags for each word is es­timated.</p><p>• Estimate:</p><doubt alpha="45.8" length="24" tooSmall="False" monospace="0.0">P(st\c) =^2P(st\w)P(w\c)</doubt><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">w</doubt></subsection><subsection number="3.2" title="Ontological and Exact Match Models for Common Nouns"><p>This section deals with common noun class prefer­ences, where static knowledge bases can be used. Common noun class preferences are detected in two ways. First, the WH phrase is scanned. The ques­tion <i>"On what <u>street</u> is the Bank of England lo­cated?" </i>has a class restriction embedded in the WH phrase itself.<footnote anchor="5"/> If no class preference has been found directly within the WH phrase, and the question uses a copular construction (e.g. "What is..."), the head of the first NP is used as a class preference. In the question, <i>"What is the <u>color</u> of sapphires?", </i>color would be appropriately identified as a class prefer­ence.</p><footnote label="4">In our experiments we used Phrag (Breck et al., 1999), a Named Entity tagger.</footnote><footnote label="5">The WH head and "type of" and "kind of" phrases are excluded as potential common noun class preference indica­tors.</footnote><p>These class preferences are used in two ways. First, noun phrases which include the word verbatim are chosen. Thus, "Threadneedle Street" would be detected as an answer to the first question in Section 3.2. Second, the sentence is scanned for any words which are children of the class in the Wordnet on­tology (Miller, 1990). For example, "blue" would be detected as a type of color in response to the second question above.</p></subsection><subsection number="3.3" title="Improving WH Phrase Segmentation"><p>Segmenting the WH phrase and parsing the question correctly are key prerequisites for determining and using class preference information. Collins (1999) has demonstrated high performance on parsing plain English sentences and is an obvious choice for pars­ing questions. However, the Collins parser trained on the Penn Treebank does not provide high-quality WH phrase segmentation. Figure 2 shows a typical WH phrase segmentation error, where there is no node which subsumes only the WH phrase. Since the recovered WH phrases are incomplete, the WH phrases can be said to be fragmented. The mis-parses are caused by the paucity of questions in the Penn Treebank and the simplicity in form of the ones that do exist. In particular, there are no instances of a WH phrase parsed as (WHNP (WDT NP)).<footnote anchor="6"/>This dearth of variety severely limits the ability of a parser trained only on the Treebank parser to find correct question parses.</p><p>In order to correct for this problem and to clean up the parses (to make their structure easier to in­terpret), 300 questions typed by users into an on­line information retrieval engine were collected<footnote anchor="7"/> and hand-parsed for use as training data. These ques­tions were randomly selected in equal proportions from these categories:</p><p>• 'What' : What kinds of jobs can you get with different degrees?</p><p>• 'Which' : Which country borders Belize?</p><p>• 'In what' : In what years did "My Fair Lady" and West Side Story" open on Broadway in NYC?</p><p>• 'In which' : In which countries do Habu snakes live?</p><footnote label="6">An example of this phrase would be (WHNP (WDT which) (NP (JJ major) (NN river))).</footnote><footnote label="7">The questions were collected by John Henderson, MITRE, 2001.</footnote><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Class</p></td><td class="cell"><p>Sem Tag</p></td><td class="cell"><p><b>I</b>(<b>who ; </b><i>st)</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Who</p></td><td class="cell"><p>Person</p></td><td class="cell"><p>6.166</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Location</p></td><td class="cell"><p>2.186</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Name</p></td><td class="cell"><p>1.174</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Organization</p></td><td class="cell"><p>1.333</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Country</p></td><td class="cell"><p>0.583</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Date</p></td><td class="cell"><p>0.402</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Time</p></td><td class="cell"><p>0.311</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Title</p></td><td class="cell"><p>0.210</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>City</p></td><td class="cell"><p>0.198</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Age</p></td><td class="cell"><p>0.180</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Volume</p></td><td class="cell"><p>0.130</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Noun Group</p></td><td class="cell"><p>0.021</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Other</p></td><td class="cell"><p>0.010</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Duration</p></td><td class="cell"><p>0.011</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Quantity</p></td><td class="cell"><p>0.039</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Length</p></td><td class="cell"><p>0.007</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="4"/><doubt alpha="53.5" length="101" tooSmall="False" monospace="0.0">(TOP(FRAG (IN In) (SBAR (WHNP (WDT which)) (S (NPB (NNP Sea))(VP (VBZ is) (NPB (NNP Cuba) (. ?)))))))</doubt><doubt alpha="54.8" length="104" tooSmall="False" monospace="0.0">(TOP (SINV(WHPP (IN In) (WHNP (WHNP (WDT which)) (NPB (NNP Sea))))(SQ (VBZ is) (NPB (NNP Cuba) (. ?)))))</doubt><figure caption="Figure 2: A mis-segmented question, and its corrected version"></figure><p>• Embedded 'what' :   Beethoven's Sixth Sym­phony is also known as what?</p><p>• 'What do' : What do the initials CNN stand for?</p><p>After annotating these extra questions and re­training the Collins parser on the annotated ques­tions and the Penn Treebank, the number of frag­mented WH phrases dropped from 100 to 18 for the PH data set, and from 183 to 70 for the TS set.</p></subsection><subsection number="3.4" title="Experiments"><p>We tested the performance of the ontological and ex­act match approaches on the two datasets by them­selves and in conjunction with the class/semantic tag model (Eq. 1). As a naive baseline, we present a system which chooses a word at random from within the sentence. The accuracy of the random system is evaluated as (#correct one word answers in the sen-tence)/(#total candidate answers). For all systems, we exclude words found in the question as well as stop words from candidate answers. In all of the experiments reported, a system is said to have an­swered a question correctly if the single word it re­trieved is in the set of words the system accepts as the answer.</p><p>Table 2 presents performance results for ques­tions in which common noun class preferences, either from ontological matches or exact matches, could be found. The performance of both methods shows a trend wherein the PH set has higher coverage (more common noun class preferences can be found) and higher accuracy, while TS has both smaller coverage and lower accuracy. This might be in part explained by biases in the different test sets. Despite the differ­ences, the ontological match accuracy is high (over 70%) on both test sets.</p><p>Table 3 shows the overall performance of the sys­tem, when the ontology and exact match compo­nents are used before the MI proper name model. The results demonstrate that adding the ontological model can greatly improve the performance of the whole system.</p></subsection></section><section number="4" title="Using Answer Context with a Local Alignment Method"><p>The methods described above have only used class-based approaches for finding potential answers in sentences. These methods ignore potential infor­mation from shared structure which might augment the performance. Prior methods for using structural information have relied on picking out information from parses (Hovy et al., 2001) or complex inference chains (Harabagiu et al., 2000) in order to extract the correct words from the sentence.</p><p>In this paper, we examine an 'informal semantics' approach, which is at the other end of the spectrum. Without building an intermediary semantic repre­sentation, we use matching structure directly to in­dicate which words are best matches.<footnote anchor="8"/> The model we developed first finds <b>anchors, </b>words that appear in both the question and explanation. Once anchors are found, for any given tuple (anchor <i>a,</i><i> </i>word <i>w,</i><i> </i>and WH head c), three features are use to determine the quality of the local alignment:</p><p><b>• de(w,</b>a), the distance in the explanation from <i>w </i>to <i>a: </i>Larger distance between the answer and</p><footnote label="8">One idea on how to use contextual information is to treat it as an alignment problem, which could be modeled in similar ways to statistical machine translation alignment (Brown et al., 1993). Initially, we looked at a whole sentence alignment model, using a Stochastic Inversion Transduction Grammar, SITG, (Wu, 1997) which aligned an entire question with an entire explanation. This approach had poor performance for several reasons. The lexical change from sentence to question is often quite elaborate, and taking it into account in a general way is quite difficult. On top of this, the SITG model has limitations in terms of the kinds of transpositions it allows. In particular, phrases like "X is Y" require two inversions to turn into "Y is X". What is needed is a grammar which handles these kinds of common phrasing alternations more effectively.</footnote><table caption="Table 2: Common Noun Class Preference Methods in Isolation" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p></p></td><td class="cell"><p>PH</p></td><td class="cell"><p>TS</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ontological match</p></td><td class="cell"><p>coverage accuracy</p></td><td class="cell"><p>35% 89%</p></td><td class="cell"><p>13% 71%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>exact match</p></td><td class="cell"><p>coverage accuracy</p></td><td class="cell"><p>10% 64%</p></td><td class="cell"><p>2% 35%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table caption="Table 3: Accuracy of Systems which only use Class Preferences" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>PH</p></td><td class="cell"><p>TS</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>random</p></td><td class="cell"><p>30%</p></td><td class="cell"><p>22%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>I</b>(c;st)</p></td><td class="cell"><p>51%</p></td><td class="cell"><p>52%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>+ exact match</p></td><td class="cell"><p>51%</p></td><td class="cell"><p>52%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>+ ontological match</p></td><td class="cell"><p><b>67%</b></p></td><td class="cell"><p><b>56%</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>+ both</p></td><td class="cell"><p>65%</p></td><td class="cell"><p>56%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="5"/><p>Figure 3: Features of the Local Alignment Model: (4.A) <i>de{w,a), </i>distance from the <u>| answer |</u> (boxed) to the anchor (4.B) <b><i>dq(c,a), </i></b>distance from the WH head to the anchor (4.C) <b><i>de(X,a) </i></b>ignores determiners <b>(4</b>.D) <b><i>r(w,c,a), </i></b>whether the WH head and the answer are on the same side of the anchor the anchor indicates a weaker relationship. Dis­tance is measured as the number of intervening content words.</p><p><b>• dq(c</b>,a), the distance in the question from c to <i>a: </i>The closer to the WH phrase an anchor is, the better it is for judging local alignment. Distance is measured as above.</p><p><b>• r(w, c, </b><i>a)</i>, whether <i>w </i>and c are on the same side of <i>a </i>: If they are on the same side, that sug­gests that the underlying semantic relationships in the two sentences are similar.</p><figure caption="Figure 3 illustrates the features of this model."></figure><p>In some cases, this local alignment method mim­ics what a more structured semantic representation would do, finding the head of the verb to which the answer is the object:</p><doubt alpha="40.0" length="25" tooSmall="False" monospace="0.0">dq(Who, wrote) = 0 , - -\</doubt><p>Who wrote Lord Jim r(Conrad, Who, wrote) = 0 ! Dorsai soldier ask not Joseph <u>| Conrad, W</u>ho wrote one of my all-time favorite books, Lord Jim</p><doubt alpha="66.7" length="21" tooSmall="False" monospace="0.0">deCConrad. wrote) = 1</doubt><p>In other instances, the aligned word corresponds to a relevant word in the question:</p><doubt alpha="61.9" length="21" tooSmall="False" monospace="0.0">dq(What. Spanish) = 3</doubt><p>What was the name of the spanish waiter in Fawlty Towers ?</p><doubt alpha="64.3" length="28" tooSmall="False" monospace="0.0">r(Manuel. What. Spanish) = 0</doubt><p><u>Manuel |</u>being the spanish waiter in the John Cleese comedy series Fawlty Towers.</p><doubt alpha="65.2" length="23" tooSmall="False" monospace="0.0">de(Manuel. Spanish) = 1</doubt><p>The alignment model is a robust method of ex­tracting semantic relationships from a sentence. A more structured representation, using the parse of the sentence for example, might be able to pro­vide the same information. However, a more struc­tured representation takes a performance penalty commensurate with the performance of the parser, requires overhead to write rules to extract informa­tion from the parse, and necessitates a more complex mixture with a statistical class model. Nevertheless, future work might explore the use of higher-level structural information.</p><subsection number="4.1" title="Creating a Unified Local Alignment Model"><p>The prior sections have described a set of features <i>(I(c;w),de(w,a),dq(c,a),r(w,c,a)) </i>which might help distinguish correct answers. In order for them to be used effectively, they have to be combined. In order to do this, we first model each feature as P(o( word) <b>I </b>feature), where <i>a</i><i>(w) </i>is a function which indicates whether <i>w </i>is in the short answer to the question. For example:</p><doubt alpha="41.2" length="17" tooSmall="False" monospace="0.0">P(a(w)\de(w,a)) =</doubt><doubt alpha="46.2" length="26" tooSmall="False" monospace="0.0">c(a(w), de(w,a))c(de(w,a))</doubt><p>where c is the number of times that feature ap­peared for each explanation/question pair, using any possible anchor. With these probabilities es­timated, we smooth the graph, and build a model from which we can then interpolate new values. We also enforce a decreasing monotonicity condi­tion, such that <i>P</i><i>(a(w)\fi) </i><b><i>&gt; P(a(w)</i></b><b>I</b>/2) iff <i>fi &lt; fi- </i>We do this for the two distance measures (dis­tance of the WH phrase from the anchor, and dis­tance of the answer candidate from the anchor) and for the class/semantic tag match statistic as well. <b><i>P(a(w)\r(w,c,a)) </i></b>can be calculated in a straight­forward manner, and requires no smoothing (since it has only two binary values). The probability es­timates derived from the two trivia databases are shown in Figure 4.</p><p>We use a mixture model to estimate the combined probability of a particular word being the answer. Formally, given an explanation e, and a question <i>q </i>with the WH head c, for any word <i>w </i>the model<page local="6"/></p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Question :    a    b   </b>WH <b>e </b>^J^^ g    <b>h i</b></p><p><b>Explanation : a           d    q     </b><b>me</b><b> </b><b>x</b><b> </b><b>f</b><b> cle(c.e)   3                       cle(q.e) 1</b></p><p><b>4.A</b></p></td><td class="cell"><p><b>dq</b>(WH<b>,a)   1             dq</b>(WH<b>,e) = </b>0 <b>Question :    a    b   </b>WH   <b>e           </b>g    <b>h i</b></p><p><b>Explanation </b><b>:ac</b><b> </b><b>dqme</b><b> </b><b>xf</b></p><p><b>4</b>.B</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Question:     a    b    </b>WH <b>e     </b>f     g    <b>h i</b></p><p><b>Explanation : a    c     d   </b>[jf] <b>the    e     x f</b></p><p><b><i>\ 4 </i></b><b>4.C                  cle(q.e) 0</b></p></td><td class="cell"><p>Question :     a     b   WH   e     f      g     h i</p><p>Explanation : a     c     d     q   <b>[m]   </b>e  ~ <b><i>Jx] </i></b>f</p><p>r(m,WH,e) = 0       ^ , . 4 <b><i>d                    </i></b>v <b><i>'        </i></b>r(x, WH,e) = 1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><figure caption="Figure 4: From left, estimation of:P(a(w)\I(c;w)),P(a(w)\de(w,a), P(a(w)\dq(c,a)).TS inbold."></figure><p>estimates its probability of being the answer as : <b><i>P(a(w)\c,q,e) </i></b>= max <b><i>P(a(w)\q,a,e)</i></b></p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">a</doubt><doubt alpha="50.0" length="22" tooSmall="False" monospace="0.0">= max[XiP(a(w)\I(c;w))</doubt><doubt alpha="35.6" length="59" tooSmall="False" monospace="0.0">+ \2P{a(w)\de(w,a))+ \3P(a(w)\dq(c,a))+ \4P(a(w)\r(c,w,a))]</doubt><p>We use one trivia database to train the mixture pa­rameters by exhaustively searching the space for the parameters which achieve the highest performance. We then take the optimal parameters and use them to test accuracy on the other trivia dataset.</p></subsection><subsection number="4.2" title="Undoing WH Phrase Movement"><p>Before attempting the local alignment, we pre-processes the questions to undo WH phrase move­ment. WH movement can be described through the following generative process: start with a sentence "More <i>likes Spot". </i>Next the desired NP phrase answer is turned into a WH phrase <i>("Marc likes what?'). </i>Finally, the missing WH phrase is moved to the beginning of the sentence (" <i>What does Marc like?') </i>and a tensed verb is added. This syntac­tic movement has been extensively studied in the linguistics and parsing communities. For example, Collins (1999) describes a method for discovering the trace of the "original" WH phrase position.</p><p>Clearly, WH movement is problematic for a sys­tem which uses local alignment, since the relative distances and locations within the questions do not match what they would be within the explanation. In order to compensate for these changes, we ex­plore a simple method for detecting and resolving common movement in questions. In particular, we use the following characteristics to detect when a WH move might have occurred :</p></subsection></section><section number="1." title="Trailing prepositions:"><p>What were George Washington's false teeth made of?</p></section><section number="2." title="Certain 'do' constructions:"><p>What did the Taft-Hartley Act of 1947 attempt to regulate?</p></section><section number="3." title="Initial prepositional phrases:"><p>In what field of study would you find flying buttresses?</p></section><section number="4." title="Simple Templates:"><p>What was Gary Numan's first album on the Beggars Banquet label called?</p></section><section number="5." title="Initial WH head adverbial phrases:"><p>How is Frederick Austerlitz better known?</p><p>Once a question has been detected as likely to have involved movement, the WH phrase is removed and placed at the end of the sentence. The end is not always the trace position, but in our test sets it was for an overwhelming number of questions. With our retrained WH segmenter and question parser (Sec­tion <b>3.3), </b>this method for unfolding WH-movement improves overall system performance.</p><subsection number="4.3" title="Experiments"><p>To test the local alignment model, we took the two sets of 1,000 sentences used for the class preference experiments and the class-preference models initially trained. We selected one of the databases as train­ing set and the other as test set. We estimated <b><i>P(a(w)\f) </i></b>for each of the features (the distance and MI features) on the training set, and optimized the mixture parameters on the training set. The optimal parameter values were:</p><p>With the optimized weights and trained <b><i>P(a(w)\f) </i></b>models, we tested the models on the other database. The results shown in Table <b>4 </b>demonstrate that the local alignment gives a consistent gain of <b>3-4% </b>for each of the test sets.</p><p>Table <b>4: </b>Accuracy Improvement from Contextual (Local Alignment) Method</p><p>Figure 5 shows the precision/recall trade-off for the final model, using the final output mixture prob­ability. The graphs illustrate that while there is a correlation between the estimated probability and the real probabilty of the answer being correct, there are still major deficiencies in the model. Perhaps part of the reason behind the disparity between the two graphs is that the explanations in TS were gen­erated in response to the questions while the expla­nations for PH were extracted from the world wide web, and hence very noisy.<page local="7"/></p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Ai</p></td><td class="cell"><p>A2</p></td><td class="cell"><p>A3</p></td><td class="cell"><p>A4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>I(c;w)</p></td><td class="cell"><p><i>de(w,a)</i></p></td><td class="cell"><p><b><i>dq(c, </i></b><i>a)</i></p></td><td class="cell"><p><i>r(w,c,a)</i></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PH</p></td><td class="cell"><p>0.1</p></td><td class="cell"><p>0.1</p></td><td class="cell"><p>0.75</p></td><td class="cell"><p>0.05</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TS</p></td><td class="cell"><p>0.15</p></td><td class="cell"><p>0.55</p></td><td class="cell"><p>0.1</p></td><td class="cell"><p>0.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Test Corpus</p></td><td class="cell"><p>Class only</p></td><td class="cell"><p>Class + Context</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>PH (c/st)</p></td><td class="cell"><p>51%</p></td><td class="cell"><p>55%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>(c/st + ontology)</p></td><td class="cell"><p>67%</p></td><td class="cell"><p><b>70%</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>TS (c/st)</p></td><td class="cell"><p>52%</p></td><td class="cell"><p>56%</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>(c/st + ontology)</p></td><td class="cell"><p>56%</p></td><td class="cell"><p><b>59%</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><figure caption="Figure 5: Precision/Recall (c/st onto) TS, PH"></figure></subsection></section><section number="5" title="Conclusions"><p>In this paper, we presented a novel robust statisti­cal model for a sentence comprehension task. The local alignment method presents a new robust way to match answer contexts from the question and the explanation. Combining the local alignment with a statistical model of class/semantic tag match model and an ontology match module, we were able to reach high levels of performance on this task (70% on the Phishy data and 59% on the TriviaSpot data).</p><p>Through the training of the mixture model for combining local alignment features and the class/semantic tag match, we demonstrated the value of explanations for statistical estimation of intra-sentential features. The use of explanations for training this model suggests that (question, ex­planation, answer) tuples may be useful in training future question answering systems.</p><p>In investigating this sentence comprehension problem, we took an informal semantics approach. This operational semantics may allow the system to see aspects of meaning which are lost in truth-functional semantics. In general, this sentence com­prehension task presents an opportunity for empir­ically testing semantic representations, without the overhead needed to complete the full information re­trieval task required in question answering (i.e. no document or sentence retrieval needed). Deficien­cies in the sentence comprehension module might be masked by a very effective document retrieval sys­tem, but exposed under this more constrained test.</p></section><references><p>A. Berger, R. Caruana, D. Cohn, D. Freitag, and V. Mittal. 2000. Bridging the lexical chasm : Sta­tistical approaches to answer-finding. <i>Proceedings of the 23rd Annual Conference on Research and Development in Information Retrieval (ACM SI-GIR), </i>pages 192-199.</p><p>E. Breck, J. Burger, L. Ferro, D. House, M. Light, and <b>I. </b>Manni. 1999. A Sys Called Qanda. <i>Pro­ceedings of the Eighth Text Retrieval Conference.</i></p><p>P.F. Brown, S.A. Delia Pietra, V.J. Delia Pietra, and R. Mercer. 1993. The Mathematics of Statistical Machine Translation. <i>Computational Linguistics, </i>19(2):263-311.</p><p>M.Collins. 1999. <i>Head-Driven Statistical Models for Natural Language Parsing. </i>Ph.D. thesis, Univer­sity of Pennsylvania.</p><p>S. Cucerzan and D. E. Yarowsky. 1999. Language Independent Named Entity Recognition Combin­ing Morphological and Contextual Evidence. In <i>Proceedings of the 1999 Joint SIGDAT Confer­ence on EMNLP and VLC, </i>pages 90-99.</p><p>G. MacDonald (ed). 1998. Phishy web trivia. www.phishy<i>. net/trivia.</i></p><p>T. Ford (ed). 1999. Fun trivia.com : the trivia por­tal, www.funtrivia<i>. com.</i></p><p>S. M. Harabagiu, M. A. Pasca, and S. J. Maio-rano. 2000. Experiments with Open-Domain tex­tual Question Answering. In <i>Proceedings of the Eighteenth International Conference on Compu­tational Linguistics (COLING 2000), </i>pages 292­298.</p><p>E. Hovy, U. Hermjakob, and C-Y. Lin. 2001. The Use of External Knowledge in Factoid QA. In <i>Pro­ceedings of the Tenth Text Retrieval Conference.</i></p><p>A. Ittycheriah, M. Franz, W-J. Zhu, and A. Rat-naparkhi. 2001. Question Answering Using Max­imum Entropy Components. <i>Proceedings of the Second Meeting of The North American Chapter of the Association of Computational Linguistics, </i>pages 33-39.</p><p>M. Light, G. S. Mann, E. Riloff, and E. Breck. (forthcoming). Analyses for elucidating current question answering technology. <i>Journal of Nat­ural Language Engineering.</i></p><p>G. S. Mann. 2001. A statistical method for short answer extraction. In <i>Workshop on Open-Domain Question Answering, </i>pages 23-30.</p><p>G. Miller. 1990. Wordnet: An On-line Lexical Database. <i>International Journal of Lexicography, </i>3(4):235-312.</p><p>J. Prager, D. Radev, E. Brown, A. Coden, and V. Samn. 1999. The Use of Predictive Annotation for Question Answering in TREC8. <i>Proceedings of the Ninth Text Retrieval Conference.</i></p><p>TREC-8 Proceedings. 1999. <i>Proceedings of the Eighth Text Retrieval Conference. </i>National Insti­tute of Standards and Technology, Special Publi­cation 500-246, Gaithersburg, MD.</p><p>TriviaMachine Inc. 1999. TriviaSpot.com. <i>www. triviaspot. com.</i></p><p>D. Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel cor­pora. <i>Computational Linguistics, </i>23(3):377-404.</p></references></body></article>