<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="12"/><title>STOCK OF SHARED KNOWLEDGE - A TOOL FOR SOLVING PRONOMINAL ANAPHORA</title><author surname="HAJICOVA" givenname="EVA"><org  name="Simon Fraser University" country="Canada" city="Burnaby"/></author><author surname="KUBON" givenname="VLADISLAV"><org  name="Simon Fraser University" country="Canada" city="Burnaby"/></author><author surname="KUBON" givenname="PETR"><org  name="Simon Fraser University" country="Canada" city="Burnaby"/></author></firstpageheader><frontmatter><p>STOCK OF SHARED KNOWLEDGE -- A TOOL FOR SOLVING PRONOMINAL ANAPHORA</p><p>EVA HAJICOVÀ, VLADISLAV KUBON and PETR KUBON</p><p>UFAL Charles University Malostranské nam. 25 CS-118 00 Prague Czechoslovakia</p><p>School of Computing Science Faculty of Applied Sciences Simon Fraser University Burnaby, B.C. V5A 1S6 Canada</p></frontmatter><abstract></abstract></header><body><section title=""><p>The paper develops further the idea of using the notion of the stock of shared knowledge (SSK) for anaphora resolution following a more subtle treatment of the influence of the topic/focus articulation of the sentence on the degrees of salience of items of the SSK. An algorithmic evaluation procedure of the SSK is formulated taking into account the notions of contextual boundness, syntactic associations, complexity of the sentences and existence/nonexistence of possible competitors, and a general evaluating function is proposed, essential for the process of anaphora resolution. In the present paper the analysis is performed for Czech; however, the considerations are claimed to be of a universal validity, the actual relations between different factors and the values, of course, being language-dependent.</p><p>1.INTRODUCTION</p><p>In our paper at Coling'90 we followed up the investigations presented in Hajicovâ, Vrbovâ' (1982) and proposed an algorithm for solving pronominal anaphora with the use of "stock of shared knowledge" (SSK) - an abstract representation of the hierarchy of salience of the items of the knowledge assumed by the speaker to be shared by him and the hearer. The changes of degrees of salience were dependent solely on the bipolar division of the sentence into its topic and focus parts, respectively. In particular, the rules for computing the degrees of salience were specified as follows:</p><p>(i) the items referred to in the focus part of the utterance be it by a noun or by a stressed pronoun receive the highest degree of salience (MAX);</p><p>(ii) the items referred to by a noun in the topic part of the sentence are activated one degree less (MAX-1) than the items referred to in the focus part;</p><p>(iii) a pronominal reference to an item in the topic part of the utterance keeps the activation unchanged;</p><p>(iv) the items not mentioned in the given utterance subtract two degrees from their previous activation.</p><p>As we stated already in the above mentioned paper, this was only a tentative solution on the way to a more sophisticated approach to organizing "common knowledge" of the speaker and the hearer.</p><p>Supported by a thorough linguistic analysis of a large amount of Czech prosaic texts Hoskovec (1989), two possible improvements to the procedure have been suggested Hajicovä, Hoskovec, Sgall (in press), namely:</p><p>(i) to replace the binary account of topic/focus articulation of the sentence by a more atomic distinction between the contextually bound and non-bound elements of the sentence, thus enriching the numerical system of possible degrees of salience;</p><p>(ii) to account explicitly for the empirical observations that items mentioned throughout the discourse are more likely to be referred to than those mentioned only once.</p><p>In this paper we would like to argue that other important features should he taken into account in building the new evaluation system for the SSK. We believe that for a more sophisticated treatment of pronominal anaphora, an account of SSK must also allow for:</p><p>(iii) a reflection of the topology of the surface structure of the text, in the simpliest form in terms of the distance of the possible antecedent and a refering expression measured by the number of interfering objects between them with respect to the sentence and paragraph boundaries;<page local="2" global="1"/></p><doubt alpha="52.3" length="86" tooSmall="False" monospace="0.0">Actes de COLING-92, Nantes, 23 28AOtrr19927 Proc. of COLING-92, Nantes,Aua.23-28, 1992</doubt><p>(iv) a capturing of some associations between lexical units describing objects in the text. We have limited our attention only to syntactic associations between governing and dependent words in the syntactic structure of the sentence. More general treatment of associations requires the use of semantic and/or pragmatic information (eg. semantic features, knowledge base etc.) which is not taken into consideration in the present version of the algorithm, but forms a promising subject of further investigations of possible improvements of the algorithm.</p><p>Taking these observations into account, we present a new, enriched model of SSK here. In Section 2 we briefly discuss the relevance of the above mentioned features for anaphora resolution. Section 3 gives a proposal of the organization of SSK, together with the rules evaluating changes in degrees of salience of its items and a general algorithm for reference assignment based on the use of SSK. The possibility of customizing the algorithm for the purposes of a special language under consideration (in our case Czech) is discussed in Section 4.</p></section><section number="2." title="MOTIVATION"><p>In our analysis, we work within the framework of the functional generative description (see Sgall, Hajicovâ and Panevovâ, 1986). We represent the meaning structure of a sentence as a dependency tree rooted in the main verb, the nodes of the tree being labelled by lexical and morphological meanings. The edges denote the underlying grammatical relations between nodes. All nodes of the tree can be either contextually bound (CB) - if the objects they denote are "given", "known" from the context - or non-bound (NB) - if they introduce new information into discourse.</p><p>The meaning of a sentence represented by such a tree is then viewed as divided into two parts - a topic (T), "stating" what the sentence is about, and a focus (F), commenting or developing the topic.</p><p>The topic-focus articulation (TFA) of a sentence can be specified according to the sentence structure as follows (cf. Sgall 1979):</p><p>(i) F contains the main verb iff the verb is NB;</p><p>(ii) F contains all daughter nodes of the verb which are NB, together with all nodes subordinated to them (which in turn are either NB or CB);</p><p>(iii) if the verb together with all daughter nodes is CB (and, therefore, none of (i),(ii) applies), F is defined with respect to a deeper embedded node.</p><p>( This case is rather rare and we do not consider it in our analysis for the sake of simplicity.) (iv) T consists of all the nodes not contained in</p><p>F.</p><p>Thus, for the purpose of this paper, only the difference between NB nodes and CB nodes on the first level of dependency is taken into consideration while specifying TFA of a sentence. We would like to show in the sequel that there is a linguistic evidence which suggests that deeper levels of syntactic embedding (at least the second level) be accounted for in the resolution of anaphora.</p><p>For the sake of simplicity, we represent the sentence schematically:</p><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">Verb</doubt><doubt alpha="33.3" length="9" tooSmall="False" monospace="0.0">G(l) G(2)</doubt><doubt alpha="10.0" length="10" tooSmall="False" monospace="0.0">!-'-, I-1-</doubt><doubt alpha="21.1" length="19" tooSmall="False" monospace="0.0">G(3) G(4) G(5) G(6)</doubt><p>Topic Focus where G(l) is a group of CB nodes on the first level of dependency (belonging to T),</p><p>G(3), G(5) are CB nodes on the second level of dependency (belonging to T and F respectively),</p><p>G(2) is a group of NB nodes on the first level of dependency (belonging to F) and</p><p>G(4), G(6) are NB nodes on the second level of dependency (belonging te T and F respectively).</p><subsection number="2.1" title="Level of dependency in a syntactic tree"><p>Let us introduce one of the examples which show the necessity of further extension of the scale in the SSK. Consider the following sample of text - Hoskovec (1989):</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.1:</doubt><p>(1) At the railway station I saw a <i>dog </i>with long <i>ears.</i></p><p>(2) It was funny to observe <i>them </i>dangling in the wind.</p><p>(3) I wondered how <i>he </i>happened to get there.</p><p>According to our Coling '90 paper there is no distinction in the SSK between <i>dog </i>and <i>ears. </i>Both are contained in focus of (1), which means that they have the highest degree of salience in the next sentence. Such an account does not explain the fact, that the above introduced order of sentences is possible and the order (l)-(3)-(2) does not constitute a coherent text - it seems to be impossible to refer to <i>ears </i>from the third sentence using the personal pronoun <i>them </i>as a refering expression.<page local="3" global="2"/></p><doubt alpha="47.8" length="92" tooSmall="False" monospace="0.0">Acresde COLING-92, Nantes, 23-28 août 1992 12 8 Proc. of COLTNG-92, Nantes, Aug. 23-28, 1992</doubt><p>The scheme of the syntactic tree as introduced above offers us a key to the solution of this problem. From this point of view there is a distinction between <i>dog </i>and <i>ears </i>in the sentence (1). According to our scheme, the word <i>dog </i>stands in the position G(2), the word <i>ears </i>is in the position G(6). Both are contextually non-bound.</p><p>Thus, examples along this line seem to suggest that the modified SSK has to take into account the distinction between immediate members of a respective verb frame and words which are embedded on a deeper level of the syntactic tree.</p><p>2.2 Contextual boundness and non-boundness The distinction between contextually bound and non-bound elements is also significant. Let us consider the following example from Hoskovec (1989):</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.2:</doubt><p>(4) At the railway station I saw <i>their dog.</i></p><p>(5) I realized <i>they </i>would look for <i>him </i>the whole afternoon.</p><p>(6) I wondered how <i>he </i>happened to get there.</p><p>Although this sample text seems to have the same distribution of pronouns as (l)-(3), the difference between the two texts shows when we change the order of sentences to (4)-(6)-(5). In the latter case, the change of the order is possible . Since the sentences (1) and (4) differ only in contextual non-boundness of <i>long ears </i>vs. contextual boundness of <i>their, </i>respectively, both expressions being on the second level of dependency, we conclude that the distinction between contextual boundness/nonboundness of the nodes in the syntactic tree of the sentence is important for the resolution of anaphora and, therefore, must be captured by the new version of SSK.</p></subsection><subsection number="2.3" title="Syntactic associations"><p>The notion of syntactic associations is introduced by means of slightly modified examples found in technical texts. Let us start with the following sample text:</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.3:</doubt><p>(7) In the residence quarter of Brno it is possible to find a <u>villa</u> of <i>professor Schmidt.</i></p><p>(8) II was built during the thirties.</p><p>(9) <i>His </i>other two <u>houses</u> are to be found in Olomouc and Jihlava.</p><p>In this case the assignment of <i>him </i>to its antecedent is straightforward; although the expression <i>professor Schmidt </i>is in the focus part of (7), it does not depend directly on the governing verb and, moreover, it is contextually non-bound. At the first sight this seems to be a counterexample to the above introduced scheme of the role of CB and NB elements of a sentence, namely, to the impossibility of referring to NB-nodes on the second level of dependency by means of personal pronouns across one embedded sentence (see Ex. 1).</p><p>However, we believe that the difference between (l)-(2)-(3) and (7)-(8)-(9) lies in the fact, that <i>his </i>is in the third sentence accompanied by the full noun reference to the <u>villa</u> using a similar word (house), which certainly influences the salience of the item <i>professor Schmidt. </i>The structure of a noun phrase governed by <u>villa</u> in (7) is the same as the dependency structure of the noun phrase governed by <u>houses</u> in (9), therefore also the salience of the item <i>professor Schmidt </i>is evidently higher than without that association. We can support our observations with the modified example:</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.4:</doubt><p>(8) It was built during the thirties.</p><p>(9a) <i>He </i>was known as a collector of paintings of young local painters.</p><p>In our opinion, the process of assigning the antecedent <i>professor Schmidt </i>to the refering expression <i>him </i>is not as straightforward as in Ex.3; indeed, some of the hearers have difficulties with accepting Ex.4 as a valid text.</p><p>The degree of the influence of syntactic associations on anaphora resolution can vary for different languages. It is also clear that at least a small stock of related notions plays a very important role in this mechanism. We will discuss these problems more in detail in the Sect. 4 of this paper, where we show the approach for a particular language under consideration (Czech).</p></subsection><subsection number="2.4" title="Topology"><p>We can use Ex.3 to show another important fact which has an influence on the reference assignment. The sentence (8) is a very simple one, in particular, it does not introduce any new element into the SSK except the word <i>thirties. </i>The situation is very different, if we replace (8) by (8a):</p><doubt alpha="53.5" length="43" tooSmall="False" monospace="0.0">Actes de COLING-92. Nantes, 23-28 août 1992</doubt><doubt alpha="43.8" length="48" tooSmall="False" monospace="0.0">129 Proc. of COLING-92, Nantus, Aug. 23-28, 1992</doubt><page local="4" global="3"/><p>(9) <i>His </i>other two <u>houses</u> are to be found in Olomouc and Jihlava.</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.5:</doubt><p>(7) In the residence quarter of Brno it is possible to find a <u>villa</u> of <i>professor Schmidt. </i>(8a) <u>The building</u> was built by a group of architects in late thirties.</p><p>The reference by <i>him </i>in (9) is in this case still possible, but the text is not as clear as in Ex.3. Any other new element in (8a) makes the reference almost unclear.</p><p>Supported by this observation, we believe that also the linear distance between an antecedent and a refering expression influences to some extent the salience of the referred item.</p><p>It is clear that the function which expresses the degree of salience is not continuous. The end of the paragraph seems to have a strong effect: it leads to a drop of the salience of almost all possible antecedents except for those the activation of which has been established by repeated mentioning in the previous paragraph. The exact values of the function are now the objects of intensive investigation. We discuss some results of our investigations into this problem in Sect. 4 below.</p></subsection><subsection number="2.5" title="Existence of competitors"><p>The last feature which is considered in our system is the role of competing elements. We can demonstrate the problem by means of a slight change of (8a), which introduces a new competing element into the text:</p><doubt alpha="40.0" length="5" tooSmall="False" monospace="0.0">Ex.6:</doubt><p>(7) In the residence quarter of Brno it is possible to find a <u>villa</u> of <i>professor Schmidt. </i>(8b) <u>The building</u> was built by <i>architect Hovorka </i>in late thirties.</p><p>In this case <i>professor Schmidt </i>is no longer available as an antecedent for pronominal anaphora Since <i>architect Hovorka </i>has a greater degree of salience and the same morphological categories.</p><p>All previous examples show the necessity of including into the evaluation procedure of the SSK not only the notions of contextual boundness, but also associations, complexity of the sentences and existence/nonexistence of possible competitors. Their role in the evaluation procedure is described more in detail in the following paragraph.</p></subsection></section><section number="3." title="THE GENERAL EVALUATING PROCEDURE"><p>Before we start the explanation of our evaluation procedure, we must make clear that we restrict ourselves in our considerations to those items of knowledge (i.e.the mental representations of the objects of the outer world), referred to in the sentence by noun or by a pronoun. The starting conditions for the evaluating procedure are then as follows:</p><p>We assume that our procedure is a part of a larger complex system which is able to provide our procedure with the result of syntactico-semantic parsing of any sentence in the form of a dependency tree as a representation of the meaning of the sentence in the sense of Sgall, Hajicovâ, Panevovâ, (1986). We do not assume the existence of any special knowledge base, any semantic evaluation procedure or semantic features present in the syntactic tree. For the time beeing we restrict ourselves to those items (mental objects) that are rendered by nouns or pronouns.</p><p>The SSK as a basic data structure can be viewed in our modified account as a set of items, which represent all mental objects rendered by nouns or pronouns from the respective text. Each data entry has the form of an ordered quantuple:</p><p>&lt;LEX,MORPH,LAST,SYNT,OCCUR&gt;, where represents the lexical value of the item;</p><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">LEX</doubt><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">MORPH</doubt><p>is a set of morphological characteristics of the word (e.g. gender, number, etc.). These characteristics are used in so-called morphological filter, which filters out the impossible antecedents of the referring expression.</p><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">LAST</doubt><p>are the coordinates 'of the latest occurrence of the word or of the pronominal reference to it. These coordinates are composed of the "surface" and "deep" part. The "surface" coordinates contain the number of the sentence and a serial number of the node in the sentence structure and they serve as a basis for the "topological" part of the evaluation procedure.</p><p>The "deep" part contains the code for the position of the word in the syntactic tree as introduced above (G(i)). This information determines the contextual (non)boundness of the word.</p><page local="5" global="4"/><doubt alpha="100.0" length="4" tooSmall="False" monospace="0.0">SYNT</doubt><p>contains the data about the syntactic structure of the sentence where the respective LEX was mentioned for the last time. The structure is represented only partially, by means of pointers, which point to the governing node and also to all dependent nodes if they are contained in the SSK. This system of syntactic pointers serves as a basic data structure for the simple handling of associations.</p><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">OCCUR</doubt><p>is a pair of integers which represent the number of occurrences of the given item both from the beginning of the text and from the beginning of the paragraph.</p><p>The algorithm processes the given text sentence by sentence. It receives the dependency tree of a new sentence from the syntactico-semantical preprocessor, together with the list of all the pronominal referring expressions contained in the sentence. Each referring expression in this list carries the information about its position in the sentence (the same as LAST) and about its form (weak or strong pronoun, etc.). Using SSK, the algorithm finds the antecedents for all referring expressions. Afterwards, it changes the degrees of salience of the items in the SSK and reads the next sentence from the input.</p><p>Having stated the general idea of the algorithm, we can describe the evaluation process in more detail as follows:</p><subsection number="3.1" title="Algorithm:"><p>(i) Read an input (the syntactic structure of the new sentence and the list of referring expressions). For every referring expression Rh i= l,..,k in the list do the following (preserve the order of the referring expressions with regard to hierarchy of communicative dynamism in case that the sentence contains more than one referring expression):</p><p>a) Use the morphemic filter to filter out all units from the SSK which cannot be considered as possible antecedents of the refering expression R,.</p><p>b) Apply the evaluating function E(w) to all possible       ,   2 k antecedents W^Wj,...^' and sort them according to the obtained results from the most probable antecedent Wj' to the least probable antecedent W/.</p><doubt alpha="100.0" length="2" tooSmall="False" monospace="0.0">im</doubt><p>(ii) For all referring expressions R, and all results of evaluation W,, i=l,..,k; j = l,..,l, find the best solution. Thus we are looking for the optimal solution of anaphora for the sentence as a whole, since some "best" solution for the particular expression can block successful reference assignment for other refering expressions (Cf. examples in Hajicovi, Kubofi, Kubofi, 1990).</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">j</doubt><p>Generally, this is a computationally expensive solution but in practice the number of refering expression and possible antecedents is strongly limited and, therefore, this phase does not impose a serious restriction on the performance of the algorithm.</p><p>(iii) Update the data in the SSK - change OCCUR if the item was mentioned or reffered to in the current sentence - add items mentioned for the first time into the SSK - remove all the items with degrees of salience function smaller than some constant THRESHOLD (which may vary with respect to the</p><p>type of the text and the particular language). The function of salience has the form:</p><p>S(w) = 0/(N*(N-L+1)), where w is the item of SSK under consideration, O is the number of occurrences of the item in the</p><p>given paragraph N is the serial number of the current utterance (in</p><p>the given paragraph) L is the serial number of the utterance in the</p><p>paragraph where this item was mentioned for the last time</p></subsection><subsection number="3.2" title="The general evaluating function"><p>This function is essential for the whole process of anaphora resolution. Also, it is considerably more dependent on the language under consideration than all the other parts of the process. For this reason we have divided its description into two parts. In this section we describe the function only generally. The method of customizing all the constants according to the needs of a particular language (in our case Czech) is described in Sect. 4 below.</p><p>The basic form of the function is:</p><doubt alpha="33.3" length="18" tooSmall="False" monospace="0.0">E(w) = Ê(Cj*0 ,i-1</doubt><p>where <i>I, </i>is a function describing the value of the factor!</p><p>C| is a constant expressing the weight of the factor;<page local="6" global="13"/></p><doubt alpha="48.9" length="90" tooSmall="False" monospace="0.0">Actes de COLING-92, Nantes, 23-28 août 1992 13 1 Proc. orCOLING-92, Nantes, Auc 23-28,1992</doubt></subsection></section><section number="4." title="THE METHOD OF THE CUSTOMIZATION OF THE EVALUATING FUNCTION"><p>In this paragraph we want to show the method chosen for finding the values of the c, and f, for the particular language.</p><p>4.1 First step of the method is to find the form of f; for all factors taken into account. All functions should have a common value range. The balance of influence of all factors is achieved by the help of constants <i>c,. </i>After a complex examination of Czech texts (with a special stress on technical texts) we have come to the following results:</p><p>a) Contextual boundness - the word <i>w </i>is either hound or nonbound, therefore nonbound b) Underlying structure - for the definition of this function it is necessary to extend our schema from the paragraph 2 deeper than to the second level of dependency. The rule for the extension is the following:</p><doubt alpha="48.6" length="35" tooSmall="False" monospace="0.0">f,(w) = 100 &lt; = &gt; w is contextually</doubt><doubt alpha="100.0" length="5" tooSmall="False" monospace="0.0">bound</doubt><doubt alpha="51.5" length="33" tooSmall="False" monospace="0.0">f,(w) = 0 &lt; = &gt; w is contextually</doubt><p>All deeper levels consist only of nodes belonging to groups G(3-6) so that any governing node in the topic governs nodes G(3) and G(4), the governing nodes from focus govern nodes G(5) and G(6).</p><p>The function f2has been assigned the following tentative forms:</p><p>fî(w) = 70 for w in a position of G(l) <b><i>fJw) ~ </i></b>100 f°r w in a position of G(2) f2(w) = 50 for w in a position of G(3) = 0    for w in a position of G(4) = 50 for w in a position of G(5) f2(w) = 30 for w in a position of G(6) The motivation for this distribution of values can be found in Hoskovec (1989).</p><p>c) Associations - if the word w, depends directly on the word w2, it shares a part of the value of <b><i>Etyv,). </i></b>We do not restrict the dependency only to the immediate dominance, but the words on a deeper level share less of the value E(W2). We also take into account that one word can be in principle associated with more than one other member of the SSK. Therefore the form of the function f3 is the following:</p><p>w,, ..,w„ are the governing words of w so that Wi are ordered according to the syntactic level (w„ is the immediate governor of w) d) Linear distance - this function is quite simple, it is only necessary to count the linear distance of w and the possible refering expression. The counting is easy - we count only the members of SSK.</p><doubt alpha="32.0" length="25" tooSmall="False" monospace="0.0">f3(w) = S(112})* E(Wi)i-i</doubt><p>The function is simple:.</p><doubt alpha="27.3" length="22" tooSmall="False" monospace="0.0">f„(w) = 100/((In d)+d)</doubt><p>where d is a distance between the word w and a possible refering expression.</p><p>4.2 There is of course a significant difference between the way of computing f; and The latter is a constant, which describes the role of particular factors in the respective language.</p><p>For the evaluation of weights cj we use the following method:</p><p>In real texts we look for pieces of text with complicated referring structure. Any such text is modified by adding or removing items. The results are given to a group of randomly chosen native speakers, who should mark the understandability of all texts. One example of this method is given here by the modification of sentences (8) and (9) in Ex. 4 and 5 above.</p><p>The basic constraint on c; is described in the following equation: '</p><doubt alpha="40.0" length="10" tooSmall="False" monospace="0.0">Ê c = 1i-i</doubt><p>which means that every c, describes the role of factor i in percents. This constraint serves for the purpose of keeping the balance between particular factors under control. It is also useful in the case of some future extension of the whole system by adding new factors.</p><p>There can of course be any other constraints according to the needs of a particular language. We do not have any additional constraint for Czech in the moment.</p><p>The work on collecting material for the tests on c, is now in progress. The following constants were chosen as initial values :</p><p>- contextual boundness and non-boundness 0.25 - syntactic structure of the sentence 0.25</p><doubt alpha="63.2" length="19" tooSmall="False" monospace="0.0">- associations 0.25</doubt><doubt alpha="58.3" length="24" tooSmall="False" monospace="0.0">- linear distance , 0.25</doubt></section><section number="5." title="CONCLUSION"><p>The previous analysis has been done for Czech. We are far from claiming that every language would reflect the same relations between factors which can help to solve the pronominal anaphora.<page local="7" global="14"/> We have only tried to show how certain factors can result in a more sophisticated treatment of anaphora in NLP.</p><p>Our mechanism is designed as an open system, the nature of all functions mentioned here enables to add any number of other phenomena which can help to solve the problem of anaphora resolution.</p><p>Our approach is substantially different from the approach of e.g. Alshawi (1987) or Rich, Luper-Foy (1987). Our system does not need any knowledge base except the special thesaurus of related notions. It would be very interesting to combine our approach and the approach of Alshawi in some experimental NLP system.</p><p>ACKNOWLEDGEMENT the work on this paper was carried out under the project of the IBM Academic Initiative.</p></section><references><p>Hyian Alshawi (1987): Memory and context for language interpretation, Cambridge</p><p>University Press. Eva Hajicovâ, Petr Kubofi and Vladislav Kubon</p><doubt alpha="55.0" length="40" tooSmall="False" monospace="0.0">(1990):    Hierarchy   of   Salience and</doubt><p>Discourse Analysis and Production. In: Proceedings of Coling '90, Helsinki Eva Hajicovâ, Tomââ Hoskovec and Petr Sgall (in press), Discourse Modelling Based on</p><p>Hierarchy of Salience; to appear in Prague</p><p>Studies in Mathematical Linguistics 11 Eva Hajicovâ, Jarka Vrbovâ (1982): On the Role of</p><p>the Hierarchy of Activation in the Processes   of   Text   Understanding. In:</p><p>Proceedings of COLING 82, Ed. by</p><p>J.Horecky\ Amsterdam. TomâS Hoskovec (1989): An Activation Based</p><p>Model of Discourse ( Towards a negative delimitation of cognitive problems), In Proceedings of the International Workshop The Notion of Cognitive in Linguistics, Sofia, Svyat - Benjamins (to appear). Elaine Rich, Susann Luper-Foy (1987): An Architecture for Anaphora   Resolution,   MCC Technical</p><doubt alpha="62.9" length="205" tooSmall="False" monospace="0.0">Report Number ACA-HI-393-87, Petr Sgall (1979): Towards a Definition of Focus and Topic,   Prague Bull, of Mathematical Linguistics 31,3-25 ;32,1980,24-32 Petr Sgall, Eva Hajicovâ, Jarmila Panevovâ (1986):</doubt><p>The Meaning of   the Sentence in Its Semantic and Pragmatic Aspects, Dordrecht Prague.</p><doubt alpha="53.5" length="43" tooSmall="False" monospace="0.0">Actes de COLING-92. Nantes. 23-28 août 1992</doubt><doubt alpha="43.8" length="48" tooSmall="False" monospace="0.0">133 Proc. of COLING-92, Nantes. Aug. 23-28, 1992</doubt></references></body></article>