LINGUIST List 11.698

Tue Mar 28 2000

Calls: Comp Ling/Corpora, Comp Ling/Parsing systems

Editor for this issue: Jody Huellmantel <>

As a matter of policy, LINGUIST discourages the use of abbreviations or acronyms in conference announcements unless they are explained in the text.


  1. Thorsten Brants, Comp Ling/Linguistically Interpreted Corpora (LINC-2000)
  2. John Carroll, Efficiency in Large-scale Parsing Systems (Coling 2000)

Message 1: Comp Ling/Linguistically Interpreted Corpora (LINC-2000)

Date: Mon, 27 Mar 2000 09:24:08 +0200 (MET DST)
From: Thorsten Brants <thorstenCoLi.Uni-SB.DE>
Subject: Comp Ling/Linguistically Interpreted Corpora (LINC-2000)


		 A workshop to be held at Coling 2000
 the 18th International Conference on Computational Linguistics

		 Luxembourg, 6 August 2000


Anne Abeille (IUF &amp; Talana, Paris)
Thorsten Brants (Saarland University)
Hans Uszkoreit (Saarland University and DFKI Saarbruecken)


Large linguistically interpreted (annotated) corpora are urgently
needed in an increasing number of projects in the field of
computational linguistics. Many groups are currently creating corpus
resources for a variety of languages. These corpora are used for a
broad range of different applications and theoretical
investigations. We aim to bring together these activities in order to
facilitate advanced and efficient corpus annotations which will
provide are-usable resources.

The aim of the workshop is to exchange and propagate research results
in the field of corpus annotation, taking into account different types
of information. The Workshop on Linguistically Interpreted Corpora
focues on
- tools & techniques for syntactic annotation,
- tagging and parsing methods that aim at semi-automatic annotation,
- error detection and correction,
- inter-annotator-agreement,
- representation formats and standards,
- browsing corpora and searching for instances of linguistic phenomena,

PLEASE NOTE: Submissions on semantic annotation should not be submitted 
 to this workshop, but rather to the COLING Workshop on 
	 Semantic Annotation and Intelligent Content.


Anne Abeille (co-chair), Paris
Thorsten Brants (co-chair), Saarbruecken
John Carroll , Sussex
Lionel Clement, Paris
Tomaz Erjavec, Ljubljana
Frank Keller, Edinburgh
Laurent Romary, Nancy
Geoffrey Sampson, Sussex
Hans Uszkoreit (co-chair), Saarbruecken
Jean Veronis, Aix-en-Provence
Atro Voutilainen, Helsinki
Jakub Zavrel, Antwerp


April 30, 2000: paper submission deadline
May 30, 2000: notification of acceptance
June 15, 2000: publication of workshop program
Autust 6, 2000: workshop


Please send submissions in English as Postscript or PDF (preferably by
email) to the address below. Maximum length is 8 pages, formatted in
the same way as for the main conference (see for paper format guidelines).

 Thorsten Brants <>
 Saarland University
 Computational Linguistics
 Im Stadtwald, Geb. 17
 D-66123 Saarbr´┐Żcken
 phone: +49/681/302-4682 
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue

Message 2: Efficiency in Large-scale Parsing Systems (Coling 2000)

Date: Fri, 24 Mar 2000 15:03:56 +0000
From: John Carroll <>
Subject: Efficiency in Large-scale Parsing Systems (Coling 2000)


 a workshop to be held at

 Coling 2000, the 18th International Conference
 on Computational Linguistics

 Luxembourg, 5 August 2000

This workshop will focus on methods, grammars, and data to facilitate
empirical assessment and comparison of the efficiency of large-scale
parsing systems.


 John Carroll, University of Sussex;
 Robert C. Moore, Microsoft Research; and
 Stephan Oepen, Saarland University.

Workshop Scope and Aims

 Interest in large-scale, grammar-based parsing has recently seen a 
 large increase, in response to the complexities of language-based
 application tasks such as speech-to-speech translation, and enabled by
 the availability of more powerful computational resources and by
 efforts in large-scale and collaborative grammar engineering.

 There are two main paradigms in the evaluation and comparison of the
 performance of parsing algorithms and implemented systems: (i) the
 formal, complexity-theoretic analysis of how an algorithm behaves,
 typically focussing on worst-case time and space complexity bounds;
 and (ii) the empirical study of how properties of the parser and input
 (possibly including the grammar used) affect actual, observed run-time

 It has often been noted that the theoretical study of algorithms alone
 does not (yet) suffice to provide an accurate prediction about how a
 specific algorithm will perform in practice, when used in conjunction
 with a specific grammar (or type of grammar), and when applied to a
 particular domain and task. Therefore, empirical assessment of
 practical parser performance has become an established technique and
 continues to be the primary means of comparison among algorithms. At
 the same time, system competence (i.e. coverage and overgeneration
 with respect to a particular grammar and test set) cannot be decoupled
 from the evaluation of parser performance, because two algorithms can
 only be compared meaningfully when they really solve the same problem,
 i.e. either directly use the same grammar, or at least achieve
 demonstrably similar competence on the same test set.

 The focus of the workshop is on large-scale parsing systems and
 precise, comparable empirical assessment. We envisage discussion at
 the workshop will centre on methods, reference grammars, and test data
 that will facilitate improved comparability. The workshop is intended
 to bring together representatives from sites working on grammar-based 
 parsing (both in academic and corporate environments) to help the
 field focus and converge on a common, pre-standard practice in
 empirical assessment of parsing systems.

 The organisers solicit contributions (in the form of extended
 abstracts; see below) on the following topics:

 - descriptions of grammars and data used to assess parser efficiency;
 - methods and tools for empirical assessment of parser efficiency; and 
 - comparisons of the efficiency of different large-scale parsing

Programme Committee

 John Carroll, University of Sussex, UK;
 Gregor Erbach, Telecommunications Research Centre Vienna, Austria;
 Bernd Kiefer, DFKI Saarbruecken, Germany;
 Rob Malouf, Rijkuniversitet Groningen, The Netherlands;
 Robert Moore, Microsoft Research, USA;
 Gertjan van Noord, Rijkuniversitet Groningen, The Netherlands;
 Stephan Oepen, Saarland University, Germany;
 Gerald Penn, Bell Labs Research, USA;
 Hadar Shemtov, Xerox Palo Alto Research Centre, USA; and
 Kentaro Torisawa, Tokyo University, Japan.

Submission Requirements

 Submissions should be extended abstracts of not more than 4 pages.
 Submission is by email, to `', in the form of
 either Postscript or RTF. The submission deadline is April 22, 2000. 

 For each submission a separate plain ascii text email message should
 be sent, containing the following information:

 NAME : Author name(s);
 TITLE : Title of the paper;
 NOTE : Any relevant instructions;
 EMAIL : Email of the contact author; and
 ABSTRACT: Abstract of the paper.

 Contributions accepted for the workshop will be published in extended
 form in a proceedings volume; we expect that final manuscripts will be
 around 8 to 10 pages in length. The proceedings will be distributed
 both in printed and on-line formats.

Important Dates

 22-apr-00 Paper submission deadline;
 20-may-00 Notification of acceptance;
 17-jun-00 Camera-ready papers due;
 05-aug-00 Workshop at Luxemburg.

Conference Information

 General information about Coling 2000 is at
 See for information about
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue