<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-1016">
  <Title>Using Active Constraints to I)arse &amp;quot;&amp;quot;)~'(' ',.:, \[ ,~ k,,&lt;;</Title>
  <Section position="9" start_page="0" end_page="0" type="evalu">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> The ID/LP formalism distinguishes between internal and external knowledge about syntactic structures. This characteristic allows the expression of parsing mechanisms at a very high level of generality. We can represent the description of a phrase in an extremely concise way with a rule clustering operation. These properties allow the use of active constraints. The result is an implementation in agreement with the theoretical nmdel respecting in particularl the generality and conciseness properties of GPSG. Moreover, active constraints efficiently control the progress of the processes and limit non-determinism of parsing. This last characteristic is very important for the ID/LP formalism which uses non-ordered rules implying an increase of the search space.</Paragraph>
    <Paragraph position="1"> We have shown in this paper how to use active constraints for ID/LP formalism. We can apply the same approach to the entire GPSG theory interpreting features structures and instaneiation principles as formulas (cf \[Blache92\]).</Paragraph>
    <Paragraph position="2"> The implementation presented here has been done in Prolog III on a Macintosh. From a coverage point of view, we can indicate that the rules in the grammatical formalism presented in our example roughly amounts to twenty standard ID-rules.</Paragraph>
  </Section>
class="xml-element"></Paper>