Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 14 No. 20
NL-KR Digest Fri Mar 24 22:39:50 PST 1995 Volume 14 No. 20
Today's Topics:
Announcement: IEE Workshop on Grounding Symbols, May 95, London
Announcement: EUCCS/WP10-Nonclass. Feature Sys. papers, Edinburgh
* * *
Subcriptions: listserv-style administrative requests to
nl-kr-request@ai.sunnyside.com.
Submissions, policy, questions: nl-kr@ai.sunnyside.com
To speed up processing of your submission write to
listserv@ai.sunnyside.com with the message:
GET nl-kr style
Back issues:
FTP: ai.sunnyside.com:/pub/nl-kr/Vxx/Nyyy
/pub/nl-kr/Vxx/INDEX
Gopher: ai.sunnyside.com, Port 70, in directory /pub/nl-kr
Email: write to LISTSERV@AI.SUNNYSIDE.COM, omit subject, mail command:
GET nl-kr nl-kr_file_list
Web: http://ai.sunnyside.com/pub/nl-kr
Editors:
Al Whaley (al@ai.sunnyside.com) and
Chris Welty (weltyc@cs.vassar.edu).
-----------------------------------------------------------------------
To: comp-ai-nlang-know-rep@uunet.uu.net
From: dohertcj@aston.ac.uk (CD)
Subject: Announcement: IEE Workshop on Grounding Symbols, May 95, London
Reply-To: P.McKevitt@dcs.shef.ac.uk
Date: Mon, 20 Mar 1995 13:06:45 GMT
al,comp.theory.self-org-sys,comp.robotics
This is a requested trans-posting from P.McKevitt@dcs.shef.ac.uk.
All queries automatically to him.
PROGRAMME AND CALL FOR PARTICIPATION
GROUNDING REPRESENTATIONS:
Integration of sensory information in
Natural Language Processing,
Artificial Intelligence and Neural Networks
IEE COLLOQUIUM
IEE Computing and Control Division
[Professional group: C4 (Artificial Intelligence)]
in association with:
British Computer Society Specialist Group on Expert Systems
and
The Society for the Study of Artificial Intelligence
and Simulation of Behaviour (SSAISB)
MONDAY, MAY 15th, 1995
* * * * **
at the
IEE Colloquium
Savoy Place
London, ENGLAND
Chairs
NOEL SHARKEY and PAUL MC KEVITT
Department of Computer Science
University of Sheffield, England
WORKSHOP DESCRIPTION:
Perhaps the most famous criticism of traditional Artificial
Intelligence is that computer programs use symbols that are
arbitrarily interpretable (see Searle, 1980 for the Chinese Room and
Harnad, 1990 for the symbol grounding problem). We could, for example,
use the word "apple" to mean anything from a "common fruit" to a
"pig's nose". All the computer knows is the relationship between this
symbol the others that we have given it. The question is, how is it
possible to move from this notion of meaning, as the relationship
between arbitrary symbols, to a notion of "intrinsic" meaning. In
other words, how do we provide meaning by grounding computer symbols
or representations in the physical world?
The aim of this colloquium is to take a broad look at many of the
important issues in relating machine intelligence to the world and to
make accessible some of the most recent research in integrating
information from different modalities. For example, why is it
important to have symbol or representation grounding and what is the
role of the emerging neural network technology?
One approach has been to link intelligence to the sensory world
through visual systems or robotic devices. Another approach is work on
systems that integrate information from different modalities such as
vision and language. Yet another approach has been to examine how the
human brain relates sensory, motor and other information. It looks
like we may be at long last getting a handle on the age old CHINESE
ROOM and SYMBOL GROUNDING problems. Hence this colloquium has as its
focus, "grounding representations.
The colloquium will occur over one day and will focus on three themes:
(1) Biology and development; (2) Computational models and (3) Symbol
grounding.
The target audience of this colloquium will include Engineers and
Scientists in Neural Networks and Artificial Intelligence,
Developmental Psychologists, Cognitive Scientists, Philosophers of
mind, Biologists and all of those interested in the application of
Artificial Intelligence to real world problems.
PROGRAMME:
Monday, May 15th, 1995
* * * * ****
INTRODUCTION:
9.00 REGISTRATION + SUSTENANCE
10.00 `An introduction'
NOEL SHARKEY
(Department of Computer Science, University of Sheffield, ENGLAND)
BIOLOGY:
10.30 `The neuronal mechanisms of language'
VALENTINO BRAITENBERG
(Max Plank Institute for Biological Cybernetics, Tuebingen, GERMANY)
COMPUTATIONAL MODELS:
11.00 `Natural language and exploration of an information space'
OLIVIERO STOCK
(Istituto per la Ricerca Scientifica e Technologica, IRST)
(Trento, ITALY)
11.30 `How visual salience influences natural language descriptions'
WOLFGANG MAASS
(Cognitive Science Programme)
(Universitaet des Saarlandes, Saarbruecken, GERMANY)
12.00 DISCUSSION
12.30 LUNCH
GROUNDING SYMBOLS:
2.00 `On grounding language with neural networks'
GEORG DORFFNER
(Austrian Institute for Artificial Intelligence, Vienna, AUSTRIA)
2.30 `Some observations on symbol-grounding from a combined
symbolic/connectionist viewpoint'
JOHN BARNDEN
(Computing Research Laboratory, New Mexico, USA) &
(Department of Computer Science, University of Reading, ENGLAND)
3.00 Sustenance Break
3.30 `Grounding symbols in sensorimotor categories with neural networks'
STEVAN HARNAD
(Department of Psychology, University of Southampton, ENGLAND)
PANEL DISCUSSION AND QUESTIONS:
4.00 `Grounding representations'
Chairs + Invited speakers
S/IN S/IN:
4.30 `De brief/comments'
PAUL MC KEVITT
(Department of Computer Science, University of Sheffield, ENGLAND)
5.00 O/ICHE MHA/ITH
* * * * * ****
PUBLICATION:
We intend to publish a book on this Colloquium Proceedings.
ADDRESSES
IEE CONTACT:
Sarah Leong
Groups Officer
The Institution of Electrical Engineers (IEE)
Savoy Place
GB- WC2R OBL, London
England, UK, EU.
E-mail: SLeong@iee.org.uk (Sarah Leong)
E-mail: mbarrett@iee.org.uk (Martin Barrett)
E-mail: dpenrose@iee.org.uk (David Penrose)
WWW: http://www.iee.org.uk
Ftp: ftp.iee.org.uk
FaX: +44 (0) 171-497-3633
Phone: +44 (0) 171-240-1871 (general)
Phone: +44 (0) 171-344-8423 (direct)
LOCATION:
The Institution of Electrical Engineers (IEE)
Savoy Place
GB- WC2R OBL, London
England, UK, EU.
ACADEMIC CONTACT:
Paul Mc Kevitt
Department of Computer Science
Regent Court
211 Portobello Street
University of Sheffield
GB- S1 4DP, Sheffield
England, UK, EU.
E-mail: p.mckevitt@dcs.shef.ac.uk
WWW: http://www.dcs.shef.ac.uk/
WWW: http://www.shef.ac.uk/
Ftp: ftp.dcs.shef.ac.uk
FaX: +44 (0) 114-278-0972
Phone: +44 (0) 114-282-5572 (Office)
282-5596 (Lab.)
282-5590 (Secretary)
REGISTRATION:
Registration forms are available from SARAH LEONG at the above address
and should be sent to the following address: (It is NOT possible to
register by E-mail.)
Colloquium Bookings
Institution of Electrical Engineers (IEE)
PO Box 96
Stevenage
GB- SG1 2SD Herts
England, UK, EU.
Fax: +44 (0) 143 874 2792
Receipt Enquiries: +44 (0) 143 876 7243
Registration enquiries: +44 (0) 171 240 1871 x.2206
PRE-REGISTRATION IS ADVISED ALTHOUGH YOU CAN REGISTER ON THE DAY OF THE
EVENT.
________________________________________________________________________
R E G I S T R A T I O N COSTS
________________________________________________________________________
(ALL FIGURES INCLUDE VAT)
IEE MEMBERS 44.00
NON-IEE MEMBERS 74.00
IEE MEMBERS
(Retired, Unemployed, Students) FREE
NON-IEE MEMBERS
(Retired, Unemployed, Students) 22.00
LUNCH TICKET 4.70
MEMBERS:
Members of the IEEIE, The British Computer Society and the Society for
the Study of Artificial Intelligence and Simulation of Behaviour and
Eurel Member Associations will be admitted at Members' rates.
-----------------------------------------------------------------------
From: dyane@cogsci.ed.ac.uk (Dyane McGavin)
Subject: Announcement: EUCCS/WP10-Nonclass. Feature Sys. papers, Edinburgh
Reply-To: dyane@cogsci.ed.ac.uk
Date: Tue, 21 Mar 1995 11:49:49 GMT
= = = = = = = = = = = = = = =
CENTRE FOR COGNITIVE SCIENCE The University of Edinburgh
Announcement: Working Papers available on NONCLASSICAL FEATURE SYSTEMS
= = = = = = = = = = = = = = =
Andreas Sch\"oter and Carl Vogel (eds.), NONCLASSICAL FEATURE SYSTEMS
(CCS-WP-10) is now available via ftp and hardcopy from the Centre for
Cognitive Science at the University of Edinburgh.
The aim of the CCS working papers on Nonclassical Feature Systems is
to gather together local research activities in the development and
application of feature theory beyond its classical incarnations. This
includes extending classical feature structure theory to incorporate
set valued features, which is technically problematical but required
by contemporary linguistic theories, as well as generalizations of
feature theory involving various forms of paraconsistency and
defeasibility, and accompanying redefinitions of unification
operators. Titles and abstracts of papers included in the volume
are listed below the ordering information.
- - - - - - - - - - - - - -
The CCS-WP-10 can be obtained in hardcopy by sending a money order for
7.75 pounds sterling to:
A PostScript (1.6 meg., when unpacked) version is available on WWW via
the following URL:
http://www.cogsci.ed.ac.uk/ccs/home.html
Please direct inquiries to <librarian@cogsci.ed.ac.uk>.
= = = = = = = = = = = = = = =
Paraconsistent Feature Logic
Andreas Sch\"oter
This paper describes an application of the paraconsistent bilattice
logic FOUR to the problem of defining a natural semantics for robust
parsing systems; in the process a monotonic negation for linguistic
feature descriptions is introduced. Instances of grammatical
categories are viewed as partial, paraconsistent properties defined
over linguistic features and an interpretation for a Kasper-Rounds
style logic is given which provides a language for the expression of
constraints on the extensions of those properties. The resulting
linguistic categories form an approximation lattice, and the logic
gives a fine-grained analysis of inconsistent information that has
applications in the theoretical analysis of actual robust parsing
systems.
= = = = = = = = = = = = = = =
An Attributive Logic of Set Descriptions and Set Operations
Suresh Manandhar
Set descriptions are regarded as an important datatype within
unification based linguistic theories. Although several formalisations
of set descriptions exists consistency checking methods for set
descriptions have not been developed. This report attempts to rectify
this situation in several ways. We begin by providing a model
theoretic semantics to feature terms augmented with set descriptions.
We provide constraints to specify HPSG style set descriptions, fixed
cardinality set descriptions, set-membership constraints and
restricted universal role quantifications. This repertoire of
constraints on set descriptions is extended by allowing constraints
such as set union, intersection, subset and disjointness. A sound,
complete and terminating consistency checking procedure is provided to
determine the consistency of any given term in the logic. It is shown
that consistency checking with set descriptions is a NP-complete
problem.
= = = = = = = = = = = = = = =
Order Independent and Persistent Typed Default Unification
Alex Ascarides, Ted Briscoe, Nicholas Asher and Ann Copestake
We define an order independent version of default unification on typed
feature structures. The operation is one where default information in
a feature structure typed with a more specific type, will override
default information in a feature structure typed with a more general
type, where specificity is defined by the subtyping relation in the
type hierarchy. The operation is also able to handle feature
structures where reentrancies are default. We provide a formal
semantics, prove order independence and demonstrate the utility of
this version of default unification in several linguistic
applications. First, we show how it can be used to define multiple
orthogonal default inheritance in the lexicon in a fully declarative
fashion. Secondly, we show how default lexical specifications
(introduced via default lexical inheritance) can be made to usefully
`persist beyond the lexicon' and interact with syntagmatic rules.
Finally, we outline how persistent default unification might underpin
default feature propagation principles and a more restrictive and
constraint-based approach to lexical rules.
= = = = = = = = = = = = = = =
Robust PATR for Error Detection and Correction
Shona Douglas
This paper reports a series of experiments with a `robust' form of the
PATR formalism, aimed at using relaxation of constraints in the
detection and correction of textual errors. The key characteristic of
the basic approach is the rule-based targetting of relaxations to be
performed using a declarative *relaxation schedule*. The mechanism
extends the standard PATR-II formalism by indexing the constraints on
rules and abstracting away control of the application of these
constraints. This allows the independent specification of grouping
and ordering of the constraints, which can improve the efficiency of
processing, and in conjunction with information specifying whether
constraints are necessary or optional, allows detection of syntactic
errors. A second version of robust PATR is described in which
permissable relaxations are specified at a global level in terms of
category types, instead of at the level of the individual rule, and
the approaches are compared. One of the reasons for preferring an
approach that directly links the `correct' grammar and the grammar
necessary to process errorful text is the requirement to generate
suggested replacements for detected errors; further work is reported
on the use of types in overwriting or coercive unification for
replacement generation.
= = = = = = = = = = = = = = =
Priority Union and Generalization in Discourse Grammar
Claire Grover, Chris Brew, Suresh Manandhar, Marc Moens and
Andreas Sch\"oter
We describe an implementation in Carpenter's typed feature formalism,
ALE, of a discourse grammar of the kind proposed by Scha, Polanyi,
Pr\"ust, and their co-workers. We examine their method for resolving
parallelism-dependent anaphora and show that there is a coherent
feature-structural rendition of this type of grammar which uses the
operations of *priority union* and *generalization*. We describe an
augmentation of the ALE system to encompass these operations and we
show that an appropriate choice of definition for priority union gives
the desired multiple output for examples of VP-ellipsis which exhibit
a strict/sloppy ambiguity.
= = = = = = = = = = = = = = =
Robust Chart Parsing with Mildly Inconsistent Feature Structures
Carl Vogel and Robin Cooper
We introduce the formal underpinnings of our theory of non-classical
feature structures. The resulting expanded universe of feature
structures has direct implications for robust parsing for linguistic
theories founded upon feature theory. We present an implementation of
a robust chart parser for Head-driven Phrase Structure Grammar (HPSG).
The problem of relaxed unification is in limiting it so that
arbitrarily nongrammatical inputs needn't be accepted. In the worst
case, excessively `relaxed' parsers cannot provide meaningful
interpretations to process. However, parsers which can guarantee
minimally nongrammatical (inconsistent) interpretations provide an
important tool for grammar development and online robust processing of
natural language. Our parser prefers maximally consistent
interpretations, and accommodates inconsistencies by discovering the
minimal set of constraints that need to be relaxed for a parse to go
through, without employing backtracking or post processing. The
system is different from other related relaxational techniques for
unification grammars which require advanced naming of features whose
constraints are allowed to be relaxed. Yet it is compatible with
those approaches in that there is a well defined location for
preferences on sources of inconsistency to be named, as well as for
resolution of inconsistent information. We use a simple approach to
the problem of unknown words and suggest generalization of that for
coping with missing and extra elements in an input.
= = = = = = = = = = = = = = =
End of NL-KR Digest
*******************
