<?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="713"/><title>Creating a Coreference Resolution System for Italian</title><author surname="Poesio" givenname="Massimo"><org  name="Meio University" country="Japan" city="Nago"/></author><author surname="Uryupina" givenname="Olga"><org  name="University of Trento" country="Italy" city="Trento"/></author><author surname="Versley" givenname="Yannick"><org  name="University of Tubingen" country="Germany" city="Tubingen"/></author></firstpageheader><frontmatter><p><b>Creating a Coreference Resolution System for Italian</b></p><p><b>Massimo Poesio*, Olga Uryupina*, Yannick Versley*</b></p><p>*CiMeC, University of Trento *SFB 833, University of Tübingen massimo.poesio@unitn.it, uryupina@gmail.com, versley@sfs.üni-tüebingen.de</p></frontmatter><abstract>This paper summarizes our work on creating a full-scale coreference resolution (CR) system for Italian, using BART - an open-source modular CR toolkit initially developed for English corpora. We discuss our experiments on language-specific issues of the task. As our evaluation experiments show, a language-agnostic system (designed primarily for English) can achieve a performance level in high forties (MUC F-score) when re-trained and tested on a new language, at least on gold mention boundaries. Compared to this level, we can improve our F-score by around 10% introducing a small number of language-specific changes. This shows that, with a modular coreference resolution platform, such as BART, one can straightforwardly develop a family of robust and reliable systems for various languages. We hope that our experiments will encourage researchers working on coreference in other languages to create their own full-scale coreference resolution systems - as we have mentioned above, at the moment such modules exist only for very few languages other than English. </abstract></header><body><section number="1." title="Introduction"><p>This paper presents a coreference resolution system for Ital­ian based on BART (Versley et al., 2008). BART is a mod­ular toolkit for coreference resolution that supports state-of-the-art statistical approaches to the task and enables ef­ficient feature engineering. BART has originally been cre­ated and tested for English, but its flexible modular archi­tecture ensures its portability to other languages and do­mains.</p><p>Even though the basic linguistic notions used in coreference resolution - noun phrases, pronouns, definiteness markers - can be found in a relatively wide range of Germanic and Romance languages, relatively few coreference sys­tems aim at covering multiple languages using one coref-erence component. While there are linguistic differences to English within these languages - Romance languages such as Italian and Spanish have zero subjects and empty pro­nouns - the greater obstacle seems to be that the tagsets or syntactic structures commonly used for processing these languages differ considerably, but also that processing tools which are easily available for English are not available or difficult to obtain for other languages. In comparison to lan­guages such as Japanese, however, where definiteness is not marked and zero pronouns can also occur in object position, which makes detailed syntactic-semantic information nec-essary,<footnote anchor="1"/> the variance within Germanic and Romance lan­guages is small enough that it is conceivable that one sys­tem could perform coreference resolution on all of these languages.</p><p>Several researchers did attempt to port their approach to dif­ferent languages: (Mitkov et al., 1998), who present adap­tations of the MARS approach to pronoun resolution to Polish and Arabic, (Harabagiu and Maiorano, 2000), who perform resolution on English-Romanian parallel texts, and (Luo and Zitouni, 2005), who perform coreference resolu­tion on English, Chinese and Arabic data and compare the usefulness of syntactic features for coreference resolution in these languages.</p><footnote label="1">Some earlier experiments on coreference resolution in Japanese, such as (Aone and Bennett, 1995) just assume that zero pronouns are given beforehand, an assumption of questionable practical value.</footnote><p>To our knowledge, we present a first full-scale coreference resolution system for Italian. Note also that the system op­erates on a raw text and not on a set of predefined "gold" mentions - i.e. it can be used as a module for a real-world application.</p><p>We have evaluated our system on the ICab dataset (Magnini et al., 2007). The data comprise articles for four days of the "Adige" newspaper. We have used one day of "Adige" for testing and three days - for training. On this split, our system achieves a performance level of 56.1% (MUC F-score). On a similar task for English, state-of-the-art tools achieve a slightly better performance level (low to mid six­ties for system mentions on MUC or ACE corpora). How­ever, an English system retrained on Italian dataset yields much lower performance figures. We believe that our im­provement over this baseline is due, in part, to the special­ized mention tagger (Biggio et al., 2009) and, in part, to a number of language-specific adjustments to BART dis­cussed below.</p></section><section number="2." title="BART Architecture"><p>The BART coreference resolution toolkit has four main components: preprocessing pipeline, feature extraction module, decoder and encoder. In addition, an independent <i>LanguagePlugin </i>module handles all the language specific information and is accessible from any component. The architecture is shown on Figure 1. Each module can be accessed independently and thus adjusted to leverage the system's performance on a particular language or domain. The preprocessing pipeline converts an input document into a sequence of mentions with assigned properties (number, gender etc). The feature extraction module describes pairs of mentions (M<b>j, </b>M<b>j}</b>, <b><i>i &lt; j </i></b>as a set of features. Table 1 shows the features we used. All the feature values are computed automatically, without any manual intervention.</p><page local="2" global="714"/><figure caption="Figure 1: BART architecture"></figure><p>Features</p><p>MentionType<b>(Mj) </b>MentionType<b>(Mj) </b>SemanticClass<b>(Mj) </b>SemanticClass<b>(Mj) </b>FirstMention<b>(Mj) </b>GenderAgreement<b>(Mj, Mj </b>) NumberAgreement<b>(Mj, Mj </b>) AnimacyAgreement<b>(Mj,Mj </b>) Alias<b>(Mj,Mj </b>) Apposition<b>(Mj,Mj </b>) StringMatch<b>(Mj,Mj </b>) <u>Distance<b>(Mi,Mj)</b></u><b>_</b></p><p>Table 1: Features used by our Italian version of BART: eachfeature describes a pair of mentions (M<b>j, </b>M<b>j </b>}, i &lt; j, where M<b>j </b>is a candidate antecedent and M<b>j </b>is a candidate anaphor</p><p>The decoder generates training examples through a process of sample selection and learns a pairwise classifier. Finally, the encoder generates testing examples through a (possi­bly distinct) process of sample selection, runs the classifier and partitions the mentions into coreference chains given the classifier decisions. For our Italian CR engine, we have tested a number of machine learning algorithms and decod­ing/encoding techniques and have opted for the setting ad­vocated by (Soon et al., 2001) with the maximum entropy classifier.</p></section><section number="3." title="Developing language-specific components"><p>Our work on adapting BART to Italian has followed two directions: we have developed an Italian language plugin and a new preprocessing pipeline.</p><p><b>Aliasing. </b>Our work on the language plugin has mostly included investigating Italian-specific aliasing techniques. A list of company/person designators (e.g., "S.p.a" or "D.ssa") has been manually crafted. We have extracted from the training data several patterns of name variants for the locations (e.g. "Provincia di Verona" and "Verona" may refer to the same place). Finally, we have relaxed ab­breviation constraints, allowing for lower-case characters in the abbreviations - a pattern that is much more common for Italian than for English. Table 2 shows the per­formance level for a coreference resolution system based on the aliasing feature alone. The first row represents a language-agnostic approach to aliasing, the second row -the aliasing approach we have created specifically for Ital­ian. It suggests that, although a universal aliasing algorithm is able to resolve some coreference links between named entities, creating a language-specific module boosts the sys­tem's performance substantially. It should be noted that most coreference resolution systems rely on a very generic approach to aliasing, ignoring any language-specific struc­tures of proper names. We believe that a coreference reso­lution system could benefit a lot from a more sophisticated aliasing algorithm (cf., for example, (Patman and Thomp­son, 2003) for a related study from the text mining commu­nity).</p><table caption="Table 2: Performance (MUC and CEAF-&lt;/&gt;4recall, preci­sion and F scores) of thealiasfeature"></table><p><b>Preprocessing. </b>We have run several evaluation exper­iments with the different designs of the preprocessing pipeline to optimize the system's performance on the Icab dataset. For the testing data, the preprocessing is straight­forward: we input all the chunks detected by a mention tagger (Biggio et al., 2009) and assign relevant properties from the output of the corresponding component of a shal­low NLP toolkit for Italian, TextPro (Pianta et al., 2007). The properties include part-of-speech, morphological fea­tures such as number and gender, as well as semantic type. For the training data, however, this strategy leads to only a moderate performance level for two main reasons. First, manually annotated ("gold") mentions tend to be much longer than those extracted by the tagger ("system mentions"). This means that our matching and aliasing models, learned directly from the gold training data, may<page local="3" global="715"/></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></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Recall</p></td><td class="cell"><p>Precision</p></td><td class="cell"><p>F</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>MUC</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>universal</p></td><td class="cell"><p>17.2</p></td><td class="cell"><p>79.2</p></td><td class="cell"><p>28.3</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>22.5</p></td><td class="cell"><p>90.7</p></td><td class="cell"><p>36.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>CEAF</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>universal</p></td><td class="cell"><p>80.6</p></td><td class="cell"><p>43.4</p></td><td class="cell"><p>56.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>68.7</p></td><td class="cell"><p>49.3</p></td><td class="cell"><p>57.4</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><p>Table 3: System performance (MUC and CEAF-&lt;/&gt;4 re­call, precision and F scores) with different preprocessing pipelines</p><p>Table 4: Performance (MUC and CEAF-&lt;/&gt;4 recall, preci­sion and F scores) on gold mentions: language agnostic vs. Italian-specific system not be applicable to automatically extracted testing men­tions. To rectify this problem, we have adjusted gold men­tion boundaries to cover only the heads, not the extents. Second, the training data contain a number of embedding mentions - chunks that span over another mention (e.g. "la popolazione del sobborgo" is a mention of the second level of embedding, as it spans over another, first-level mention, "sobborgo"). Our mention tagger can only extract mentions of the first and second level of embedding. We have, there­fore, discarded all the gold mentions with the higher level of embedding to avoid unnecessary noise. We have also investigated an alternative parsing pipeline: within this strategy, the chunks, suggested by the men­tion tagger, are mapped into NP-like nodes in automati­cally constructed parse trees<footnote anchor="2"/>. The parser consisted on a dependency parser (Nivre et al., 2007) trained on a con­verted version of the Torino University Treebank (Bosco and Lombardo, 2006), a freely available treebank for Ital­ian, and a dependency-to-constituency converter. Because of the vastly larger size of iCab compared to the Torino tree-bank (ICab contains about 350.000 tokens of text whereas the treebank only contains about 60.000 tokens), the sim­pler and faster chunking-based pipeline works much better than full parsing (cf. Table 3). This is in stark contrast to English, where state-of-the-art parsing gives better results than even the best available chunkers. Note that morphological preprocessing for Italian, on the contrary, is much easier and more accurate, than for En­glish: thus, we can reliably obtain mentions properties (e.g., gender) from a shallow morphological analyzer (TextPro).</p><footnote label="2">This pipeline shows reliable performance on English data.</footnote><p>Table 5: Performance (MUC and CEAF-&lt;/&gt;4 recall, preci­sion and F scores) on automatically extracted mentions</p></section><section number="4." title="Evaluation"><p>Our evaluation experiments follow two objectives. First, we want to find out, to what extent a generic language-agnostic system can be used for a new language. Second, we try to estimate the impact of our language-specific ad­justments.</p><p>For the language-agnostic setting, we have taken the En­glish version of BART, substituted all the external modules (tokenizer, POS-tagger, parser) with the Italian ones and re-trained the system on the Evalita dataset. Unfortunately the results are very moderate mainly due to the annota­tion guidelines: following the ACE standards, only a subset of mentions has been annotated for coreference, making a data-specific mention tagger a vital part of the system. We have therefore started by comparing our language-agnostic and Italian systems on the gold mentions (Table 4). In our last experiment we rely on an Italian mention tag­ger (Biggio et al., 2009) to detect mention boundaries. As this is a crucial part of a coreference-resolution system, we cannot replicate this experiment for the language-agnostic system. Table 5 shows the system performance with the mention tagger (i.e. when operating on a raw text, with no manual intervention).</p><p>As our evaluation experiments show, a language-agnostic system (designed primarily for English) can achieve a per­formance level in high forties (MUC F-score) when re­trained and tested on a new language, at least on gold mention boundaries. Though this number might appear low, note that it is a baseline requiring no extra engineer­ing. Compared to this level, we can improve our F-score by around 10% introducing a small number of language-specific changes. This shows that, with a modular corefer-ence resolution platform, such as BART, one can straight­forwardly develop a family of robust and reliable systems for various languages. We hope that our experiments will encourage researchers working on coreference in other lan­guages to create their own full-scale coreference resolution systems - as we have mentioned above, at the moment such modules exist only for very few languages other than En­glish.</p></section><section number="5." title="Conclusion"><p>To summarize, we have extended BART (Versley et al., 2008) to create a full-scale coreference resolution system for Italian. Its modular design has allowed us to port a large part of the functionality from English to Italian with no changes - we have only had to run a series of evalu­ation runs on the development set to pick the best decod­ing/encoding scheme and the most suitable machine learning algorithm from a range of solutions provided in the BART distribution.<page local="4" global="716"/> We have therefore focused ourattention on improving the system's performance by taking care of language-specific properties. Our experiments have shown that a coreference resolution system based on shallow pre­processing works better for a morphologically rich lan­guage, such as Italian, compared to parsing-oriented strate­gies more common for English.</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></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Recall</p></td><td class="cell"><p>Precision</p></td><td class="cell"><p>F</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>MUC</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>shallow pipeline</p></td><td class="cell"><p>45.8</p></td><td class="cell"><p>72.3</p></td><td class="cell"><p>56.1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>parsing pipeline</p></td><td class="cell"><p>42.4</p></td><td class="cell"><p>73.7</p></td><td class="cell"><p>53.8</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>CEAF</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>shallow pipeline</p></td><td class="cell"><p>62.1</p></td><td class="cell"><p>64.6</p></td><td class="cell"><p>63.3</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>parsing pipeline</p></td><td class="cell"><p>63.8</p></td><td class="cell"><p>62.0</p></td><td class="cell"><p>62.9</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 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></p></td><td class="cell"><p>Recall</p></td><td class="cell"><p>Precision</p></td><td class="cell"><p>F</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>MUC</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>45.8</p></td><td class="cell"><p>72.3</p></td><td class="cell"><p>56.1</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>CEAF</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>62.1</p></td><td class="cell"><p>64.6</p></td><td class="cell"><p>63.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></tr></table><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></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>Recall</p></td><td class="cell"><p>Precision</p></td><td class="cell"><p>F</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>MUC</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>universal</p></td><td class="cell"><p>34.9</p></td><td class="cell"><p>76.6</p></td><td class="cell"><p>47.9</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>46.8</p></td><td class="cell"><p>71.1</p></td><td class="cell"><p>56.4</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p></p></td><td class="cell"><p>CEAF</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>universal</p></td><td class="cell"><p>82.4</p></td><td class="cell"><p>51.7</p></td><td class="cell"><p>63.6</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>78.6</p></td><td class="cell"><p>57.4</p></td><td class="cell"><p>66.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></tr></table></section><references><p>Chinatsu Aone and Scott Bennett. 1995. Evaluating au­tomated and manual acquisition of anaphora resolution strategies. In <i>Proc.ACL 1995.</i></p><p>Silvana Marianela Bernaola Biggio, Claudio Giuliano, Massimo Poesio, Yannick Versley, Olga Uryupina, and Roberto Zanoli. 2009. Local entity detection and recog­nition task. In <i>Proceedings of Evalita-2009.</i></p><p>Cristina Bosco and Vincenzo Lombardo. 2006. Comparing linguistic information in treebank annotations. In <i>LREC 2006.</i></p><p>Sanda Harabagiu and Steven Maiorano. 2000. Multilin­gual coreference resolution. In <i>Sixth Applied Natural Language Processing Conference (ANLP-NAACL 2000).</i></p><p>Xiaoqiang Luo and Imed Zitouni. 2005. Multi-lingual coreference resolution with syntactic features. In <i>Pro­ceedings ofHuman Language Technology Conference and Conference on Empirical Methods in Natural Lan­guage Processing.</i></p><p>Bernardo Magnini, Emanuele Pianta, Manuela Speranze, Valentina Bartalesi Lenzi, and Rachele Sprugnoli. 2007. Italian content annotation bank (i-cab). Technical report, FBK-IRST.</p><p>Ruslan Mitkov, Lamia Belguith, and Malgorzata Stys. 1998.   Multilingual robust anaphora resolution. In <i>EMNLP 1998.</i><i></i></p><p>Joakim Nivre, Johan Hall, Jens Nilsson, Atanas Chanev, Gulsen Eryigit, Sandra Kubler, Svetoslav Marinov, and Erwin Marsi. 2007. Maltparser: A language-independent system for data-driven dependency parsing. <i>Natural Language Engineering, </i>13(2):95-135.</p><p>Frankie Patman and Paul Thompson. 2003. Names: A new frontier in text mining. In <i>Proceedings of the 1st NSF/NIJSymposium, </i>pages 27-38.</p><p>Emanuele Pianta, Christian Girardi, and Roberto Zanoli. 2007. The textpro tool suite. Technical report, FBK-</p><p>IRST.</p><p>Wee Meng Soon, Hwee Tou Ng, and Daniel Chung Yong Lim. 2001. A machine learning approach to coreference resolution of noun phrases. <i>Computational Linguistics (Special Issue on Computational Anaphora Resolution), </i>27(4):521-544.</p><p>Yannick Versley, Simone Paolo Ponzetto, Massimo Poesio, Vladimir Eidelman, Alan Jern, Jason Smith, Xiaofeng Yang, and Alessandro Moschitti. 2008. BART: A mod­ular toolkit for coreference resolution. In <i>Proceedings ofthe Linguistic Coreference Workshop at the Interna­tional Conference on Language Resources and Evalua­tion (LREC-2008).</i></p></references></body></article>