<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1058">
  <Title>FERVOR FLETRIR FORCER FOR~R FORMER FORMER FORNER FRANCHIR I ! I I  |' \] -~ .E .'3 .=~ I - * LPS COUP - - POSS-C/ i i DOULEUR - + LPS TRUC - - POSS-~ BONHPSUR - - - CA - - POSS-C/ CHgHISE r - - LE NOMBRZL - . det SITUATION + - LA VERITE LE VENIN - + LE LOT J- , POSS-(P - / BATTERTES J - ~ LE HARNOIS - ~ LE CLOU - . UNE LUHIERE i: NORT 'NC&amp;quot;OT ii! Tout N BRIN DE TOILETTE GRISE MZN~ HARA-KIRI JURISPRUDENCE ;- + UNPS NINUTE DE SILENCE NO~BRE :- + DET OPERATION PORTE OUVERTE - - DU QUARANTE CINO FILLETTE TAPIS TINTIN - - POSS-~ VOIX - - DET ENFANT - - DET ENFANT - * POS$-~ PORTES - + DET CRIME</Title>
  <Section position="7" start_page="280" end_page="281" type="concl">
    <SectionTitle>
4. CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have shown that simple sentence structures were of varied types. At the same time, we have seen that their representation in terms of the entries of traditional &amp;quot;linear&amp;quot; dictionaries, that is, In terms of words alphabetically or otherwise ordered, is inadequate. An improvement appears to involve the look-up of two-dimensional patterns, for example the matrices we proposed for frozen sentences and their generalization to support verbs and operator verbs. More generally, syntactic structures are determined by combinat|ons of a verb morpheme with one or more noun morpheme(s). Hence, the general way to access the lexicon will have to be through the selectional matrix of Tables 3 and 4, In practice, syntactic computations are context-free computations in natural language processing. Context-free algorithms have been studied in many respects by computer scientists, theoreticians and speciahsts ot programming languages.</Paragraph>
    <Paragraph position="1"> The principles of these algorithms are clearly understood and currently in use, even for natural languages where new problems arise because of the numerous ambiguities and the various terminologies attached to each theoretical viewpoint.</Paragraph>
    <Paragraph position="2"> The tact that context-free recognition is a mastered technique has certainly contributed to the shaping of the grammars used in automatic parsing. The numerous sample grammars presented so far are practically all context-tree. There is also a deep linguistic reason for building context-free grammars: natural languages use embedding processes and tend to avoid discontinuous structures.</Paragraph>
    <Paragraph position="3"> Much less attention has been peJd to the complex syntactic phenomena occurring Jn simple sentences and to the organization of the lexicon. The tact that we could not separate the syntactic properties of verbs from their lexical features has led us to construct a representation for linguistic phenomena which is more specJhc than the current context-free models. A context-free component will still be useful in the parsing procesS, but it will be relevant only to embedded structures found in complex sentences, with not much incidence on meaning, To summarize, the syntactic patterns are determined by pairs (verb, noun): - the frozen sentence N O k~ck the bucket Js thus entirely specified, while the pair (take, bull) needs to be disambiguated by the second complement by the horns, requiring thus a more complex device to be identified; (take, walk) and (take, food) are support sentences, so are (have, faith) and (have, food); the verbs have, kick and take together with concrete obiect select ordinary sentence forms.</Paragraph>
    <Paragraph position="4"> But the selectional process for structures may not be direct.</Paragraph>
    <Paragraph position="5"> The words in the previously discussed pairs may not appear in the input text. Words appearing in the input are then related to the words in the selectJonal matrix by: cfassifJcatlonal relations: food classifies cake, soup, etc.</Paragraph>
    <Paragraph position="6"> concrete obiect classifies ball, chair, etc.</Paragraph>
    <Paragraph position="7"> - relations between support sentences, such as Jo (had, took,threw out) some food Jo (took, was out for, went out for) a walk Jo (has, keeps, looses) faith in Bob relations between support and operator sentences: Thie gave to Jo faith in Bob All these relations in fact add a third dimension to the selectional matrix.</Paragraph>
    <Paragraph position="8"> The complete selectional device is now a complex network of relations that cross-relates the entries. It will have to be organized in order to optimize the speed of parsing algorithms.</Paragraph>
  </Section>
class="xml-element"></Paper>