<?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="233"/><title>Resolving Individual and Abstract Anaphora in Texts and Dialogues</title><author surname="Navarretta" givenname="Costanza"><org  name="Center for Sprogteknologi" country="Denmark" city="Copenhagen"/></author></firstpageheader><frontmatter><p><b>Resolving Individual and Abstract Anaphora in Texts and</b></p><p><b>Dialogues</b></p><p><b>Costanza Navarretta</b></p><p>Center for Sprogteknologi, University of Copenhagen Njalsgade 80 2300 Copenhagen S costanza@cst.dk</p></frontmatter><abstract>This paper describes an extension of the dar-algorithm (Navarretta, 2004) for re­solving intersentential pronominal anaphors referring to individual and abstract enti­ties in texts and dialogues. In dar indi­vidual entities are resolved combining mod­els which identify high degree of salience with high degree of givenness (topicality) of entities in the hearer's cognitive model, e.g. (Grosz et al., 1995), with Hajicovä et al.'s (1990) salience account which assigns the highest degree of salience to entities in the focal part of an utterance in Infor­mation Structure terms, which often intro­duce new information in discourse. Anaph-ors referring to abstract entities are resolved with an extension of the algorithm pre­sented by Eckert and Strube (2000). The extended dar-algorithm accounts for differ­ences in the resolution mechanisms of differ­ent types of Danish pronouns. Manual tests of the algorithm show that dar performs better than other resolution algorithms on the same data. </abstract></header><body><section number="1" title="Introduction"><p>Although most pronominal anaphora resolu­tion algorithms only account for anaphors re­ferring to individual entities, anaphors re­ferring to abstract entities evoked by verbal phrases, clauses or discourse segments (hence­forth APAs) are quite common in English see i.a. (Byron and Allen, 1998) and even more in Danish (Navarretta, 2004). Recently, two algorithms for resolving APAs and individ­ual pronominal anaphors (henceforth IPAs) in specific English dialogues have been proposed Eckert and Strube's (2000) ESÜ0 and Byron's (2002) PHORA. Furthermore Strube and Müller (Strube and Müller, 2003) have presented a machine learning approach for resolving APAs in spoken dialogues.<footnote anchor="1"/>  Both ESÜ0 and phora recognise IPAsand APAs on the basis of se­mantic constraints on the argument position oc­cupied by the anaphors and account for differ­ences in reference between personal and demon­strative pronouns. In ES00 demonstrative pro­nouns preferentially refer to abstract entities, while personal pronouns preferentially refer to individual ones. ES00 resolves IPAs applying Strube's (1998) algorithm. In phora the an­tecedents of personal pronouns are searched for looking at their degree of salience which is im­plemented by word order as in (Grosz et al., 1995). Demonstratives, instead, are searched for in the list of <i>activated </i>entities (Gundel et al., 1993) containing non NP antecedents, which are assumed to be less salient. In phora demon­stratives can also refer to Kinds.</p><footnote label="1">We do not discuss this approach further in this pa­per.</footnote><p>ES00 requires that the structure of dialogues has been marked. Byron's PHORA-algorithm does not rely on predefined dialogue structure, but only searches for abstract antecedents of APAs in the sentence preceding the anaphor. Thus it does not account for APAs referring to larger discourse segments. phora relies on both semantic knowledge and a model of speech acts and accounts for more phenomena than ES00. Differing from ES00, phora has been imple­mented.</p><p>To resolve IPAsand APAs inDanishtexts and dialogues Navarretta (2004) has proposed the so-called DAR-algorithm (Navarretta, 2004). In dar APAs are resolved following the ES00 strategy, but dar accounts for the Danish ab­stract anaphors which occur in much more con­texts than the English ones. Individual anaph­ors are resolved in dar following a novel strat­egy which combines models which identify high degree of salience with high degree of givenness (topicality) of entities in the hearer's cognitive model, e.g. (Grosz et al., 1995), with Hajicova et al.'s (1990) salience account which assigns the highest degree of salience to entities in the focal part of an utterance in Information Structure terms.<page local="2" global="234"/> These entities often introduce new in­formation in discourse.</p><p>In the present paper we describe an extended version of the DAR-algorithm accounting for dif­ferences in the reference of various types of Dan­ish demonstratives which we found analysing the uses of pronouns in three text collections (computer manuals, novels and newspaper ar­ticles) and three corpora of recorded naturally-occurring dialogues (the SL (Duncker and Her­mann, 1996), the BYSOO (Gregersen and Peder-sen, 1991) and the pid corpora (Jensen, 1989)). In the following we first discuss the background for our proposal (section 2) then we describe the extended DAR-algorithm (section 3). In sec­tion 4 we evaluate it and compare its perfor­mance with that of other known algorithms. Fi­nally we make some concluding remarks.</p></section><section number="2" title="Background for DAR"><p>In most applied approaches resolving pronom­inal anaphors mainly consists in the following steps: <b>1: </b>determining the anaphoric antecedent domain; <b>2: </b>choosing the most prominent or <i>salient </i>antecedent among possible candidates. Thus determining the degree of salience of dis­course elements, henceforth DEs, is essential to anaphor resolution. Although there is not al­ways an identity relation between linguistic an­tecedents and referents, we also follow this strat­egy, well aware that it is particularly problem­atic for resolving APAs (se especially (Webber, 1991)). Nearly all salience-based algorithms identify high degree of salience with high de­gree of givenness of DEs. In fact, although dif­ferent criteria are used for ranking DEs, such as linear order, hierarchy of grammatical roles, in­formation structure, Prince's Familiarity Scale (Prince, 1981), all algorithms assign the highest prominence to the DEs which are most topi­cal, known, bound, familiar and thus <i>given</i>,e.g. (Grosz et al., 1995; Brennan et al., 1987; Strube, 1998). Analysing the Danish data we found a restricted number of cases where high degree of salience did not correspond to high degree of topical ity, as it is the case in example <b>(1). (1) </b>A: <i>hvem...hvem arbejdede [din mor]i med? </i>(with whom... whom did [your mother]<i>i </i>work) B: <i>[Hun]i arbejdede med [vores nabo]k</i>([She]i worked with [our neighbour] <i>k</i>) <i>[Hun]k var enke ... havde tre s0nner </i>[bysoc] ([She]k was a widow... had three sons) In <b>(1) </b>the antecedent of the second occurrence of the pronoun <i>hun </i>(she) is the object <i>vores nabo </i>(our neighbour) which provides the information re­quested in the preceding question. This nominal is assigned lower prominence than the subject pronoun <i>hun </i>(she)inmostsalience models.</p><p>The only salience model which departs from the <i>givenness</i><footnote anchor="2"/> assumption has been proposed by Hajicova et al. (1990). Hajicova et al., in fact, assign the highest degree of salience to DEs in the focal part of an utterance in information structure terms (Sgall et al., 1986). These enti­ties often represent new information. Hajicova et al.'s approach is original and can account for the data in <b>(1), </b>but it is problematic from an applied point of view. In the first place it is difficult to determine the information structure of all utterances. Secondly, focal candidate an­tecedents are ranked highest in Hajicova et al.'s model, but they still compete with <i>given </i>can­didate antecedents in their system. Finally the data does not confirm that all entities in the fo­cal part of an utterance have the highest degree of accessibility.</p><p>We agree with Hajicova's insight, but in or­der to operationalise the influence of focality in a reliable way propose the following. Accessi­bility by default is connected with <i>givenness </i>as assumed in most algorithms. However, when speakers explicitly change the degree of accessi­bility of entities in discourse by marking them as salient with information structure related de­vices, these entities get the highest degree of salience and are proposed as the preferred an­tecedents of anaphors. In cases of explicit focus marking the shift of focus of attention is as co­herent as continuing speaking about the same entities, because it is preannounced to the ad­dressee. On the basis of the data we propose a list of identifiable constructions in which ex­plicit focus marking occurs.<footnote anchor="3"/> Examples from the list are the following:</p><p><b>a: </b>Entities referred to by NPs which in Danish are focally marked structurally (clefts, existen­tial and topicalised constructions). <b>b: </b>Entities referred to by NPs that follow fo­cusing adverbs.</p><p><b>c: </b>Entities focally marked by the prosody (if this information is available) and/or entities providing information requested in questions, as in <b>(1).</b><b></b></p><p>Giveness subsumes here concepts such as topicality and familiarity.</p><footnote label="3">Many of these constructions are also studied in the Information Structure and in some anaphora resolution literature, e.g. (Sidner, 1983).</footnote><page local="3" global="235"/><p>Givenness preference in Danish can be mod­elled by the hierarchy of verbal complements. In addition to salience preferences we found that parallelism can account for numerous uses of Danish anaphors.<footnote anchor="4"/> Inspired by the work of (Kameyama, 1996) we have defined a prefer­ence interaction model to be used in resolution. Our model is given in figure 1.<footnote anchor="5"/> The interac-</p><p>Parallel. D Focality D Pronom. chairQ Givenness</p><figure caption="Figure 1: Interaction of preferences"></figure><p>tion model states that givenness preferences are overridden by focality preference, when in con­flict, and that they all are overridden by paral­lelism.</p><p>dar also accounts for reference differences be­tween Danish demonstrative and personal pro­nouns. Weak (cliticised and unstressed) pro­nouns usually refer to the most salient entity in the utterance. Strong (stressed and demonstra­tive) pronouns emphasise or put in contrast the entities they refer to and/or indicate that their antecedents are not the most expected ones.<footnote anchor="6"/>Demonstratives preferentially refer to abstract entities, while personal pronouns preferentially refer to individual entities in ambiguous con­texts. All these differences are also accounted for in the literature on anaphora. However we also found more language-specific peculiarities in our data. Two examples of these pecular-ities are the following. The Danish demon­stratives <i>denne/dette/disse </i>(this common gen­der/this neuter gender/these) never corefer with a subject antecedent intrasententially. In the few cases where they have a subject antecedent in a preceding clause, there are no other an­tecedent competitors. The abstract anaphor <i>dette, </i>furthermore, is often used to refer to the last mentioned situation in the previous sen­tence, often expressed in a subordinated clause, and not to the whole sentence or to an abstract anaphor in the preceding sentence. The particular phenomena are also accounted for in dar.</p><footnote label="4">According to parallelism in adjacent utterances with parallel grammatical complements, the preferred an­tecedent of an anaphor in the second utterance is the linguistic expression in the first utterance with the same grammatical function.</footnote><footnote label="5">Commonsense preferences which override all the other preferences are not implemented.</footnote><footnote label="6">The most frequent Danish third person singular gen­der pronoun det can both be a personal pronoun (cor­responding to it) and a demonstrative pronoun (corre­sponding to this/that). In the latter case it is always stressed.</footnote><p>Approx. half of the APA occurrences in our dialogues refer to entities evoked by larger dis­course segments (more turn takings). Thus we follow Eckert and Strube's approach of mark­ing the structure of dialogues and searching for APA antecedents in the right frontier of the dis­course tree (Webber, 1991). dar presupposes different discourse structures for texts and dia­logues. dar follows the es00 and phora strat­egy of discriminating between IPAsandAPAs by rules looking at the semantic constraints on the predication contexts in which the anaphors occur. dar relies on more discriminating rules than es00, which were defined on the basis of large amounts of data and of the encodings of a large computational lexicon.</p><p>dar uses language-specific rules to account for Danish APAs. These occur in much more contexts than in English where elliptical con­structions or other anaphors such as <i>too </i>and <i>so </i>are used. Examples of Danish-specific uses of abstract anaphors are given in <b>(2)-(3).</b></p><p><b>(2) </b><i>Han var sulten. Det var jeg ikke. </i>[pid] (lit. He was hungry. That was I not) (My friends were hungry. I wasn't.) <b>(3) </b><i>Han kunne sv0mme, men det kunne hun ikke</i> (lit. He could swim, but it could she not) (He could swim, but she couldn't) A language-specific rule recognising APAsis the following: constructions with modal verbs and anobject,suchas <i>x skal man </i>(lit. <i>x </i>shall one) (one shall), <i>x vil man </i>(lit. <i>x </i>will one) (one will).</p></section><section number="3" title="The DAR Algorithm"><subsection number="3.1" title="Search Space and DE lists"><p>dar presupposes the discourse structure de­scribed by Grosz and Sidner (1986). The min­imal discourse unit is the utterance <i>U</i>. Para­graphs correspond to discourse segments in texts. In dialogues discourse segments were manually marked (se section 4). The dialogues were structured with <i>Synchronising Units </i><i>(SU)</i><i> </i>according to the definitions in ES00.</p><p>The immediate antecedent search space of a pronoun <i>x </i>in utterance <i>Un </i>is the previous utter­ance, <i>Un-</i>1 .If <i>Un </i>is the first component in <i>SUm</i>in dialogues the immediate search space for <i>x </i>is <i>SUm-1</i>. dar assumes two antecedent domains depending on whether the pronoun has or has not been recognised as an IPA. The antecedent domain for IPAsisfirst <i>Un-1 </i>and then the preceding utterances in the right frontier of the dis­course tree searched for in recency order.<page local="4" global="236"/><footnote anchor="7"/> The antecedent domain for APAs or anaphors which can both be IPAsand APAsis <i>Un-1</i>.</p><p>dar operates on two lists of DEs, the <i>Ilist </i>and the Alist.The <i>Ilist </i>contains the NPs re­ferred to in <i>Un-1 </i>ranked according to their de­gree of salience and enriched with information on gender, number, animacy and other sim­ple semantic types necessary to implement se-lectional restrictions. In the <i>Ilist </i>information about the grammatical role of nominals is pro­vided and strongly focally marked elements are indicated. The leftmost element in the <i>Ilist </i>is the most salient one. Givenness and focality preferences are accounted for in the <i>Ilist, </i>as il­lustrated in figure 2. Focally marked entities are put in front of the list while the remaining DEs are ordered according to verbal comple­ment order. Inside verbal complements nomi-nals are ordered according to their occurrence order as illustrated in the second row of the fig­ure. The abstract entities which are referred to by an APA in <i>Un-1 </i>or <i>SUm-1 </i>are encoded in the <i>Alist. </i>They are removed from the list af­ter a new utterance <i>(SU</i><i> </i>in dialogues) has been processed if they have not been mentioned in it. The context ranking for abstract entities is that proposed by Eckert and Strube (2000).</p></subsection><subsection number="3.2" title="The Algorithm and Its Functions"><p>dar consists of two different functions Re-solveDet and RESOLVElPA.The former is ap­plied if the actual pronoun <i>x </i>is third person singular neuter, while the latter is applied in all the remaining cases:</p><p>if <i>x </i>is <i>singular </i>&amp; <i>neuter </i>then go to ResolveDet(x) else go to ResolveIpa(x)</p><p>The main steps of ResolveIpa are given in figure 3. The ResolveIpa approach of indi­cating possible reference ambiguities resembles that proposed by Kameyama (1996). The main structure of the function ResolveDet is in­spired by es00. ResolveDet tests the pro­noun <i>x </i>using the IPA and APA discriminating rules discussed in section 2. ResolveDet is simplified in figure 4. ResolveIpa-neu is like ResolveIpa except that it returns if no NP an­tecedents are found in <i>Un-1 </i>(case A) so that ResolveApa can be applied. ResolveApa distinguishes between types of pronoun. If <i>x </i>is <i>weak, </i>the preferred antecedent is searched for among the elements indicated in the con­text ranking, unless it is the object of the verb <i>g0re </i>(do), modals, <i>have </i>(have) or the abstract subject in copula constructions. In these cases the pronoun is resolved to the VP of the ele­ment in the <i>A-list </i>or in the context ranking. If <i>x </i>is <i>strong </i>ResolveApa attempts to resolve or classify it as <i>vague </i>depending on the type of pronoun. This part of the algorithm is spe­cific to Danish and accounts for the fact that different strong pronouns preferentially refer to different abstract entities in the data. Resolved APAs are inserted into the <i>Alist. </i>In case of fail­ure ResolveApa returns so that ResolveIpa-neu can be applied. If both functions fail, the pronoun is classified as <i>vague.</i></p><footnote label="7">The search space in es00 is the preceding utterance for all pronouns.</footnote></subsection><subsection number="3.3" title="Some Examples"><p>In the following we look at the resolution of ex­ample <b>(1) </b>from section 2. The simplified <i>Ilists </i>and <i>Alist</i>s after each utterance has been pro­cessed are given in figure 5. <b>(1) </b>contains three SUs. <i>U2 </i>is an <b>I/A </b>thus it belongs to two syn­chronising units (SU1 and SU2). The <i>Ilist </i>after <i>U</i>1 has been processed, contains one element, <i>din mor </i>(your mother). In <i>U2 </i>the personal pronoun <i>hun </i>(she) occurs, thus ResolveIpa is applied. It resolves <i>hun </i>to the compatible NP in the <i>Ilist, din </i>mor.After <i>U2 </i>has been pro­cessed the <i>Ilist </i>contains two elements in this order: the focal marked entity <i>vores nabo </i>(our neighbour) and the pronoun <i>hun </i>(= din mor). ResolveIpa resolves the occurrence of the pro­noun <i>hun </i>(she) in <i>U3 </i>to the most salient can­didate NP in the <i>Ilist, vores nabo</i>.Herefo-cal preference overrides pronominal chain pref­erence. Example <b>(4) </b>contains the APA det.</p><p>Figure 5: <i>Ilist</i>sand<i>Alist</i>s for example <b>(1)</b> <b>(4):</b><b> </b><i>Du har svtert ved at se musemark0ren pa</i> <i>sktermen.</i><i> Hvordan klarer du det? </i>[edb] (You have difficulties seing the mouse-cursor</p><doubt alpha="52.9" length="17" tooSmall="False" monospace="0.0">SUV.Ui(I)U2(I/A):</doubt><p><i>U\ </i>: <i>hvem...hvem arbejdede din mor med? </i>(with whom... whom did your mother work) <i>Ilist:[din </i>mor] <i>Alist</i>:[]</p><doubt alpha="41.7" length="12" tooSmall="False" monospace="0.0">SU2: U2(I/A)</doubt><p>U2: <i>Hun arbejdede med vores nabo </i>(She worked with our neighbour) <i>Ilist: </i>[vores nabo,hun=din mor]</p><doubt alpha="62.5" length="8" tooSmall="False" monospace="0.0">Alist:[]</doubt><doubt alpha="44.4" length="9" tooSmall="False" monospace="0.0">SU3:U3(I)</doubt><p>U3: <i>Hun var enke ... havde tre s0nner </i>(She was a widow... had three sons) <i>Ilist: </i>[hun=vores nabo,tre s0nner] <b>FOCAL_MARKED &gt; SUBJECT &gt; OBJECT/PrepOBJECT &gt; OBJECT 2 &gt; OTHER COMPLS &gt; ADJUNCTS</b> <i>NCOMPL1 &gt;prec NCOMPL2 &gt;prec ■ ■■ &gt;prec NCOMPLn</i><page local="5" global="237"/></p><figure caption="Figure 2: Order ofDEsintheIlist"></figure><p>antecedent in <i>Ilist </i>for U^_ i or <i>Sm_ </i>1?</p><p>no antecedent look in prec.</p><p>apply preferences (1) parallelism?</p><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">i</doubt><p>ant. found return it ant. not found <i>x </i>=inferable</p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">/</doubt><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">l</doubt><doubt alpha="100.0" length="1" tooSmall="False" monospace="0.0">y</doubt><p>Figure 3: RESGLVEIFA (common-gend) on the screen (common-gend). How do you manage it/this (neuter gender))? The simplified Ilistsand Alistsafter thetwo utterances in <b>(4) </b>have been processed are pre­sented in figure 6.   After <i>U1 </i>has been pro-</p><p>Figure 6: <i>Ilist</i>sand<i>Alist</i>s for example <b>(4)</b> cessed there are two common gender singular NPs in the <i>Ilist, musemark0ren </i>(the mouse cursor) and <i>sktermen </i>(the screen). In <i>U2 </i>the singular neuter gender pronoun <i>det </i>(it) occurs, thus ResolveDet is applied. The pronoun is neither IPA nor APA according to the dis­criminating rules. ResolveDet attempts to find an individual antecedent of the weak pro­noun, applying the function ResolveIpa-neu. ResolveIpa-neu fails because the two DEsin the <i>Ilist </i>do not agree with the pronoun. Then the function ResolveApa resolves <i>x </i>looking at the context ranking. Being the <i>Alist </i>empty, <i>U</i>1, is proposed as antecedent. The resolved APA is added to the <i>Alist.</i></p></subsection></section><section number="4" title="Tests and Evaluation"><p>We have manually tested dar on randomly cho­sen texts and dialogues from our collections. The performance of dar on dialogues has been compared with that of Es00. The function for resolving IPAs(ResolveIpa) has similarly been tested on texts, where APAswereex-cluded. We have compared the obtained re­sults with those obtained by testing bfp (Bren-nan et al., 1987) and str98 (Strube, 1998). In all tests the intrasentential anaphors have been manually resolved and expletive and cat­aphoric uses of pronouns have been marked and excluded from the test. Dialogue act units were marked and classified by three annotators fol­lowing (Eckert and Strube, 2000). The relia­bility for the two annotation tasks (^-statistics (Carletta, 1996)) was of 0.94 and 0.90 respec­tively. Pronominal anaphors were marked, clas­sified and resolved by two annotators. The k-statistics for the pronoun classification was 0.86. In few cases (one in the texts and two in the dia­logues) where the annotators did not agree upon resolution, the pronouns were marked as am­biguous and were excluded from the test. The results obtained for bfp and str98 are given in table 1, while the results of dar's ResolveIpa are given in table 2. In the tables <b>CR </b>stands for "correctly resolved", <b>HR </b>stands for "resolved by humans", <b>RA </b>stands for "resolved over all", <b>P </b>stands for precision and <b>R </b>stands for recall. Because dar both classifies and resolves anaph-ors, both precision and recall (respect to hu­man resolution) are given in table 2. The re­sults indicate that ResolveIpa performs sig­nificantly better than bfp and str98 on the</p><p>1 anteced.</p><p>anteced.</p><doubt alpha="100.0" length="3" tooSmall="False" monospace="0.0">ore</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">Ilists</doubt><doubt alpha="100.0" length="6" tooSmall="False" monospace="0.0">return</doubt><p>and list ambig.</p><table caption="Figure 3: RESGLVEIFA" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>yes</p></td><td class="cell"><p></p></td><td class="cell"><p>no 1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1</p><p>return <i>y </i>= parallel candidate and candid. list</p></td><td class="cell"><p></p></td><td class="cell"><p>1</p><p>return <i>y = </i>leftmost cand. in <i>His </i>and c. list</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>x </i>is weak?</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>yes</p></td><td class="cell"><p>return second candidate and list ambig.</p></td><td class="cell"><p>no</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="6" global="238"/><p>type of x?</p><p>Figure 4: ResolveDet</p><p>Danish texts. The better performance of dar was due to the account of focal and parallelism preferences, of the different reference mecha­nisms of personal and demonstrative pronouns and to the enlarged resolution scope. Further­more dar recognises some generic pronouns and inferable pronouns and excludes them from res­olution, but often fails to recognise antecedent-less and inferable plural pronouns, because it finds a plural nominal in the preceding discourse and proposes it as antecedent. The lack of com-monsense knowledge explains many incorrectly resolved anaphors.    The results of the test of the dar algorithm on written texts are in ta­ble 3. These results are good compared with the results of the function ResolveIpa (table 2). The discriminating rules identify correctly IPAs and APAs in the large majority of the cases. Recognition failure often involves pronouns in contexts which are not covered by the discrim­inating rules. In particular dar fails to resolve singular neuter gender pronouns with distant antecedents and to identify vague anaphors, be­cause it always "finds" an antecedent in the con­text ranking. Correct resolution in these cases requires a deep analysis of the context. The results of applying dar and es00 on Danish di­alogues are reported in table 4.<footnote anchor="8"/> The results of the tests indicate that dar resolves IPAssig-nificantly better than ES00 (which uses STR98).</p><table caption="Table 1: Results ofbfpandstr98on texts"></table><table caption="Table 2: Results ofResolveIpaon texts"></table><footnote label="8">We extended es00 with the Danish-specific identifi­cation rules before applying it.</footnote><p>dar correctly resolves more Danish demonstra­tive pronouns than Es00, because it accounts for language-specific particularities. In general, however, the resolution results for APAsare similar to those obtained for Es00.Thisisnot surprising, because dar uses thesameresolu-tion strategy on these pronouns. dar performs better on texts than on dialogues. This reflects the more complex nature of dialogues. The re­sults indicate that the IPA/APA discriminat­ing rules also work well on dialogues. The cases of resolution failure were the same as for the texts. As an experiment we applied dar on the dialogues without relying on the predefined di­alogue structure. In this test the recognition of IPAsandAPAs was still good, however the suc­cess rate for IPAs was of 60.1 % and for APAs was of only 39.3%. Many errors were due to the fact that antecedents were searched for in the preceding discourse in linear order and that ungrounded utterances were included in the dis­course model.</p><table caption="Table 4: Results ofesÜÜanddaron dialogues"></table><table caption="Table 3: Results of DAR on texts" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>resolution IPA</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"><p><b>R</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>560</p></td><td class="cell"><p>651</p></td><td class="cell"><p>645</p></td><td class="cell"><p>86.02</p></td><td class="cell"><p>86.82</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>resolution APA</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"><p><b>R</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>68</p></td><td class="cell"><p>87</p></td><td class="cell"><p>77</p></td><td class="cell"><p>78.16</p></td><td class="cell"><p>88.31</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table caption="Table 1: Results of bfp and str98 on texts" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>algorithm</p></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>bfp</p></td><td class="cell"><p>513</p></td><td class="cell"><p>645</p></td><td class="cell"><p>79.53</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>STR98</p></td><td class="cell"><p>524</p></td><td class="cell"><p>645</p></td><td class="cell"><p>81.24</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table caption="Table 2: Results of ResolveIpa on texts" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"><p><b>R</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>575</p></td><td class="cell"><p>651</p></td><td class="cell"><p>645</p></td><td class="cell"><p>88.33</p></td><td class="cell"><p>89.14</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><table caption="Table 4: Results of esÜÜ and dar on dialogues" class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>resolution IPA</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Algorithm</p></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"><p><b>R</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ES00</p></td><td class="cell"><p>258</p></td><td class="cell"><p>411</p></td><td class="cell"><p>414</p></td><td class="cell"><p>62.77</p></td><td class="cell"><p>62.31</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>DAR</p></td><td class="cell"><p>289</p></td><td class="cell"><p>386</p></td><td class="cell"><p>414</p></td><td class="cell"><p>74.87</p></td><td class="cell"><p>68.81</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>resolution APA</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Algorithm</p></td><td class="cell"><p><b>CR</b></p></td><td class="cell"><p><b>RA</b></p></td><td class="cell"><p><b>HR</b></p></td><td class="cell"><p><b>P</b></p></td><td class="cell"><p><b>R</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ES00</p></td><td class="cell"><p>179</p></td><td class="cell"><p>286</p></td><td class="cell"><p>269</p></td><td class="cell"><p>62.59</p></td><td class="cell"><p>66.54</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>DAR</p></td><td class="cell"><p>199</p></td><td class="cell"><p>277</p></td><td class="cell"><p>269</p></td><td class="cell"><p>71.84</p></td><td class="cell"><p>73.98</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="7" global="239"/></section><section number="5" title="Concluding Remarks"><p>In this paper we presented dar, an algorithm for resolving IPAsandAPAsinDanishtexts and dialogues. In dar differences between the referential characteristics of Danish weak and strong pronouns are accounted for and a novel strategy for resolving individual anaphors is proposed. This strategy combines givenness with focality preferences to model salience and also accounts for parallelism preferences. dar performs significantly better on IPAsthan al­gorithms which only rely on givenness-based salience models.</p><p>dar extends the es00 strategy of classify­ing and resolving (some types of) APAs. The tests of dar indicate that the es00's approach of recognising APAsisalsopromisingfortexts and other languages than English.</p><p>dar has not been compared with phora which is the only abstract anaphora algorithm implemented. We find the algorithm very inter­esting because it addresses many of the same phenomena, but with different strategies. It would be useful to combine some of these strate­gies with the approaches proposed in dar and Es00 to improve the still problematic resolution of abstract anaphors.</p></section><references><p>S. F. Brennan, M. W. Friedman, and C. J. Pol­lard. 1987. A Centering Approach to Pro­nouns. In <i>Proceedings of the ACL'87, </i>pages 155-162, CA. D. Byron and J. Allen. 1998. Resolving demon­strative pronouns in the trains93 corpus. In <i>Proceedings of DA ARC 2, </i>pages 68-81. D. K. Byron. 2002. Resolving Pronominal Ref­erence to Abstract Entities. In <i>Proceedings of the ACL 2002. </i>J. Carletta. 1996. Assessing agreement on clas­sification tasks. The kappa statistic. In <i>Com­putational Linguistics, </i>22(2):249-254. D. Duncker and J. Hermann.  1996. Patien-tord og laegeord - saerord eller faellesord? <i>Manedsskrift for Praktisk Ltegegerning, </i>pages 1019-1030.</p><doubt alpha="64.4" length="45" tooSmall="False" monospace="0.0">M. Eckert and M. Strube. 2000. Dialogue acts,</doubt><p>synchronising units and anaphora resolution. <i>Journal of Semantics, </i>17:51-89. F. Gregersen and I. L. Pedersen, editors. 1991. <i>The Copenhagen study in urban sociolinguis-tics. </i>Reitzel. B. J. Grosz and C. L. Sidner. 1986. Attention,</p><p>Intentions, and the Structure of Discourse. <i>Computational Linguistics, </i>12(3):175-284.</p><p>B. Grosz, A. K. Joshi, and S. Weinstein. 1995. Centering:A Framework for Modeling the Lo­cal Coherence of Discourse. <i>Computational Linguistics, </i>21(2):203-225.</p><p>J. K. Gundel, N. Hedberg, and R. Zacharski. 1993. Cognitive status and the form of re­ferring expressions in discourse. <i>Language</i>, 69(2):274-307. E. Hajicovä, P. Kubofi, and V. Kubofi. 1990. Hierarchy of Salience and Discourse Analy­sis and Production. In H. Karlgren, editor, <i>Proceedings of COLING'90, </i>volume III, pages 144-148, Helsinki. K. A. Jensen. 1989. Projekt invandrerdansk.</p><p>Technical report, Copenhagen University. M. Kameyama.  1996. Indefeasible Semantics and Defeasible Pragmatics. In M. Kanazawa, C. Pifion, and H. de Stwart, editors, <i>Quanti­fiers, Deduction and Context, </i>pages 111-138.</p><p>CSLI, Stanford, CA.</p><p>C. Navarretta. 2002. Combining Informa­tion Structure and Centering-based Mod­els of Salience for Resolving Intersenten-tial Pronominal Anaphora. In A. Branco, T. McEnery, and R.Mitkov, editors, <i>Pro­ceedings of the 4th DAARC, </i>pages 135-140. Edigoes Colibri.</p><p>C. Navarretta. 2004. . In <i>Proceedings ofRefer-ence Resolution and Its Applications Work­shop </i>at ACL 2004, Barcelona, Spain. E. F. Prince. 1981. Toward a taxonomy of given-new information. In P. Cole, editor, <i>Radical Pragmatics, </i>Academic Press, pages 223-255.</p><p>C. Sidner. 1983. Focusing in the Comprehen­sion of Definite Anaphora. In M. Brady and R. Berwick, editors, <i>Computational Models of Discourse, </i>MIT Press, pages 267-330. P. Sgall, E. Hajicovä, and J. Panevovä. 1986. <i>The Meaning of the Sentence in its Semantic and Pragmatic Aspects. </i>Reidel, Dordrecht.</p><p>M. Strube. 1998. Never Look Back: An Al­ternative to Centering. In <i>Proceedings of COLING-ACL'98, </i>II, pages 1251-1257.</p><p>M. Strube and C. Muüller. 2003. A ma­chine learning approach to pronoun resolu­tion in spoken dialogue. In <i>Proceedings ofthe ACL'03, </i>pages 168-175. B. L. Webber. 1991. Structure and Osten­sion in the Interpretation of Discourse Deixis. <i>Natural Language and Cognitive Processes,</i> 6(2):107-135, January.</p></references></body></article>