<?xml version="1.0" standalone="yes"?>
<Paper uid="C88-2167">
  <Title>An Efficient Execution Method for Rule-Based Machine Translation</Title>
  <Section position="3" start_page="828" end_page="828" type="concl">
    <SectionTitle>
6. Conclusion
</SectionTitle>
    <Paragraph position="0"> An efficient execution method for rule based machine translation systems has been developed. ~e essence of the met21od is as follows. Firs t, a grammar is pre-analyzed to determine an antecedent set for each rule. The ~tecedent set for a rule is a set of actions such that perfo~rPSing an action in it causes the possibility of the condition of the rule being satisfied, and the condition of the rule is unsatisfied if any action in it is not performed.</Paragraph>
    <Paragraph position="1"> At execution time, a rule is activated only when an action in Ule antecedent set for the rule is perfol~=ddeg qhe rule application is restricted to active rules. The probability of a rule being active is reduced to near the occurrence probability of its relevant linguistic phenomenon. Thus most pattern l,~tching of unfruitful rules is avoided.</Paragraph>
    <Paragraph position="2"> Acknowledgement: I would like to acknowledge Dr.</Paragraph>
    <Paragraph position="3"> Jun Kawasaki, Mr. Nobuyoshi Dc~en, Mr. Koichiro Ishihara and Dr. ~n Watanabe for their valuable advice and constant encouragement.</Paragraph>
  </Section>
class="xml-element"></Paper>