<?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="96"/><title>UBIU: A Language-Independent System for Coreference Resolution</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 96-99, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Zhekova" givenname="Desislava"><org  name="University of Bremen"/></author><author surname="Kübler" givenname="Sandra"><org  name="University of Bremen"/></author></firstpageheader><frontmatter><p><b>UBIU: A Language-Independent System for Coreference Resolution</b></p><p><b>Desislava Zhekova</b></p><p>University of Bremen</p><p>zhekova@uni-bremen.de</p></frontmatter><abstract>We present UBIU, a language indepen­dent system for detecting full coreference chains, composed of named entities, pro­nouns, and full noun phrases which makes use of memory based learning and a fea­ture model following Rahman and Ng (2009). UBIU is evaluated on the task "Coreference Resolution in Multiple Lan­guages" (SemEval Task 1 (Recasens et al., 2010)) in the context of the 5 th Interna­tional Workshop on Semantic Evaluation. </abstract></header><body><section number="1" title="Introduction"><p>Coreference resolution is a field in which major progress has been made in the last decade. Af­ter a concentration on rule-based systems (cf. e.g. (Mitkov, 1998; Poesio et al., 2002; Markert and Nissim, 2005)), machine learning methods were embraced (cf. e.g. (Soon et al., 2001; Ng and Cardie, 2002)). However, machine learning based coreference resolution is only possible for a very small number of languages. In order to make such resources available for a wider range of languages, language independent systems are often regarded as a partial solution. To this day, there have been only a few systems reported that work on multiple languages (Mitkov, 1999; Harabagiu and Maio-rano, 2000; Luo and Zitouni, 2005). However, all of those systems were geared towards predefined language sets.</p><p>In this paper, we present a language indepen­dent system that does require syntactic resources for each language but does not require any effort for adapting the system to a new language, except for minimal effort required to adapt the feature ex­tractor to the new language. The system was com­pletely developed within 4 months, and will be ex­tended to new languages in the future.</p><p><b>Sandra Kubier</b></p><p>Indiana University</p><footnote>skuebler@indiana.edu</footnote></section><section number="2" title="UBIU: System Structure"><p>The UBIU system aims at being a language-independent system in that it uses a combination of machine learning, in the form of memory-based learning (MBL) in the implementation of TiMBL (Daelemans et al., 2007), and language indepen­dent features. MBL uses a similarity metric to find the <i>k </i>nearest neighbors in the training data in order to classify a new example, and it has been shown to work well for NLP problems (Daelemans and van den Bosch, 2005). Similar to the approach by Rahman and Ng (2009), classification in UBUI is based on mention pairs (having been shown to work well for German (Wunsch, 2009)) and uses as features standard types of linguistic annotation that are available for a wide range of languages and are provided by the task.</p><p>Figure 1 shows an overview of the system. In preprocessing, we slightly change the formatting of the data in order to make it suitable for the next step in which language dependent feature extrac­tion modules are used, from which the training and test sets for the classification are extracted. Our approach is untypical in that it first extracts the heads of possible antecedents during feature ex­traction. The full yield of an antecedent in the test set is determined after classification in a separate module. During postprocessing, final decisions are made concerning which of the mention pairs are considered for the final coreference chains.</p><p>In the following sections, we will describe fea­ture extraction, classification, markable extraction, and postprocessing in more detail.</p><subsection number="2.1" title="Feature Extraction"><p>The language dependent modules contain finite state expressions that detect the heads based on the linguistic annotations. Such a language module re­quires a development time of approximately 1 per­son hour in order to adapt the regular expressions<page local="2" global="97"/></p><p>#     Feature Description</p><p><b>^Trainingjàet^^ Test Set</b></p><p><b>MB Classifier</b></p><p><b>/Resulting </b><b>Feature^ </b>V_<b><u>Vectors</u>_</b><i>J</i></p><p><b>(^Postprocessor^)'</b> <b>Final Results ^)</b></p><p><i><u>Ç </u></i><b><u>Test Set ^</u></b></p><p><b>Markables "N <u>y Extractor </u></b><u>y</u></p><p>Figure 1 : Overview of the system.</p><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">1</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">2</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">3</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">4</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">5</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">6</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">7</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">8</doubt><doubt alpha="0.0" length="1" tooSmall="False" monospace="0.0">9</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">10</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">11</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">12</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">13</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">14</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">15</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">16</doubt><doubt alpha="0.0" length="2" tooSmall="False" monospace="0.0">17</doubt><doubt alpha="0.0" length="8" tooSmall="False" monospace="0.0">18 19 20</doubt><doubt alpha="0.0" length="20" tooSmall="False" monospace="0.0">21 22 23 24 25 26 27</doubt><p><i>rrij - </i>the antecedent <i>rrik - </i>the mention to be resolved</p><p>Y if <i>rrij </i>is pron.; else N</p><p>Y if <i>rrij </i>is subject; else N</p><p>Y if <i>rrij </i>is a nested NP; else N number - Sg. or PI.</p><doubt alpha="63.0" length="46" tooSmall="False" monospace="0.0">gender - F(emale), M(ale), N(euter), U(nknown)</doubt><p>Y if <i>rrik </i>is a pronoun; else N</p><p>Y if <i>rrik </i>is a nested NP; else N semantic class - extracted from the NEs in the data the nominative case of <i>rrik </i>if pron.; else NA</p><p>C if the mentions are the same string; else I</p><p>C if one mention is a substring of the other; else I</p><p>C if both mentions are pron. and same string; else I</p><p>C if both mentions are both non-pron. and same string; else I values for f. 6 for <i>rrij </i>and <i>rrik </i>values for f. 7 for <i>rrij </i>and <i>rrik </i>values for f. 3 for <i>rrij </i>and <i>rrik </i>values for f. 5 for <i>rrij </i>and <i>rrik </i>values for f. 10 for <i>rrij </i>and <i>rrik </i>values for f. 11 for <i>rrij </i>and <i>rrik</i></p><p>to the given language data (different POS tagsets, differences in the provided annotations). This is the only language dependent part of the system.</p><p>We decided to separate the task of finding heads of markables, which then serve as the basis for the generation of the feature vectors, from the identi­fication of the scope of a markable. For the En­glish sentence "Any details or speculation on who specifically, we don't know that at this point.", we first detect the heads of possible antecedents, for example "details". However, the decision on the scope of the markable, i.e. the decision between "details" or "Any details or speculation on who specifically" is made in the postprocessing phase.</p><p>One major task of the language modules is the check for cyclic dependencies. Our system re­lies on the assumption that cyclic dependencies do not occur, which is a standard assumption in de­pendency parsing (Kiibler et al., 2009). However, since some of the data sets in the multilingual task contained cycles, we integrated a module in the preprocessing step that takes care of such cycles.</p><p>After the identification of the heads of mark­ables, the actual feature extraction is performed. The features that were used for training a classifier (see Table 1) were selected from the feature pool presented by Rahman and Ng (2009). Note that not all features could be used for all languages. We extracted all the features in Table 1 if the cor­responding type of annotation was available; oth­erwise, a null value was assigned.</p><table caption="Table 1: The pool of features for all languages."></table><p>A good example for the latter concerns the gen­der information represented by feature 7 (for pos­sible feature values cf. Table 1). Let us consider the following two entries - the first from the Ger­man data set and the second from English:</p><p>1. Regierung Regierung Regierung NN NN cas=d|num=sg|gend=fem cas=d|num=sg|gend=fem 31 31 PN PN . . .</p><p>2. law _ law NN NN NN NN 2 2 PMOD PMOD . . .</p><p>Extracting the value from entry 1, where <i>gend=fem, </i>is straightforward; the value being <i>F. </i>However, there is no gender information provided in the English data (entry 2). As a result, the value for feature 7 is <i>U </i>for the closed task.</p></subsection><subsection number="2.2" title="Classifier Training"><p>Based on the features extracted with the feature extractors described above, we trained TiMBL. Then we performed a non-exhaustive parameter</p><p>C if both m. are pron. and either same pron. or diff. w.r.t. case; NA if at least one is not pron.; else I C if the mentions agree in number; I if not; NA if the number for one or both is unknown C if both m. are pron. I if neither C if both m. are proper nouns; I if neither; else NA C if the m. have same sem. class; I if not; NA if the sem. class for one or both m. is unknown sentence distance between the mentions  concat. concat. concat. concat. concat. concat.</p><page local="3" global="98"/><p>optimization across all languages. Since a full op­timization strategy would lead to an unmanageable number of system runs, we concentrated on vary­ing <i>k,</i><i> </i>the number of nearest neighbors considered in classification, and on the distance metric.</p><p>Furthermore, the optimization is focused on language independence. Hence, we did not op­timize each classifier separately but selected pa­rameters that lead to best average results across all languages of the shared task. In our opinion, this ensures an acceptable performance for new languages without further adaptation. The optimal settings for all the given languages were <i>k=?&gt;</i><i> </i>with the Overlap distance and gain ratio weighting.</p></subsection><subsection number="2.3" title="Markable Extraction"><p>The markable extractor makes use of the depen­dency relation labels. Each syntactic head together with all its dependents is identified as a separate markable. This approach is very sensitive to incor­rect annotations and to dependency cycles in the data set. It is also sensitive to differences between the syntactic annotation and markables. In the Dutch data, for example, markables for named en­tities (NE) often exclude the determiner, a nominal dependent in the dependency annotation. Thus, the markable extractor suggests the whole phrase as a markable, rather than just the NE.</p><p>During the development phase, we determined experimentally that the recognition of markables is one of the most important steps in order to achieve high accuracy in coreference resolution: We conducted an ablation study on the training data set. We used the <i>train </i>data as training set and the <i>devel </i>data as testing set and investigated three different settings:</p><p>1. Gold standard setting: Uses gold markable annotations as well as gold linguistic anno­tations (upper bound).</p><p>2. Gold linguistic setting: Uses automatically determined markables and gold linguistic an­notations.</p><p>3. Regular setting: Uses automatically deter­mined markables and automatic linguistic in­formation.</p><p>Note that we did not include all six languages: we excluded Italian and Dutch because there is no gold-standard linguistic annotation provided. The results of the experiment are shown in Table 2. From those results, we can conclude that the figures in Setting 2 and 3 are very similar. This means that the deterioration from gold to automat­ically annotated linguistic information is barely visible in the coreference results. This is a great advantage, since gold-standard data has always proved to be very expensive and difficult or im­possible to obtain. The information that proved to be extremely important for the performance of the system is the one providing the boundaries of the markables. As shown in Table 2, the latter leads to an improvement of about 20%, which is observ­able in the difference in the figures of Setting 1 and 2. The results for the different languages show that it is more important to improve markable de­tection than the linguistic information.</p></subsection><subsection number="2.4" title="Postprocessing"><p>In Section 2.1, we described that we decided to separate the task of finding heads of markables from the identification of the scope of a markable. Thus, in the postprocessing step, we perform the latter (by the Markables Extractor module) as well as reformat the data for evaluation.</p><p>Another very important step during postpro­cessing is the selection of possible antecedents. In cases where more than one mention pair is classi­fied as coreferent, only the pair with highest con­fidence by TiMBL is selected. Since nouns can be discourse-new, they do not necessarily have a coreferent antecedent; pronouns however, require an antecedent. Thus, in cases where all possible antecedents for a given pronoun are classified as not coreferent, we select the closest subject as an­tecedent; or if this heuristic is not successful, the antecedent that has been classified as not corefer­ent with the lowest confidence score (i.e. the high­est distance) by TiMBL.</p><table caption="Table 2: Experiment results (as Fl scores) where IM is identification of mentions and S - Setting." 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><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>s</p></td><td class="cell"><p>Lang.</p></td><td class="cell"><p>IM</p></td><td class="cell"><p>CEAF</p></td><td class="cell"><p>MUC</p></td><td class="cell"><p>B<footnote anchor="3"/></p></td><td class="cell"><p>BLANC</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Spanish</p></td><td class="cell"><p>85.8</p></td><td class="cell"><p>52.3</p></td><td class="cell"><p>12.8</p></td><td class="cell"><p>60.0</p></td><td class="cell"><p>56.9</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>1</b></p></td><td class="cell"><p>Catalan</p></td><td class="cell"><p>85.5</p></td><td class="cell"><p>56.0</p></td><td class="cell"><p>11.6</p></td><td class="cell"><p>59.4</p></td><td class="cell"><p>51.9</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>1</p></td><td class="cell"><p>English</p></td><td class="cell"><p>96.1</p></td><td class="cell"><p>68.7</p></td><td class="cell"><p>17.9</p></td><td class="cell"><p>74.9</p></td><td class="cell"><p>52.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>German</p></td><td class="cell"><p>93.6</p></td><td class="cell"><p>70.0</p></td><td class="cell"><p>19.7</p></td><td class="cell"><p>73.4</p></td><td class="cell"><p>64.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Spanish</p></td><td class="cell"><p>61.0</p></td><td class="cell"><p>41.5</p></td><td class="cell"><p>11.3</p></td><td class="cell"><p>42.4</p></td><td class="cell"><p>48.7</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Catalan</p></td><td class="cell"><p>60.8</p></td><td class="cell"><p>40.5</p></td><td class="cell"><p>9.6</p></td><td class="cell"><p>41.4</p></td><td class="cell"><p>48.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Z</p></td><td class="cell"><p>English</p></td><td class="cell"><p>72.1</p></td><td class="cell"><p>54.1</p></td><td class="cell"><p>11.6</p></td><td class="cell"><p>57.3</p></td><td class="cell"><p>50.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>German</p></td><td class="cell"><p>57.7</p></td><td class="cell"><p>45.5</p></td><td class="cell"><p>12.2</p></td><td class="cell"><p>45.7</p></td><td class="cell"><p>44.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Spanish</p></td><td class="cell"><p>61.2</p></td><td class="cell"><p>41.8</p></td><td class="cell"><p>10.3</p></td><td class="cell"><p>42.3</p></td><td class="cell"><p>48.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>a</p></td><td class="cell"><p>Catalan</p></td><td class="cell"><p>61.3</p></td><td class="cell"><p>40.9</p></td><td class="cell"><p>11.3</p></td><td class="cell"><p>41.9</p></td><td class="cell"><p>48.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>D</i></p></td><td class="cell"><p>English</p></td><td class="cell"><p>71.9</p></td><td class="cell"><p>54.7</p></td><td class="cell"><p>13.3</p></td><td class="cell"><p>57.4</p></td><td class="cell"><p>50.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>German</p></td><td class="cell"><p>57.5</p></td><td class="cell"><p>45.4</p></td><td class="cell"><p>12.0</p></td><td class="cell"><p>45.6</p></td><td class="cell"><p>44.2</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><td class="cell"></td></tr></table><page local="4" global="99"/><p>Table 3: Final system results (as Fl scores) where IM is identification of mentions and S - Setting. For more details cf. (Recasens et al., 2010).</p></subsection></section><section number="3" title="Results"><p>UBIU participated in the closed task (i.e. only in­formation provided in the data sets could be used), in the gold and regular setting. It was one of two systems that submitted results for all languages, which we count as preliminary confirmation that our system is language independent. The final re­sults of UBIU are shown in Table 3. The figures for the identification of mentions show that this is an area in which the system needs to be improved. The errors in the gold setting result from an in­compatibility of our two-stage markable annota­tion with the gold setting. We are planning to use a classifier for mention identification in the future.</p><p>The results for coreference detection show that English has a higher accuracy than all the other languages. We assume that this is a consequence of using a feature set that was developed for En­glish (Rahman and Ng, 2009). This also means that an optimization of the feature set for individ­ual languages should result in improved system performance.</p></section><section number="4" title="Conclusion and Future Work"><p>We have presented UBIU, a coreference resolution system that is language independent (given differ­ent linguistic annotations for languages). UBIU is easy to maintain, and it allows the inclusion of new languages with minimal effort.</p><p>For the future, we are planning to improve the system while strictly adhering to the language in­dependence. We are planning to separate pronoun and definite noun classification, with the possibil­ity of using different feature sets. We will also investigate language independent features and im­plement a markable classifier and a negative in­stance sampling module.</p><table 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><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Lang.</p></td><td class="cell"><p>S</p></td><td class="cell"><p>IM</p></td><td class="cell"><p>CEAF</p></td><td class="cell"><p>MUC</p></td><td class="cell"><p>B<footnote anchor="3"/></p></td><td class="cell"><p>BLANC</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Catalan</p></td><td class="cell"><p>G</p></td><td class="cell"><p>84.4</p></td><td class="cell"><p>52.3</p></td><td class="cell"><p>11.7</p></td><td class="cell"><p>58.8</p></td><td class="cell"><p>52.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>R</p></td><td class="cell"><p>59.6</p></td><td class="cell"><p>38.4</p></td><td class="cell"><p>8.6</p></td><td class="cell"><p>40.9</p></td><td class="cell"><p>47.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>English</p></td><td class="cell"><p>G</p></td><td class="cell"><p>95.9</p></td><td class="cell"><p>65.7</p></td><td class="cell"><p>20.5</p></td><td class="cell"><p>74.8</p></td><td class="cell"><p>54.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>R</p></td><td class="cell"><p>74.2</p></td><td class="cell"><p>53.6</p></td><td class="cell"><p>14.2</p></td><td class="cell"><p>58.7</p></td><td class="cell"><p>51.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>German</p></td><td class="cell"><p>G</p></td><td class="cell"><p>94.0</p></td><td class="cell"><p>68.2</p></td><td class="cell"><p>21.9</p></td><td class="cell"><p>75.7</p></td><td class="cell"><p>64.5</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>R</p></td><td class="cell"><p>57.6</p></td><td class="cell"><p>44.8</p></td><td class="cell"><p>10.4</p></td><td class="cell"><p>46.6</p></td><td class="cell"><p>48.0</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Spanish</p></td><td class="cell"><p>G</p></td><td class="cell"><p>83.6</p></td><td class="cell"><p>51.7</p></td><td class="cell"><p>12.7</p></td><td class="cell"><p>58.3</p></td><td class="cell"><p>54.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>R</p></td><td class="cell"><p>60.0</p></td><td class="cell"><p>39.4</p></td><td class="cell"><p>10.0</p></td><td class="cell"><p>41.6</p></td><td class="cell"><p>48.4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Italian</p></td><td class="cell"><p>R</p></td><td class="cell"><p>40.6</p></td><td class="cell"><p>32.9</p></td><td class="cell"><p>3.6</p></td><td class="cell"><p>34.8</p></td><td class="cell"><p>37.2</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Dutch</p></td><td class="cell"><p>R</p></td><td class="cell"><p>34.7</p></td><td class="cell"><p>17.0</p></td><td class="cell"><p>8.3</p></td><td class="cell"><p>17.0</p></td><td class="cell"><p>32.3</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><td class="cell"></td></tr></table></section><references><p>Walter Daelemans and Antal van den Bosch. 2005. <i>Memory Based Language Processing. </i>Cambridge University Press.</p><p>Walter Daelemans, Jakub Zavrel, Ko van der Sloot, and Antal van den Bosch. 2007. TiMBL: Tilburg mem­ory based learner - version 6.1 - reference guide. Technical Report ILK 07-07, Induction of Linguis­tic Knowledge, Computational Linguistics, Tilburg University.</p><p>Sanda M. Harabagiu and Steven J. Maiorano. 2000. Multilingual coreference resolution. In <i>Proceedings ofANLP 2000, </i>Seattle, WA.</p><p>Sandra Kübler, Ryan McDonald, and Joakim Nivre. 2009. <i>Dependency Parsing. </i>Morgan Claypool.</p><p>Xiaoqiang Luo and Imed Zitouni. 2005. Multi­lingual coreference resolution with syntactic fea­tures. In <i>Proceedings of HLT/EMNLP 2005, </i>Van­couver, Canada.</p><p>Katja Markert and Malvina Nissim. 2005. Comparing knowledge sources for nominal anaphora resolution.</p><p><i>Computational Linguistics, </i>31(3).</p><p>Ruslan Mitkov. 1998. Robust pronoun resolu­tion with limited knowledge. In <i>Proceedings of ACL/COLING 1998, </i>Montreal, Canada.</p><p>Ruslan Mitkov. 1999. Multilingual anaphora resolu­tion. <i>Machine Translation, </i>14(3-4):281-299.</p><p>Vincent Ng and Claire Cardie. 2002. Improving machine learning approaches to coreference resolu­tion. In <i>Proceedings of ACL 2002, </i>pages 104-111, Philadelphia, PA.</p><p>Massimo Poesio, Tomonori Ishikawa, Sabine Schulte im Walde, and Renata Vieira. 2002. Acquiring lexical knowledge for anaphora resolu­tion. In <i>Proceedings of LREC 2002, </i>Las Palmas, Gran Canada.</p><p>Altaf Rahman and Vincent Ng. 2009. Supervised mod­els for coreference resolution. In <i>Proceedings of EMNLP 2009, </i>Singapore.</p><p>Marta Recasens, Llufs Marquez, Emili Sapena, M.Antönia Marti, Mariona Taulé, Véronique Hoste, Massimo Poesio, and Yannick Versley. 2010. Semeval-2010 task 1: Coreference resolution in multiple languages. In <i>Proceedings of the 5th International Workshop on Semantic Evaluations (SemEval-2010), </i>Uppsala, Sweden.</p><p>Wee Meng Soon, Hwee Tou Ng, and Daniel Chung Yong Lim. 2001. A machine learning ap­proach to coreference resolution of noun phrases. <i>Computational Linguistics, </i>27(4): 521-544.</p><p>Holger Wunsch. 2009. <i>Rule-Based and Memory-Based Pronoun Resolution for German: A Compar­ison and Assessment of Data Sources. </i>Ph.D. thesis, Universität Tübingen.</p></references></body></article>