LISTSERV mailing list manager LISTSERV 16.5

Help for TEI-L Archives


TEI-L Archives

TEI-L Archives


TEI-L@LISTSERV.BROWN.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

TEI-L Home

TEI-L Home

TEI-L  January 1998

TEI-L January 1998

Subject:

LREC WORKSHOP ANNOUNCEMENT

From:

Simone Saint Laurent <[log in to unmask]>

Reply-To:

Simone Saint Laurent <[log in to unmask]>

Date:

Fri, 30 Jan 1998 16:00:29 CST

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (163 lines)

WORKSHOP ANNOUNCEMENT AND CALL FOR PAPERS
 
 
LINGUISTIC COREFERENCE WORKSHOP
26 May 1998, Morning Session
 
Held in conjunction with
The First International Conference on Language Resources and Evaluation
Granada, Spain  (28-30 May 1998)
 
 
WORKSHOP AIMS
 
It is essential, for a natural language processing system, to
instantiate each object, process, attribute, and property correctly, so
that all references to the same item be recognized as such and an
inventory of all distinct items be accurate at all times. This problem
is far from being resolved. There are both linguistic and computational
reasons for this deficiency. First, there is no satisfactory microtheory
of linguistic coreference. Secondly and consequently, there is no
satisfactory application of such a microtheory to NLP.
 
A microtheory of coreference in natural language includes in its scope
all the phenomena that satisfy the following condition: an
object/entity, an event, an attribute, a property or its value, an
attitude, or any combination of the above is referred to more than once
in a natural-language text, and the understanding of the text depends on
the correct interpretation of the two or more referring expressions as
designating the same object, event, etc.  A linguistic microtheory of
coreference for a language consists of the following elements:
     - a complete range of covered phenomena in the language;
     - a taxonomy of the range;
     - a typology of the range;
     - a list of rules forming the various types of coreference;
     - a list of rules interpreting the various types of coreference.
 
There has been a considerable amount of work on a few selected types of
coreference, focusing almost exclusively on object coreference. Thus,
significant work has been done in theoretical linguistics on anaphora
and cataphora, subsuming, for the large part, earlier work on deixis. A
small minority of authors have tried to extend their studies of anaphora
beyond mere syntax. In the cognitive-linguistics and
philosophy-of-language traditions, interesting work has been done
relating anaphora and deixis to ambiguity resolution and discourse
structure. At the same time, an effort in comparative-contrastive
linguistics has led some writers to examining the data of more than one
language at a time, still emphasizing entity or object reference.
 
In computational linguistics, the problem of coreference took early on the form
of pronoun antecedent resolution, and this particular task, somewhat broadened
to include a few other types of anaphora, still remains in the center of the
problem. The most sustained effort in the computational treatment of
coreference has been mounted within the Tipster/MUC-6 initiative. While
it has been recognized since quite early in the game that coreference
resolution is based in large part on world knowledge, most of the work
done on the matter computationally and theoretically ignores and avoids
world knowledge. The MUC-6 initiative makes such an orientation quite
explicit: the work should be based on such simpler resources as
part-of-speech tagging, simple noun phrase recognition, basic semantic
category information like, gender, number, and [to a limited extent]
full parse trees. Such an approach--trying to explore and maximize
everything that can be done simply and cheaply towards the resolution of
a complex program--is perfectly legitimate as long as it is realized
that a considerable part of the problem remains unsolved, and it is
indeed realized fully well within the MUC-6 initiative.
 
One persistent problem throughout the existing computational ventures
into coreference has been the lack of a consistent theoretical approach
to it. The result is that coreference phenomena are treated as
self-obvious, and most of them are overlooked, especially if they are
not explicit pronoun-antecedent or other equally evident anaphora cases.
What is needed for a full, accurate, and reliable approach to
coreference can be summarized, somewhat schematically, as involving the
following steps:
 
     1. understanding fully the range of the phenomenon and
     of the rules that govern it (theory);
     2. determining the extent of machine-tractable information
     in the rules;
     3. taking stock of all the rules that can be computed;
     4. developing the appropriate heuristics for the computable rules;
     5. computing the rules.
 
 
