<?xml version="1.0" standalone="yes"?>
<Paper uid="W05-1517">
  <Title>Efficient extraction of grammatical relations</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present a novel approach for applying the Inside-Outside Algorithm to a packed parse forest produced by a unification-based parser. The approach allows a node in the forest to be assigned multiple inside and outside probabilities, enabling a set of 'weighted GRs' to be computed directly from the forest. The approach improves on previous work which either loses efficiency by unpacking the parse forest before extracting weighted GRs, or places extra constraints on which nodes can be packed, leading to less compact forests.</Paragraph>
    <Paragraph position="1"> Our experiments demonstrate substantial increases in parser accuracy and throughput for weighted GR output.</Paragraph>
  </Section>
class="xml-element"></Paper>