<?xml version="1.0" standalone="yes"?>
<Paper uid="P81-1032">
  <Title>Dynamic Strategy Selection in Flexible Parsing</Title>
  <Section position="5" start_page="145" end_page="146" type="concl">
    <SectionTitle>
4. Conclusion
</SectionTitle>
    <Paragraph position="0"> To summarize, uniform i~mng procedures applied to uniform grammars are less than adeduate for paring ungrammatical inpuL As our experience with such an approach s~ows, the uniform methods are unable to take full advantage of domain knowledge, differing structurW roles (e.g,, case markers and. case fillers), and relative eese of identification among the various constituents in different types of  constrl, ctions. Instead, we advocate integrating a number of different parSing strategies tailored to each type of construction as dictated by the C/oplication domain. The parser should dynamically select parsing strategies according to what type of construction it expects in the course of the parse. We described a simple algorithm designed along these lines that makes dynamic choices between two parsing strategies, one designed for case constructions and the other for linear patterns. While this dynamic selection coproach was suggested by the needs of flexible parSing, it also seemed to give our trial implementation significant efficiency advantages over single-strategy approaches for grammatical input.</Paragraph>
  </Section>
class="xml-element"></Paper>