LINGUIST List 9.634

Thu Apr 30 1998

Calls: Phonological Constraint, Machine Translation

Editor for this issue: Julie Wilson <>

Please do not use abbreviations or acronyms for your conference unless you explain them in your text. Many people outside your area of specialization will not recognize them. Also, if you are posting a second call for the same event, please keep the message short. Thank you for your cooperation.


  1. SIGPHON98, SIGPHON98 Workshop --- Extended Deadline
  2. Ruslan Mitkov, Special Issue Machine Translation: Final call for papers

Message 1: SIGPHON98 Workshop --- Extended Deadline

Date: Tue, 28 Apr 1998 16:23:35 +0100
From: SIGPHON98 <>
Subject: SIGPHON98 Workshop --- Extended Deadline

 The Fourth CFP
 <<C A L L ----- F O R ----- P A P E R S>>

 The Computation of Phonological Constraints

 The 4th Meeting of the ACL
 Special Interest Group in Phonology

 In conjunction with
 The COLING-ACL'98 Joint Conference
 Montreal, Canada, 15th August 1998

	*** Due to popular request, we have extended the deadline for
	*** submissions to this workshop by 3 weeks. The new deadline
	*** is MAY 10.

The Meeting
- ---------
Constraint-based theories of phonology have become enormously popular
in recent years. Such theories express generalizations by stating how
and when a language's phonological forms are constrained, rather than
relying on rules that actively modify the forms.

Computational ideas have often provided an impetus for these
innovations. Koskenniemi's (1983) 2-level morphophonological processor
introduced parallel constraining relations as an alternative to an
ordered system of rewrite rules. Declarative Phonology (c 1990)
focusses on the unity of representations and rules as constraints,
drawing on various computational ideas from unification to temporal
logic to finite-state calculi.

One current constraint-based theory is Optimality Theory (OT)
(Prince&Smolensky 1993). This theory found, at least partial,
inspiration in computational work by Smolensky on the relation between
symbolic and subsymbolic computation. Although this link with
connectionism has been left largely unexplored, OT has proved to be a
computationally productive theory, giving rise to several theoretical
papers on computational issues related to complexity and learnability,
as well as inspiring a number of implementations.

This workshop is designed to foster the link between computational
work and constraint-based phonology in general. To this end, it
invites submissions on topics related to the computation of any
constraint-based phonological formalism, including but not limited to
the three mentioned above. Here are some example topics:

 * the computational interpretation of phonological theories,
 * constraint ranking and interaction, eg. as in OT,
 * implementations of particular analyses,
 * results in the complexity of constraint application,
 * algorithms for learning constraints or constraint ranking,
 * results on the learnability of such constraints,
 * novel formalisms for constraint-based phonology,
 * representational issues raised by constraint-based approaches.

In short, papers are invited which address computational issues in
constraint-based theories of phonology.

- --------
 What: original research, not published elsewhere
 a completed study is prefered to proposals and progress reports
 originality, topicality and clarity will be the assessment criteria 
 How: submissions must be sent by email to 
 When: May 10 Submissions due
 May 25 Notification of acceptance
 June 23 Final (accepted) versions due

Submission Format
- ---------------
(Note that apart from the Medium and Length sections, these
requirements are as for submissions to COLING-ACL98.)
 Medium: postscript, emailed to
 please check postscript compatibility using either
 ghostview, or by printing the postscript file
 before sending
 Length: 7 pages maximum (including references and appendices)
 optional extra page for abstract in a second language
 Paper size: Please use A4 page-size
 Typesetting: LaTeX is encouraged, but not required.
 Layout: set margins so that text lies centred within a rectangle of
 6.5 x 9 inches (16.5 x 23 cm)
 Use Times Roman or Computer Modern font
 11 to 12 point for text
 14 to 16 point for headings and title
 centred page numbers in footers
 2 columns after title and abstract
 figures may range across columns

Since reviewing will be blind, a separate identification notice should
be emailed (in ASCII) to It should include:
 author(s) name(s) 
 complete addresses 
 abstract in English
 submission to other conferences ('none' or list) 
 and author of record (for correspondence). 

