<?xml version="1.0" standalone="yes"?>
<Paper uid="C82-1051">
  <Title>PROCEDURAL MEANING REPRESENTATION BY CONNOTATIVE DEPENDENCY STRUCTURES. AN EMPIRICAL APPROACH TO WORD SEMANTICS FOR ANALOGICAL INEERENCING</Title>
  <Section position="3" start_page="319" end_page="319" type="metho">
    <SectionTitle>
320 B.B. RIEGER
</SectionTitle>
    <Paragraph position="0"> Neglectable as these shortcomings prove to be for strictly extensionally defined environments and fragments of knowledge structure in referential models, data complexity tends to increase to meet exploding difficulties and escalating problems whenever abstract concepts or even vague meanings are to be processed in a not exclusively denotative but also connotative setting of formal semantic representation. null As natural language communication may be characterized by the apparent ease and efficienc~, however, with which ill-defined concepts and fuzzy meanings are being intended and expressed by speakers, identified and understood by hearers, and successfully used by speakers /hearers in performing inferences of some - not necessarily logical sort, it is argued here, that any non-trivial simulation of processes of cognition and/or natural language comprehension will have to provide some means of dynamic knowledge representation which permits to account more satisfactorily for one or the other aspect raised above.</Paragraph>
    <Paragraph position="1"> The concept of 'representation of knowledge' seems lucid enough when talking about memories of sentences, numbers,or even faces, for one can imagine how to formulate these in terms of propositions, frames, or semantic networks. But it is much harder to do this for feelings, insights and understandings, with all the attitudes, dispositions, and 'ways of seeing things' that go with them.</Paragraph>
    <Paragraph position="2"> \[The term 'disposition' is used here in its ordinary language sense to mean 'a momentary range of possible behaviours'\]) Traditionally, such issues are put aside, with the excuse that we should understand simpler things first. But what if feelings and viewpoints a r e the simpler things - the elements of which the others are composed? Then, I assert, we should deal with dispositions directly, using a 'structural' approach ... (2) In the present case this has been developed in two stages: the semantic space as a distance-like data structure, and an algorithm to transform its distance relations to form source-oriented hierarchies of connotative dependency structures.</Paragraph>
  </Section>
  <Section position="4" start_page="319" end_page="319" type="metho">
    <SectionTitle>
SEMANTIC SPACE STRUCTURE
</SectionTitle>
    <Paragraph position="0"> Theoretical approaches in formal semantics tend to deny a dynamic linguistic meaning structure, but assume the existence of an external system structure of a world, o~ possible worlds, whose pre-formatted entities may referentially be related to language terms constituting their denotation. Structural approaches in linguistic semantics tend to deny the possibility of denotational, but presuppose the knowledge (and comprehension) of language systems whose semantic relations among their items are being described intra-lingually by means of syntagmatic and paradigmatic oppositions along certain dimensions in semantic fields. Other than these two, our present way of approach strives to presuppose as little and to reconstruct empirically as much as possible of the relational (not necessarily logically reconstructable) structure that in the course of discourse is constituted by the regular use of language terms as a system of linguistically labeled empirical objects, called meanings.</Paragraph>
    <Paragraph position="1"> We consider the natural language users' ability to intend and comprehend meanings in verbal interaction a phenomenologically undoubtable, empirically well established, and theoretically defensible basis for any semantic study of natural language performance. It is assumed that the usage regularities followed and/or established by employing different lexical items differently for communicative purposes in discourse may be analysed not only to describe the lexical structure of vocabulary items used, but also to model a fragment of the con-</Paragraph>
  </Section>
  <Section position="5" start_page="319" end_page="319" type="metho">
    <SectionTitle>
EMPIRICAL APPROACH TO WORD SEMANTICS FOR ANALOGICAL INFERENCING 321
</SectionTitle>
    <Paragraph position="0"> comitantly conveyed common knowledge or semantic memory structure constituted.</Paragraph>
    <Paragraph position="1"> This is achieved by an algorithm that takes lemmatized strings of natural language disc6urse of a certain domain as input and produces as output a distance-like data structure of linguistically labeled points whose positions represent their meanings. As the statistical means for the empirical analysis of prevailing interdependencies between lexical items in text strings have elsewhere (3) been developed and discussed to some extent (4) 9 and as the formal representation of vague word meanings derived from these analyses has previously (5) been outlined and illustrated~ too (6), an informal description will suffice here.</Paragraph>
    <Paragraph position="2"> The algorithm applied so far consists of a consecutive mapping of lexical items onto fuzzy subsets of the vocabulary according to the numerically specified statistical regularities and the differences~ these items have been used with in the discourse analysed. The resulting system of sets of fuzzy subsets may be interpreted topologically as a n-dimensional hyperspace with a natural metric. Its n linguistically labeled elements (representing meaning points) and their mutual distances (representing meaning differences) form discernable clouds and clusters (7). These determine the overall structuredness of a domain by measurable semantic (paradigmatic and/or syntagmatic) properties of the lexical items concerned.</Paragraph>
  </Section>
  <Section position="6" start_page="319" end_page="319" type="metho">
    <SectionTitle>
