<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1057">
  <Title>Analysts Grammar or Japanese tn the Nu-ProJect - A Procedural Approach to Analysts Grammar -</Title>
  <Section position="7" start_page="273" end_page="273" type="concl">
    <SectionTitle>
5 Conclusions
</SectionTitle>
    <Paragraph position="0"> Analysts Grammar of Japanese tn the Mu-proJect ts discussed tn thts paper. By Integrating vartous levels of heuristic Information, the grammar can work very efficiently to produce the most natural and preferable readtn 9 as the f|rst output result.</Paragraph>
    <Paragraph position="1"> wtthout any extensive semanttc processtngs.</Paragraph>
    <Paragraph position="2"> The concept of procedural granwars was originally proposed by Wtnograd\[9\] and Independently persued by other research groups\[lO\]. However. thetr clatms have not been well appreciated by other researchers (or even by themselves). One often argues agatnst procedural grammars, saytng that: the linguistic facts Wtnograd's grammar captures can also be expressed by ATN. and the expressive power of ATN ts equivalent wtth that of the augmented CFG.</Paragraph>
    <Paragraph position="3"> Therefore; procedural grammars have no advantages over the augmented CFG. They Just make the whole grammars complicated and hard to maintain.</Paragraph>
    <Paragraph position="4"> The above argument, however, mtsses an Important po|nt and confuses procedural grammar wtth the representation of grammars tn the form of programs (as Shown tn Vtnograd\[9\]). Ve showed tn thts paper that: the rules whtch gtve structural constraints on ftnal analysts results and the rules whtch choose the most preferable linguistic structures (or the rules whtch block &amp;quot;garden path&amp;quot; structures) are different tn nature. \[n order to Integrate the latter type of rules tn a untfted analysts grammar, tt ts essential to control the sequence of rule applications explicitly and Introduce strategic knowledge tnto grammar organizations. Furthermore. Introduction of control specifications doesn't necessarily lead to the grammar In the form of programs. Our grammar wrtttng system GRADE allows us a rule based specification of grammar, and the grammar developed by ustng GRADE ts easy to maintain.</Paragraph>
    <Paragraph position="5"> Ve also dtscuss the usefulness of lexicon driven processing 4n treattng Idiosyncratic phenomena tn natural languages. Lax|con drtven prcesstng ts extremely useful tn the transfer phase of machtne translation systems, because the transfer of lextcal ttems (selection of appropriate target lextcal ttems) ts htghly dependent on each lextcal ttem\[tt\].</Paragraph>
    <Paragraph position="6"> The current verston of our analysts grammar works qutte well on t.O00 sample sentences tn real abstracts wtthout any pre-edtttng.</Paragraph>
  </Section>
class="xml-element"></Paper>