HLT/NAACL 2006 TextGraphs: Graph-based Algorithms for Natural Language Processing

Graph-based Algorithms for
Natural Language Processing

Workshop at HLT/NAACL 2006
New York City, June 9 2006

The workshop will be held on June 9, 2006, in conjunction with HLT/NAACL in New York City. A tutorial on "Graph-based Algorithms for Natural Language Processing and Information Retrieval" will be presented at the same conference on June 4, 2006.

Preliminary Schedule

    9:00-9:25 A Graphical Framework for Contextual Search and Name Disambiguation in Email
    Einat Minkov, William Cohen and Andrew Ng
    9:25-9:50 Graph Based Semi-Supervised Approach for Information Extraction
    Hany Hassan, Ahmed Hassan and Sara Noeman
    9:50-10:15 Graph-Based Text Representation for Novelty Detection
    Michael Gamon
    10:15-10:30 Measuring Aboutness of an Entity in a Text
    Marie-Francine Moens
    10:30-11:00 BREAK
    11:00-11:15 A Study of Two Graph Algorithms in Topic-driven Summarization
    Vivi Nastase and Stan Szpakowicz
    11:15-11:30 Similarity between Pairs of Co-indexed Trees for Textual Entailment
    Recognition Fabio Massimo Zanzotto and Alessandro Moschitti

    11:30-12:30 Invited talk: LILLIAN LEE, Cornell University

    2:00-2:25 Learning of Graph-based Question Answering Rules
    Diego Molla
    2:25-2:50 Seeing stars when there aren't many stars: Graph-based semi-supervised learning for sentiment categorization
    Andrew Goldberg and Xiaojin Zhu
    2:50-3:15 Random-Walk Term Weighting for Improved Text Classification
    Samer Hassan and Carmen Banea
    3:15-3:30 Graph-based Generalized Latent Semantic Analysis for Document
    Representation Irina Matveeva and Gina-Anne Levow
    4:00-4:25 Synonym Extraction Using a Semantic Distance on a Dictionary
    Philippe Muller, Nabil Hathout and Bruno Gaume
    4:25-4:50 Chinese Whispers - an Efficient Graph Clustering Algorithm and its Application to Natural Language Processing Problems
    Chris Biemann
    4:50-5:15 Matching syntactic-semantic graphs for semantic relation assignment
    Vivi Nastase and Stan Szpakowicz
    5:15-5:40 Evaluating and optimizing the parameters of an unsupervised graph-based WSD algorithm
    Eneko Agirre, David Martmnez, Oier Lspez de Lacalle and Aitor Soroa
    5:40-6:05 Context Comparison as a Minimum Cost Flow Problem
    Vivian Tsang and Suzanne Stevenson

Call for Papers

Graph theory is a well studied discipline, and so is the field of natural language processing. Traditionally, these two areas of study have been perceived as distinct, with different algorithms, different applications, and different potential end-users. However, as recent research work has shown, the two disciplines are in fact intimately connected, with a large variety of natural language processing applications finding efficient solutions within graph-theoretical frameworks.

The goal of this workshop is to provide a forum for researchers working on problems related to the use of graph-based algorithms for natural language processing. The workshop is expected to bring together people working on areas as diverse as lexical semantics, text summarization, text mining, ontology construction, clustering and learning, connected by the common underlying theme consisting of the use of graph-theoretical methods for text processing tasks.

We invite submissions of papers addressing the following or related topics:

  • Graph algorithms for text understanding
  • Graph matching for text mining
  • Graph algorithms for thesaurus construction
  • Graph methods for identification of semantic relations
  • Graph-based ranking algorithms for language processing
  • Random walk methods
  • Graph algorithms for information extraction
  • Spectral learning or clustering applied to NLP
  • Graph algorithms for word sense disambiguation
  • Lexical chaining algorithms and applications

Organization Committee

Dragomir Radev, U. Michigan, radev at umich.edu
Rada Mihalcea, U. North Texas, rada at cs.unt.edu

Program Committee

Lada Adamic, University of Michigan
Razvan Bunescu, University of Texas at Austin
Timothy Chklovski, USC / Information Sciences Institute
Diane Cook, University of Texas at Arlington
Inderjit Dhillon, University of Texas at Austin
Beate Dorow, University of Stuttgart, Germany
Gael Dias, Universidade da Beira Interior, Portugal
Kevin Gee, University of Texas at Arlington
Lise Getoor, University of Maryland
Gunes Erkan, University of Michigan
John Lafferty, Carnegie Mellon University
Lillian Lee, Cornell University
Andrew McCallum, University of Massachusetts
Bo Pang, Cornell University
Patrick Pantel, USC / Information Sciences Institute
Paul Tarau, University of North Texas
Simone Teufel, University of Cambridge
Lucy Vanderwende, Microsoft Research
Florian Wolf, Cambridge University, UK
Dominic Widdows, Maya Design
Hongyuan Zha, Penn State
Xiaojin Zhu, University of Wisconsin

Important Dates

Regular paper submissions March 10
Short paper submissions March 17
Notification of acceptance April 7
Camera-ready papers April 26
Workshop June 9

Author Instructions

Camera-ready papers should be submitted by April 26, 2006. Please make sure you format your paper according to the NAACL 2006 guidelines. Submit your camera-ready paper using this online submission form, and the passcode that was sent to you by email. For any questions, please contact Drago or Rada.