LINGUIST List 11.779

Wed Apr 5 2000

Calls: Parsing Systems(COLING), Finite-State Phonology

Editor for this issue: Jody Huellmantel <jodylinguistlist.org>


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

Directory

  1. John Carroll, Workshop on Efficiency in Large-scale Parsing Systems at COLING 2000
  2. Jason Eisner, Finite-State Phonology (SIGPHON 2000)

Message 1: Workshop on Efficiency in Large-scale Parsing Systems at COLING 2000

Date: Wed, 5 Apr 2000 13:33:36 +0100
From: John Carroll <johncacogs.susx.ac.uk>
Subject: Workshop on Efficiency in Large-scale Parsing Systems at COLING 2000

 EFFICIENCY IN LARGE-SCALE PARSING SYSTEMS

 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.

Organisers

 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
 efficiency.

 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
 systems.


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 `elspscoli.uni-sb.de', 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 http://www.coling.org/.
 See http://www.coling.org/workshops.html for information about
 workshops.
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue

Message 2: Finite-State Phonology (SIGPHON 2000)

Date: Wed, 5 Apr 2000 10:14:11 -0400 (EDT)
From: Jason Eisner <jasoncs.rochester.edu>
Subject: Finite-State Phonology (SIGPHON 2000)

	 -----------------------------------------------
	 SECOND CALL FOR PAPERS

	 FINITE-STATE PHONOLOGY : SIGPHON 2000
	 Fifth Meeting of the ACL Special Interest Group
	 in Computational Phonology

	 A full-day workshop held at
	 COLING 2000
	 Luxembourg, 6 August 2000
	 -----------------------------------------------

WORKSHOP DESCRIPTION
- ------------------
The workshop will focus on the growing role of finite-state methods 
in computational phonology. Excellent papers in other areas of
computational phonology are also welcome.

Sample topics:

* Finite-state formalizations of phonological frameworks
* Algorithms and theorems about finite-state phonological formalisms
* Embedding finite-state phonology in NLP or speech systems
* The application of finite-state methods to empirical description 
 (including difficulties, representational encodings, and software tools)
* Phonologically motivated extensions to finite-state techniques
* Research bearing on whether the finite-state assumptions are 
 empirically adequate or computationally necessary

A principal goal of the workshop is to bring together researchers who
are working in different phonological frameworks:

Finite-state methods have been more-or-less persuasively applied to a
range of frameworks, from derivational approaches to Optimality
Theory. This shared formal underpinning exposes crucial differences
among the frameworks (Frank & Satta 1998), and also suggests deep
similarities (Karttunen 1998).

We hope that the workshop's focus on formalizations using finite-state
techniques, which are well understood in themselves, will facilitate
further discussion of the theoretical and empirical virtues of
different frameworks. We are particularly interested in the potential
for new or hybrid frameworks.

ORGANIZERS AND PROGRAM COMMITTEE
- -------------------------------
Lauri Karttunen, Xerox Research Centre Europe (program chair)
Markus Walther, University of Marburg (local chair)
Jason Eisner, University of Rochester (organization)
Alain Theriault, Universite de Montreal (administration)
Daniel Albro, University of California at Los Angeles
Steven Bird, University of Pennsylvania 
John Coleman, University of Oxford 
Dan Jurafsky, University of Colorado
Andras Kornai, Belmont Research, Cambridge MA

Reviewing will be blind. The program chair may invite additional
reviewers as necessary to obtain relevant expertise and avoid
conflicts of interest.

More information about SIGPHON is available at
http://www.cogsci.ed.ac.uk/sigphon

Questions and correspondence may be sent to:

 Jason Eisner
 Department of Computer Science
 University of Rochester
 P.O. Box 270226
 Rochester, NY 14627 USA
 tel: +1 (716) 275-7230
 fax: +1 (716) 461-2018
 email: sigphon2000cs.rochester.edu 

PAPER SUBMISSION
- --------------
Content: Papers should be original, topical, and clear. Completed
work is preferable to intended work, but in any event the paper should
clearly indicate the state of completion of the reported results.

Length: Submissions should be full-length papers, up to a maximum of
10 pages. (The final version in the proceedings should incorporate
reviewers' suggestions and may be up to 12 pages.)

Layout: Except for length, papers should adhere to Coling 2000
formatting guidelines, at http://www.coling.org/format.html .
Be careful not to disclose authorship.

Electronic submission procedure: 
1. Turn your paper into a PDF file, or if necessary a Postscript file.
 See http://www.coling.org/postscript.html for help.
2. Email this file as an attachment to 
 theriaalmagellan.umontreal.ca (Alain Theriault)
 The body of the email should give title, author(s), abstract,
 and contact information. The subject line should include the
 word "SIGPHON."

Hardcopy submission procedure:
If electronic submission is impossible, please send FOUR hardcopies to
 Alain Theriault
 Departement de linguistique et de traduction
 Universite de Montreal
 C.P. 6128, succursale Centre-ville
 Montreal, Quebec
 H3C 3J7
 CANADA
along with a page giving title, author(s), abstract, and contact
information. Note that electronic submission is strongly preferred!

IMPORTANT DATES
- -------------
Mon. 1 May Deadline for receipt of submissions
Wed. 24 May Authors notified of acceptance
Wed. 21 June Deadline for receipt of camera-ready copy
Sun. 6 Aug. Workshop held in Luxembourg at Coling 2000

Coling 2000 - http://www.coling.org
SIGPHON - http://www.cogsci.ed.ac.uk/sigphon
Luxembourg - http://www.coling.org/lux-links.html
Registration fees and details - http://www.coling.org/reg.html

Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue