<?xml version="1.0" encoding="UTF-8" ?>
 <volume id="W06">
   <paper id="3800">
        <title>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</title>
        <editor><first>Rada</first><last>Mihalcea</last></editor>
        <editor><first>Dragomir</first><last>Radev</last></editor>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <url>http://www.aclweb.org/anthology/W/W06/W06-38</url>
        <bibtype>book</bibtype>
        <bibkey>TextGraphs:2006</bibkey>
   </paper>
   <paper id="3801">
        <title>A Graphical Framework for Contextual Search and Name Disambiguation in Email</title>
        <author><first>Einat</first><last>Minkov</last></author>
        <author><first>William</first><last>Cohen</last></author>
        <author><first>Andrew</first><last>Ng</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>1&#8211;8</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3801</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>minkov-cohen-ng:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3802">
        <title>Graph Based Semi-Supervised Approach for Information Extraction</title>
        <author><first>Hany</first><last>Hassan</last></author>
        <author><first>Ahmed</first><last>Hassan</last></author>
        <author><first>Sara</first><last>Noeman</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>9&#8211;16</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3802</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>hassan-hassan-noeman:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3803">
        <title>Graph-Based Text Representation for Novelty Detection</title>
        <author><first>Michael</first><last>Gamon</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>17&#8211;24</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3803</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>gamon:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3804">
        <title>Measuring Aboutness of an Entity in a Text</title>
        <author><first>Marie-Francine</first><last>Moens</last></author>
        <author><first>Patrick</first><last>Jeuniaux</last></author>
        <author><first>Roxana</first><last>Angheluta</last></author>
        <author><first>Rudradeb</first><last>Mitra</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>25&#8211;28</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3804</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>moens-EtAl:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3805">
        <title>A Study of Two Graph Algorithms in Topic-driven Summarization</title>
        <author><first>Vivi</first><last>Nastase</last></author>
        <author><first>Stan</first><last>Szpakowicz</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>29&#8211;32</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3805</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>nastase-szpakowicz:2006:TextGraphs1</bibkey>
   </paper>
   <paper id="3806">
        <title>Similarity between Pairs of Co-indexed Trees for Textual Entailment Recognition</title>
        <author><first>Fabio Massimo</first><last>Zanzotto</last></author>
        <author><first>Alessandro</first><last>Moschitti</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>33&#8211;36</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3806</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>zanzotto-moschitti:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3807">
        <title>Learning of Graph-based Question Answering Rules</title>
        <author><first>Diego</first><last>Molla</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>37&#8211;44</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3807</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>molla:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3808">
        <title>Seeing stars when there aren't many stars: Graph-based semi-supervised learning for sentiment categorization</title>
        <author><first>Andrew</first><last>Goldberg</last></author>
        <author><first>Xiaojin</first><last>Zhu</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>45&#8211;52</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3808</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>goldberg-zhu:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3809">
        <title>Random-Walk Term Weighting for Improved Text Classification</title>
        <author><first>Samer</first><last>Hassan</last></author>
        <author><first>Carmen</first><last>Banea</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>53&#8211;60</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3809</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>hassan-banea:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3810">
        <title>Graph-based Generalized Latent Semantic Analysis for Document Representation</title>
        <author><first>Irina</first><last>Matveeva</last></author>
        <author><first>Gina-Anne</first><last>Levow</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>61&#8211;64</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3810</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>matveeva-levow:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3811">
        <title>Synonym Extraction Using a Semantic Distance on a Dictionary</title>
        <author><first>Philippe</first><last>Muller</last></author>
        <author><first>Nabil</first><last>Hathout</last></author>
        <author><first>Bruno</first><last>Gaume</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>65&#8211;72</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3811</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>muller-hathout-gaume:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3812">
        <title>Chinese Whispers - an Efficient Graph Clustering Algorithm and its Application to Natural Language Processing Problems</title>
        <author><first>Chris</first><last>Biemann</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>73&#8211;80</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3812</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>biemann:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3813">
        <title>Matching syntactic-semantic graphs for semantic relation assignment</title>
        <author><first>Vivi</first><last>Nastase</last></author>
        <author><first>Stan</first><last>Szpakowicz</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>81&#8211;88</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3813</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>nastase-szpakowicz:2006:TextGraphs2</bibkey>
   </paper>
   <paper id="3814">
        <title>Evaluating and optimizing the parameters of an unsupervised graph-based WSD algorithm</title>
        <author><first>Eneko</first><last>Agirre</last></author>
        <author><first>David</first><last>Mart&#237;nez</last></author>
        <author><first>Oier</first><last>L&#243;pez de Lacalle</last></author>
        <author><first>Aitor</first><last>Soroa</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>89&#8211;96</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3814</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>agirre-EtAl:2006:TextGraphs</bibkey>
   </paper>
   <paper id="3815">
        <title>Context Comparison as a Minimum Cost Flow Problem</title>
        <author><first>Vivian</first><last>Tsang</last></author>
        <author><first>Suzanne</first><last>Stevenson</last></author>
        <booktitle>Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing</booktitle>
        <month>June</month>
        <year>2006</year>
        <address>New York City</address>
        <publisher>Association for Computational Linguistics</publisher>
        <pages>97&#8211;104</pages>
        <url>http://www.aclweb.org/anthology/W/W06/W06-3815</url>
        <bibtype>inproceedings</bibtype>
        <bibkey>tsang-stevenson:2006:TextGraphs</bibkey>
   </paper>
 </volume>
