LINGUIST List 11.1453

Fri Jun 30 2000

Confs: Computational Phonology (SIGPHON 2000)

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


Please keep conferences announcement as short as you can; LINGUIST will not post conference announcements which in our opinion are excessively long.

Directory

  1. Jason Eisner, Computational Phonology (SIGPHON 2000)

Message 1: Computational Phonology (SIGPHON 2000)

Date: Thu, 29 Jun 2000 14:12:40 -0400 (EDT)
From: Jason Eisner <jasoncs.rochester.edu>
Subject: Computational Phonology (SIGPHON 2000)

This August 6 workshop is held in conjunction with the COLING 2000
conference (which begins July 31), but may be attended separately. 
Now is the time to register and make your travel arrangements!

	 -----------------------------------------------
	 CALL FOR PARTICIPATION

	 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
- ------------------
This workshop's papers, talks, panels, and discussions will focus on
the growing role of finite-state methods in computational phonology.

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 from
different traditions. We are particularly interested in understanding
and reconciling the formal linguistic and computational virtues of
different phonological frameworks.

PROGRAM
- -----

Taking Primitive Optimality Theory Beyond the Finite State
Daniel M. Albro

 Extends the Primitive Optimality Theory formalism (Eisner 1997) to
 handle reduplication. Each candidate set becomes a Multiple Context-
 Free Language. Constraints, however, remain finite-state. Efficient
 candidate filtering is possible via an extended Earley's algorithm.

Invited talk: Finite-State Non-Concatenative Morphotactics
Kenneth R. Beesley and Lauri Karttunen

 A new finite-state technique, "compile-replace", lets a regexp compiler
 reapply and modify its own output, freeing morphotactic description to
 use any finite-state operation. This provides an elegant solution for
 classic examples of non-concatenative phenomena in Malay and Arabic.

Multi-Syllable Phonotactic Modelling
Anja Belz

 An approach to describing word-level phonotactics in terms of syllable
 classes. Such "multi-syllable" phonotactic models can be expressed in
 a formalism that facilitates automatic model construction and
 generalisation.

Easy and Hard Constraint Ranking in OT : Algorithms and Complexity
Jason Eisner

 A simple version of the automatic constraint ranking problem is
 easier than previously known (linear on the number of constraints).
 But slightly more realistic versions are as bad as Sigma_2-complete.
 Even checking a ranking against data is up to Delta_2-complete.

Invited talk: Approximation and Exactness in Finite State OT
Dale Gerdemann and Gertjan van Noord

 Frank & Satta (1998) showed that OT with gradient constraints
 generally is not finite-state. We present an improvement of the
 approximation of Karttunen (1998). The new method is exact and compact
 for the syllabication analysis of Prince and Smolensky (1993).

Temiar Reduplication in One-Level Prosodic Morphology
Markus Walther

 This paper presents the first computational analysis of a difficult
 piece of prosodic morphology, aspectual reduplication in the Malaysian 
 language Temiar, using the novel finite-state approach of One-Level 
 Prosodic Morphology (Walther 1999b, 2000). 

Panel: How to Design a Great Workbench Tool for Working Phonologists?
Moderated by Lauri Karttunen, co-author of the Xerox finite-state compiler

 Dan Albro, author of the UCLA OTP tool
 Ken Beesley, co-author of the Xerox finite-state compiler
 Jason Eisner, author of the Primitive OT framework
 Dale Gerdemann, co-author of the FSA Utilities toolbox
 Arvi Hurskainen, author of tools for African languages

Further discussion of relevant papers from the main conference

General discussion

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

LINKS
- ---
Registration - http://www.coling.org/reg.html 
Contact - mailto:sigphon2000cs.rochester.edu

Coling 2000 - http://www.coling.org
SIGPHON - http://www.cogsci.ed.ac.uk/sigphon
Luxembourg - http://www.coling.org/lux-links.html
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue