<?xml version="1.0" standalone="yes"?>
<Paper uid="E85-1029">
  <Title>Head Selection Feature Inheritance Conceptual Relation Prediction Triggering Thesaurus/PTABLE ._g~mn-tio Dependency Construction</Title>
  <Section position="2" start_page="200" end_page="201" type="metho">
    <SectionTitle>
CONCEPT SYMBOL
</SectionTitle>
    <Paragraph position="0"> The CS(CONCEPT SYMBOL) differs from that of Schank's primitives in many respects. The number of CSs grows in proportion to the size of vocaburary as human cultivates new ideas and notions. The meaning of each CS is intensionally defined by LambdaCS COOCURR(CS,CSi,CRj). This model does not require to explain the reason why these CSs may be primitives and set up lexical rules for mapping Sehank's semantic primitives to the corresponding words. That is to say, human can perceive the word concept only through observing which CSs and CRs CO-OCURR with logical and pragmatic functions. Each description of C00CURR(CSI,CS2,CS3) in the world model, where one C,$i can be interpreted as CR, specifies the meaning LambdaCSi.</Paragraph>
    <Paragraph position="1"> ADG rules are defined as feature-oriented.</Paragraph>
    <Paragraph position="2"> DL. ADG: dependency rule for Legato.</Paragraph>
    <Paragraph position="3">  D7. Network structure is used for INTERNAL REPRES~TATION: semantic dependency structure and conceptual structure. Network St~eture is defined as a subset of: CONCEPTUAL 3YMBO~x~45 conceptual relations, dummy relations } I)8. Each lexical entry has its KEY and CONTENT. The KEY consists of WORD spelling and CS. The CONTENT is a set of FEATUREs . CS may be one piece of those conceptual FEATUREs . Atomic formula in FTABLE and THESAURUS Knowledge Base consists of LEXICON, THESAURUS and FTABLE.</Paragraph>
    <Paragraph position="4"> The case grammar, as a basis of internal representation, which is constructed with the combination of binary case relations, fits the dependency grammar very well, since both dependency and case relation are basically binary. The dependency analysis also correlates to the atomic formula adopted for fact model specification. The formula has the following form, but not the ordinary predicate convention. The formula tells only the fact that three CSs (one may be CR) coocurr logically.</Paragraph>
    <Paragraph position="5"> cooc~R ( c~sl , c.sj , c~ )  This convention also implies some order-free calculation. The following example illustrates this kind of flexible function.</Paragraph>
  </Section>
class="xml-element"></Paper>