<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1005">
  <Title>STRUCTURAL DISAMBIGUATION WITH CONSTRAINT PROPAGATION</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on word-to-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees.</Paragraph>
    <Paragraph position="1"> The weak generative capacity and the computational complexity of CDG parsing are also discussed.</Paragraph>
  </Section>
class="xml-element"></Paper>