<?xml version="1.0" standalone="yes"?>
<Paper uid="J03-1006">
  <Title>c(c) 2003 Association for Computational Linguistics Squibs and Discussions Weighted Deductive Parsing and Knuth's Algorithm</Title>
  <Section position="6" start_page="142" end_page="142" type="concl">
    <SectionTitle>
6. Conclusions
</SectionTitle>
    <Paragraph position="0"> We have shown how a general weighted parser can be specified in two parts, the first being a weighted deduction system, and the second being Knuth's algorithm (or possibly Viterbi's algorithm, where applicable). Such modular specifications have clear theoretical and practical advantages over indivisible specifications. For example, we may identify common aspects of otherwise seemingly distinct types of parser. Furthermore, modular specifications allow simpler implementations. We have also identified close connections between our approach to specifying weighted parsers and well-established theory of grammars and parsing. How the efficiency of Knuth's algorithm relates to that of Viterbi's algorithm in a practical setting is still to be investigated.</Paragraph>
  </Section>
class="xml-element"></Paper>