<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1102">
  <Title>Disambiguating Grammatically Ambiguous Sentences By Asking</Title>
  <Section position="6" start_page="478" end_page="479" type="ackno">
    <SectionTitle>
Acknowledgements
</SectionTitle>
    <Paragraph position="0"> I would like to thank Jaime Carbonell, Herb Simon, Martin Kay, Jun-ich Tsujii, Toyoaki Nishida, Shuji Doshita and Makoto Nagao for thoughtful comments on an earlier version of this paper.</Paragraph>
    <Paragraph position="1">  lists, {L1, L 2 .... }.</Paragraph>
    <Paragraph position="2"> The output of this procedure is a list of explanations, {e I, e 2 ..... en}, such that each explanation list, li, contains exactly one explanation which is in the Qlist. * An explanation list L is called covered, if some explanation e in L is also in Qlist. L is called uncovered, if any of the explanations in L is not in Olist. C is a set of covered explanation lists in A, and U is a set of uncovered explanation lists in A.</Paragraph>
    <Paragraph position="3"> * 1-3: initialization, let Olisl be empty. All explanation lists in A are uncovered.</Paragraph>
    <Paragraph position="4"> * 4: if all explanation lists are covered, quit.</Paragraph>
    <Paragraph position="5"> * 5-6: select an explanation e and put it into Qlist to cover some of uncovered not explanation lists, e must be such that it does 6xist in any of covered explanation lists (if it does exist, the explanation list has two explanation in A, violating the Qlist condition).</Paragraph>
  </Section>
class="xml-element"></Paper>