<?xml version="1.0" standalone="yes"?>
<Paper uid="E99-1008">
  <Title>Range Concatenation Grammars</Title>
  <Section position="6" start_page="59" end_page="59" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> The class of RCGs is a syntactic formalism which seems very promising since it has many interesting properties among which we can quote its power, above that of LCFR systems; its efficiency, with polynomial time parsing; its modularity; and the fact that the output of its parsers can be viewed as shared parse forests. It can thus be used as is to define languages or it can be used as an intermediate (high-level) representation. This last possibility comes from the fact that many popular formalisms can be translated into equivalent RCGs, without loosing any efficiency. For example, TAGs can be translated into equivalent RCGs which can be parsed in O(n 6) time (see \[Boullier 985\]).</Paragraph>
    <Paragraph position="1"> In this paper, we have shown that this extra formal power can be used in NL processing. We turn our attention to the two phenomena of Chinese numbers and German scrambling which are both beyond the formal power of MCS formalisms. To our knowledge, Chinese numbers were only known to be an IL and it was not even known whether scrambling can be described by an IG. We have seen that these phenomena can both be defined by RCGs. Moreover, the corresponding parse time is polynomial with a very low degree. During this work we have also classified the famous MIX language, as a linear parse time RCL.</Paragraph>
  </Section>
class="xml-element"></Paper>