<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1005">
  <Title>STRUCTURAL DISAMBIGUATION WITH CONSTRAINT PROPAGATION</Title>
  <Section position="7" start_page="37" end_page="38" type="concl">
    <SectionTitle>
5 CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have proposed a formal grammar that allows efficient structural disambiguation. Grammar rules are constraints on word-to-word modifications, and parsing is done by adding the constraints to a data structure called a constraint network. The initial formation of a constraint network and the filtering have a polynomial time bound whereas the weak generative capacity of CDG is strictly greater than that of CFG.</Paragraph>
    <Paragraph position="1"> CDG is actually being used for an interactive Japanese parser of a Japanese-to-English machine translation system for a newspaper domain (Maruyama et. al. 1990). A parser for such a wide domain should make use of any kind of information available to the system, including user-supplied information. The parser treats this information as another set of unary constraints and applies it to the constraint network.</Paragraph>
  </Section>
class="xml-element"></Paper>