<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2009">
  <Title>A Logic-Based Government-Binding Parser for Mandarin Chinese</Title>
  <Section position="6" start_page="0" end_page="0" type="concl">
    <SectionTitle>
5. Conclusion and Remarks
</SectionTitle>
    <Paragraph position="0"> Many natural langt, ages are flexible and context-sensitive.</Paragraph>
    <Paragraph position="1"> Mandarin Chinese is a famous example. It is difficult to capture tile linguistic phenoinena lot these languages in computer. This paper adopts GB Theory to deal with this problcm. According to GB Theory, the rule of 'move - a' moves anything anywhere, and the universal princil~les operate interactively to rule out the illegal movements. Thus, the only things shoukt be declared in tim grammars ree:  (1) which phrases are the possible empty constituents, (2) which positions are their possible empty sites, (3) which positions are their possible landing sites, (4) which phrasal categories are bounding nodes.</Paragraph>
    <Paragraph position="2">  In such cases, a robnst parser for n:ttural hmguages can be designed. As an example, we represent many context-sensitive constructions in Mandarin Chinese, and do case marking and index assignment for Chinese sentences. An experime,mfl Chinese parser is running under the euvironments: (1) Vax-I 1/785, (2) Quintus Prolog, (3) lexicon with about 200 words (about 33K bytes), and (4) about 150 production rules (about l I2K bytes). Besides movement transformation, pronotm resolution is another index assignment. For well treatment o\[ pronoun resolt, tion, the syntactic knowledge is not enough. This is because the Binding Theory tells us much the impossible pair, but little the possible pair. Much more semantic information should be included.</Paragraph>
    <Paragraph position="3"> Moreover, our GB approach is also useft,1 when we would like to compose logical formulae from their syntactic counterparts. The idea is that the mapping between d-structure and s-struc.ture, as well as between s-structure and logical form are treated in the similar way. The movement transformation between d-structure and s-structure tells us the relationship anaong verb and its accolnpanying arguments. The skeleton of the given 'verb is defined in tile lexicon, and base-generated in the d-structure. For example, 'N '(Subject,Object) (buy(Subject,Object)).</Paragraph>
    <Paragraph position="4"> The index assignment relates ~' (book) to the verb '.~:~ ' (buy) in the following sentence: (There is one bcmk i that every student bought ti.) Because the variable of the type -~- ' (book) and the second argument of the template 'N '(Subject, Object) (buy(Subject, Object)) should be the same in the logical form, the index (a unique integer) can be changed into a variable, say X. That is, they share the same variable shown below: exist(X,'i~ '(X),forall(Y,'-~ ~L'(Y),'N '(Y,X))) (exist(X,book(X),forall(Y,student(Y),buy(Y,X)))).</Paragraph>
    <Paragraph position="5"> The formtfla tells us the SVO-SOV inversion in the logical tbrm. This phenomenon can be added into our parser easily with our formalism. The details concerning the logical interpretation of Chinese sentences refer to/Chen 1989/.</Paragraph>
  </Section>
class="xml-element"></Paper>