<?xml version="1.0" standalone="yes"?>
<Paper uid="J96-3007">
  <Title>Technology A Probabilistic Recursive Transition Network is an elevated version of a Recursive Transition Network used to model and process context-free languages in stochastic parameters. We present</Title>
  <Section position="7" start_page="426" end_page="428" type="concl">
    <SectionTitle>
6. Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented an efficient re-estimation algorithm for a PRTN that made use of only valid Insides. The method requires the preparation of a chart by running Inside computation twice over a whole sentence. The suggested method focuses mainly on reducing the computational overhead of Outside computation, which is a major portion of a re-estimation. The computation of an Inside probability may be improved further using a similar technique introduced in this paper.</Paragraph>
    <Paragraph position="1">  Han and Choi A Chart Re-estimation Algorithm</Paragraph>
  </Section>
class="xml-element"></Paper>