CONNOTATIVE DEPENDENCY STRUCTURE
</SectionTitle>
    <Paragraph position="0"> Stimulated by the theory of spreading activation in memory models (8) in conjunction with the psyhhological account of language understanding in procedural semantics (9) a dynamic meaning representation can be developed of the basis of the prototypical, but static representations provided by the semantic hyperspace strucure. This is mchieved by a recursively defined algorithm which has formally been introduced elsewhere (Io) so that it may verbally be described here as a procedure to generate a potential of latent relations among meaning points in the semantic space.</Paragraph>
    <Paragraph position="1"> In a way9 this procedure reconstructs for this model what recent theories of cognition and language comprehension have introduced in network models of semantic memory: paths of excitation that may be activated from any primed node and which spread along node relating links over the whole network with decreasing intensities. Compared to the execution of spreading activation processes in network models~ however, the present procedure - speaking in model genetical terms must be considered of prior status. The semantic hyperspace is not a transitively related network of nodes, but a symmetrically related data structure of linguistically labeled n-tuples of numerical values.</Paragraph>
    <Paragraph position="2"> Therefore, priming of any item would immediately activate every other item rendering the process of spreading activation undiscriminating for semantic representation. So, the new procedure, first, has to establish links between items and evaluate them by processing the data base provided in order to let these links eventually serve as directed paths along which possible activation might spread.</Paragraph>
    <Paragraph position="3"> Operating on the distance-like data of the semantic space, the algorithm's generic procedure will start with any meaning point being primed to determine those two other points, the sum of distances between which form a triangle of minimum edges' lengths. Repeated successively for each of these meaning points listed and in turn primed in accordance with this procedure, particular fragments of the relational structure inherent in the semantic space will be selected depending on the aspect, i.e. the primed point the algorithm is initially started with. Working its way through and consuming all labeled points in the space system, the procedure transforms prevailing similarities of 322 B.B. RiEGER meanings as represented by adjacent points ~o establish a binary, non-symmetric, and transitive relation between them~It allows for the hierarchical rearrangement of meaning points as nodes under a primed head in the format of a binary tree~ called connotative dependency structure (CDS) o The process of detection and identification which the algorithm performes may be illustrated in view of a t~?o-.dimensionel space configuration of 11 points &lt; d{a,b,c~dge~f~g~h~i,~,k}&gt; (Fig. I).</Paragraph>
    <Paragraph position="4">  Submitted to the search procedure of least triangle under initial priming of the point a the algorithm will identify the number of triangles in Fig. 2 and produce thebinary tree as shown in Fig. 3. For the effective use in procedural meaning representation and son, antic Drocessing~ the CDS-trees may additionally be evaluated by connotative c~iterialities (1o). The criteriaiity is a numerical expression of the degree or intensity by whicb any COS-node is dependent on the head; c%!cula~ed as ~ funhtion both of the involved meaning points ~ topology and their relative distaDc~s in the semantic spacedeg The head's criteriality being I.Oo~ this value is splitted among every two dependent nodes~ and consequently decreases from level to level in the tree structure approximating O.</Paragraph>
    <Paragraph position="5"> Examples of connotative dependency trees are given below where the upper fragments of the COSts of ARBEIT/labour (Fig.4) and INDUSTRIE/ industry (Fig. 5) are shown as computed from the semantic space shructure derived of a sample of German newspaper texts from the 1964 daily editions of 'Die Welt' It goes without saying that the generating of CDS-trees is a prerequisit to source-oriented search and retrieval procedures which may thus be performed effectively on the semantic space structure. Given, say~ the meaning point ARBEIT/!abour to be primed, ands say~ INDUSTRIE/industry as the target point to be searched~ the COS (ARBEIT) wiT~ be generated first. It provides semantic dispositions of decreasing lriteriality under the aspect of ARBEIT in ~he semantic space data. Then, the tree will be searches Cbreadth-fJrst) for the target node INDUSTRIE, !~hen this is hit, its dependency path will be activated to back-track those intermediate nodes which 6otermine the connotative transitions</Paragraph>
  </Section>
  <Section position="7" start_page="319" end_page="319" type="metho">
    <SectionTitle>
EMPIRICAL APPROACH TO WORD SEMANTICS FOR ANALOGICAL INFERENCING 323
</SectionTitle>
    <Paragraph position="0"> of INDUSTRIE under the aspect of ARBEIT, namely UNTERNEHMEN/business, STADT/town, ANGEBOT/offer as underlined in Fig. 4.</Paragraph>
    <Paragraph position="1"> The priming of INDUSTRIE and the targetting of ARBEIT leads to the activation of quite a different dependency path mediating ARBEIT under the aspect of INDUSTRIE, namely by KENNTNIS/knowledge, ERFAHR/ experience, LEIT/control, as underlined in Fig. 5.</Paragraph>
    <Paragraph position="2"> Fig. 4</Paragraph>
  </Section>
  <Section position="8" start_page="319" end_page="319" type="metho">
    <SectionTitle>
I.OOO ARBEIT
.086 INDUSTRIE
</SectionTitle>
    <Paragraph position="0"/>
  </Section>
  <Section position="9" start_page="319" end_page="319" type="metho">
    <SectionTitle>
.068 PERSON
.064 ANGEBOT
.059 VERKEHR
.056 EINSATZ
.035 ARBEIT
~.O31 VERANTWORT
</SectionTitle>
    <Paragraph position="0"> Using these source-oriented search and retrieval processes, an ana-, logical, contents-dependent form of inferencing, as opposed so logical deduction,may operationally be devised by way of parallel processing of two ~or more) COS-trees. For this purpose an algorithm is started by the two (or more) meaning premises of, say, ARBEIT and 324 B.B. RIEGER INDUSTRIE. Their CDS-trees will be generated before the inferencing procedure begins to work its way (breadth-first) through the trees' levels, taking highest criterialities first in tagging each encountered node. When the first node is met which has previously been tagged already, the search procedure stops to activate the dependency paths from this concluding common node - here, ORGANISAT/organization in the CDS-trees concerned, as illustrated in Fig. 4 and Fig. 5 by dotted lines, separately presented in Fig. 6.</Paragraph>
  </Section>
class="xml-element"></Paper>