WORKSHOP AGENDA
 
The workshop will be held during the morning session of 26 May 1998 and
will include a joint address by the Organizing Committee (listed above),
followed by 5-8 individual presentations in two 90-120-minute blocks,
with a break provided midway through.
 
 
 
CALL FOR PAPERS
 
The Workshop solicits papers addressing any one or more of the points
addressed above as well as any other pertinent issues.
 
Papers based on a diversity of languages are encouraged, both one
language at a time and, especially, comparative/contrastive studies.
Also strongly encouraged are papers which extend the study of
coreference beyond entity/object reference, across document boundaries,
and/or into non-text media.
 
 
 
FORMAT FOR SUBMISSION
 
Paper submissions should consist of an extended abstract of
approximately 800 words, along with a brief description of the proposed
presentation structure (e.g., paper, paper plus demo,etc.).
 
Each submission should include a separate title page, providing the
following information: the title to be printed in the Conference
program; names and affiliations of all authors; the full address of the
primary author (or alternate contact person), including phone, fax,
email; and required audio-visual equipment.
 
Papers may be submitted by sending three hardcopies or one softcopy (in
TeX, ASCII, or post-script format) to the appropriate address as listed
below:
 
    Dr. Victor Raskin
    Chair, Interdepartmental Program in Linguistics
    Heavilon Hall
    Purdue University
    West Lafayette, IN   47907   USA
 
    [log in to unmask]
 
Submissions must be received no later than 1 March 1998 for a 15 March
notification of paper acceptance. (Full versions of all accepted papers are
requested no later than 15 April 1998 for inclusion in the conference
proceedings.)
 
 
WORKSHOP ORGANIZING COMMITTEE
 
Dr. Sara J. Shelton (Contact Person)
US Department of Defense
9800 Savage Road, R525
Ft Meade, MD  20755   USA
[log in to unmask]
301-688-0301 (voice)
301-688-0338 (fax)
 
Dr. Eduard Hovy
Information Sciences Institute
University of Southern California
4676 Admirality Way
Marina Del Rey, CA  90292-669   USA
[log in to unmask]
310-822-1511, ext. 731 (voice)
 
Dr. Victor Raskin
Interdepartmental Program in Linguistics
Heavilon Hall
Purdue University
West Lafayette, IN   47907   USA
[log in to unmask]
765-494-3782 (voice)
765-494-3780 (fax)

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998
August 1998
July 1998
June 1998
May 1998
April 1998
March 1998
February 1998
January 1998
December 1997
November 1997
October 1997
September 1997
August 1997
July 1997
June 1997
May 1997
April 1997
March 1997
February 1997
January 1997
December 1996
November 1996
October 1996
September 1996
August 1996
July 1996
June 1996
May 1996
April 1996
March 1996
February 1996
January 1996
December 1995
November 1995
October 1995
September 1995
August 1995
July 1995
June 1995
May 1995
April 1995
March 1995
February 1995
January 1995
December 1994
November 1994
October 1994
September 1994
August 1994
July 1994
June 1994
May 1994
April 1994
March 1994
February 1994
January 1994
December 1993
November 1993
October 1993
September 1993
August 1993
July 1993
June 1993
May 1993
April 1993
March 1993
February 1993
January 1993
December 1992
November 1992
October 1992
September 1992
August 1992
July 1992
June 1992
May 1992
April 1992
March 1992
February 1992
January 1992
December 1991
November 1991
October 1991
September 1991
August 1991
July 1991
June 1991
May 1991
April 1991
March 1991
February 1991
January 1991
December 1990
November 1990
October 1990
September 1990
August 1990
July 1990
June 1990
April 1990
March 1990
February 1990
January 1990

ATOM RSS1 RSS2



LISTSERV.BROWN.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager