<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2161">
  <Title>Anytime Algorithms fl)r Speech Parsing?*</Title>
  <Section position="7" start_page="999" end_page="999" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> According to \[Russell and Zilberst, ein 1991\] parsing algorithms with feature unification have to be classified as contract algorithms as opposed to (truly) interruptible algorithms: They must be given a particular time allocation in advance, because interrupted at any time shorter than the contract time they will not yield useflll results. At least the transaction which is active at the time an interrupt occurs has to be completed before the interrupt can be executed. With this restriction, it is possible to provide a parser with linqited anytime behavior, which is in fact being realized in the current version of the Verbmobil/15 parser.</Paragraph>
    <Paragraph position="1"> Acknowledgements. The authors would like to thank Gerhard Kraetzschmar, Herbert Stoyan, and Hans Weber for w~luable comments on a previous ver.sion of this paper.</Paragraph>
  </Section>
class="xml-element"></Paper>