Authors should not identify either themselves or their affiliations,
either directly or indirectly in the body of the text (the postscript

Authors should use the COLING-ACL98 style files and templates for
preparing submissions (see 
This will help ensure that the layout requirements are met, and that
the effort required to format the final version will be minimized.

- ----------
Information about registration procedures will be available as soon as

- ----------
Organiser: T. Mark Ellison (Edinburgh)

Organising/Program Committee: Steven Bird (Edinburgh)
 Jason Eisner (Pennsylvania)
 Bruce Tesar (Rutgers)
 Markus Walther (Duesseldorf)

- ------------
Should be sent to: SIGPHON98
 Centre for Cognitive Science
 Edinburgh University
 2 Buccleuch Place
 Edinburgh EH8 9LW, UK
 Tel. +44 (131) 650-4416
 Fax. +44 (131) 650-6626

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

Message 2: Special Issue Machine Translation: Final call for papers

Date: Tue, 28 Apr 1998 17:43:20 +0100
From: Ruslan Mitkov <>
Subject: Special Issue Machine Translation: Final call for papers




 Guest editor: Ruslan Mitkov (University of Wolverhampton)

The interpretation of anaphora is crucial for the successful operation
of a Machine Translation system. In particular, it is essential to
resolve the anaphoric relation when translating into languages which
mark the gender of pronouns. Unfortunately, the majority of MT systems
developed in the seventies and eighties did not adequately address the
problems of identifying the antecedents of anaphors in the source
language and producing the anaphoric "equivalents" in the target
language. As a consequence, only a limited number of MT systems have
been successful in translating discourse, rather than isolated
sentences. One reason for this situation is that in addition to anaphora
resolution being itself a very complicated task, translation adds a
further dimension to the problem in that the reference to a discourse
entity encoded by a source language anaphor by the speaker (or writer)
has not only to be identified by the hearer (translator or translation
system) but also re-encoded in a coreferential expression in a different

The nineties have seen an intensification of research efforts in
anaphora resolution in Machine Translation. This can be seen in the
growing number of related projects which have reported promising new
results (e.g.Wada 1990; Leass & Schwall 1991; Nakaiwa & Ikehara 1992; 
Chen 1992; Saggion & Carvalho 1994; Preuss et al. 1994; Nakaiwa et
al. 1994; Nakaiwa et al. 1995; Nakaiwa & Ikehara 1995; Mitkov et al.
1995; Mitkov et al. 1997; Geldbach 1997).

However, we still feel that additional work is needed to highlight and
further explore the specifics of the problem in operational MT
environments, including fully automatic Machine Translation and Machine-
aided Translation.

We are inviting high-quality, original research papers describing recent
advances in anaphora resolution in Machine Translation. Topics to be
addressed include (but are not limited to)

- operational anaphora resolution components in Machine Translation

- resolution of zero pronouns in MT environments

- lexical transfer of anaphors across languages

- to what extent have the latest trends towards knowledge-poor, corpus-
driven and robust approaches in anaphora resolution, been called upon
in Machine Translation?

- what are the most scalable contributory factors /resolution
strategies in MT?

- what makes anaphora resolution a more complex task in Machine

- multilingual anaphora resolution


Articles should be submitted directly to the publishers, either by
e-mail to, with the Subject header "Submission to
COAT Anaphora special issue", or in hard-copy to

Machine Translation Editorial Office
Kluwer Academic Publishers
P.O. Box 990
3300 AZ Dordrecht
The Netherlands


Machine Translation Editorial Office
Kluwer Academic Publishers
P.O. Box 230
Accord, MA 02018-023


The journal is typeset using LaTeX, so the preferred medium for
submission of articles in electronic format is LaTeX source (using the
Kluwer style file) or gzipped postscript. For more details, please
consult the journal's web pages:

Home page:
Instructions for Authors:
LaTeX style files:

If submitting hard-copy, four copies of the paper are required.
The length of the papers should be approximately 10-20 pages if using
the Kluwer style file (around 20k words).

Authors are also requested to send a copy of an abstract of not more
than 200 words to the guest editor or in hard-copy to
Ruslan Mitkov, School of Languages and European Studies, University of
Wolverhampton, Stafford St., Wolverhampton WV1 1SB, United Kingdom.


Ruslan Mitkov
School of Languages and European Studies
University of Wolverhampton
Stafford St.
Wolverhampton WV1 1SB
Telephone (44-1902) 322471
Fax (44-1902) 322739


Breck Baldwin (University of Pennsylvania, Philadelphia)
David Carter (SRI International, Cambridge)
Guenter Goerz (University of Nuernberg/Erlangen)
Lynette Hirschman (MITRE, McLean)
Richard Kittredge (University of Montreal)
Susan LuperFoy (MITRE, McLean)
Tony McEnery (Lancaster University)
Ruslan Mitkov (University of Wolverhampton)
Frederique Segond (Ranx Xerox, Grenoble)
Harold Somers (UMIST, Manchester)
Keh-Yih Su (National Tsing Hua University, Taiwan)
Yorick Wilks (University of Sheffield)
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue