<?xml version="1.0" standalone="yes"?>
<Paper uid="P83-1021">
  <Title>PARSING AS DEDUCTION l</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Artificial Intelligence Center
SRI International
333 Ravenswood Ave., Menlo Park CA 04025
Abstract
</SectionTitle>
    <Paragraph position="0"> By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses.</Paragraph>
    <Paragraph position="1"> The efficiency of this approach for an interesting class of grammars is discussed.</Paragraph>
  </Section>
class="xml-element"></Paper>