[Prev][Next][Index][Thread]
CSLI Calendar, 20 May 1998, vol. 13:34
C S L I C A L E N D A R O F P U B L I C E V E N T S
______________________________________________________________________
20 May 1998 Stanford Vol. 13, No. 34
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
____________
ACTIVITIES DURING 20 MAY TO 29 MAY 1998
WEDNESDAY, 20 MAY
12 noon Semantics Workshop
Margaret Jacks Hall 460:146
Remarks on Information Packaging in Japanese
John Fry
Abstract below
3:15pm ME297: Design Theory and Methodology Seminar
Dynamic Project Management for Collaborative Product
Development
Dr. Hisup Park
Macroscape, Inc.
Abstract below
3:45pm Psychology Department Colloquium
Bldg. 420:050 (Jordan Hall)
Psychological Contributions to the Understanding of
Positive Human Health
Carol Ryff
University of Wisconsin
4:15pm Seminar on Computational Learning and Adaptation (SCLA)
Cordura 100
User Guidance for Performing Knowledge Discovery in
Databases
Rudi Studer
Institute AIFB, University of Karlsruhe, Germany (on
sabbatical leave with Computer Science Dept., Stanford
University
Abstract below
4:15pm EE380: Computer Systems Laboratory Colloquium
Gates B03 (NEC Auditorium)
Traffic Control and QoS Management In The Internet
Hui Zhang
CMU
Abstract below
THURSDAY, 21 MAY
11:00am International Computer Science Institute
Main Lecture Hall at ICSI, 1947 Center Street, Berkeley
Charging for QoS
Domenico Ferrari
Center for Research on the Applications of Telematics to
Organizations and Society (CRATOS) Universita' Cattolica,
Piacenza, Italy
http://www.icsi.berkeley.edu/talks/
12 noon CSLI CogLunch
Cordura Hall, Room 100
The Evolution of Inference
Brian Skyrms
UC Irvine, Philosophy
Abstract below
4:00pm International Computer Science Institute
Main Lecture Hall at ICSI, 1947 Center Street, Berkeley
Component Model Reflector - A Concept for Scalable Remote
Access and Synchronous Collaboration Under Java
Foundation Classes
Vladimir Minenko
ICSI, Networks Group
http://www.icsi.berkeley.edu/talks/
NOTE change in time
4:00pm Xerox PARC Forum
George Pake Auditorium, Xerox PARC
Gunn High School Robotics Team
http://www.parc.xerox.com/ops/projects/forum
4:15pm Symbolic Systems Honors Projects I
Margaret Jacks Hall 460:146
4:15pm AI-Vision-Robotics Division Colloquium
Gates 104
Automated Software Engineering Research at NASA Ames
Michael Lowry, Jeffrey Van Baalen, Klaus Havelund
Computational Sciences Division
NASA Ames Research Center
Abstract below
4:15pm Frontiers of Neuroscience Seminars
Munzer Auditorium
What cyclic nucleotide-gated channels can tell us about
allosteric proteins
Dr. Jeffrey Karpen
University of Colorado
Host: Dr. Denis Baylor
http://www.stanford.edu/dept/nbio/Spring98.html
4:15pm CS548: Distributed Systems Research Seminar
Gates B01
A Flow-Based Approach to Datagram Security
Suvo Mitra
Computer Science, Stanford
http://www.stanford.edu/class/cs548/
FRIDAY, 22 MAY
12:30pm Seminar on People, Computers, and Design
Gates B03 (NEC classroom)
Communicating with Machines Using Speech, Gesture, and
Facial Expression
Justine Cassell
MIT Media Lab
Abstract below
1:00pm The Flow of Information:
A Conference in Honor of Fred Dretske
Cordura 100
Information below
3:15pm Cognitive Seminar
Jordan Hall 420:100
Lera Boroditsky
3:15pm Computer Science Database Seminar
Gates B-12
The Internet, Electronic Commerce, and Databases
Thomas Kurian
Oracle
Abstract below
TUESDAY, 26 MAY
8:00pm Kant Lectures
Cubberley 128 (Education)
Making Up People
Ian Hacking
Victoria College, University of Toronto
http://www-philosophy.stanford.edu/general/colloqs.html
WEDNESDAY, 27 MAY
10:00am Phonology Workshop
Margaret Jacks Hall, 460:146
Morpheme Structure Constraints and Paradigm Occultation
John McCarthy
Department of Linguistics, University of Massachusetts
Amherst
Abstract below
12 noon Semantics Workshop
Margaret Jacks Hall 460:146
Conditionals R Us: From IF to IFF via R-based implicature
Laurence Horn
Department of Linguistics, Yale University
Abstract below
4:15pm Seminar on Computational Learning and Adaptation (SCLA)
Cordura 100
James McNames
Information Systems Laboratory, Electrical Engineering
Department, Stanford University.
http://www-csli.stanford.edu/cll/scla.html
4:15pm EE380: Computer Systems Laboratory Colloquium
Gates B03 (NEC Auditorium)
A Scalable High Clock Rate SPARC Processor
Gary Lauterbach
SUN Microsystems
http://www.stanford.edu/class/ee380/contents.html
8:00pm Kant Lectures
Cubberley 128 (Education)
Making Up People:
"Making and Finding Disorder: Autism For Example"
Ian Hacking
Victoria College, University of Toronto
http://www-philosophy.stanford.edu/general/colloqs.html
THURSDAY, 28 MAY
12 noon CSLI CogLunch
Cordura Hall, Room 100
title to be announced
Yoav Shoham
Stanford, CS
http://www-csli.stanford.edu/csli/Coglunch/schedule.shtml
4:00pm Xerox PARC Forum
George Pake Auditorium, Xerox PARC
Intelligent Information Access
Ramana Rao
Inxight
http://www.parc.xerox.com/ops/projects/forum
4:15pm Symbolic Systems Honors Projects II
Location to be announced
4:15pm AI-Vision-Robotics Division Colloquium
Gates 104
To be announced
Kenneth Salisbury
MIT
http://www-formal.stanford.edu/aicolloq/
4:15pm Frontiers of Neuroscience Seminars
Munzer Auditorium
How do fish smell? Spatial encoding of olfactory
information
Dr. Sigrun Korsching
University of Cologne
Host: Dr. Lubert Stryer
http://www.stanford.edu/dept/nbio/Spring98.html
8:00pm Kant Lectures
Cubberley 128 (Education)
Making Up People:
"Making Up Dreams"
Ian Hacking
Victoria College, University of Toronto
http://www-philosophy.stanford.edu/general/colloqs.html
4:15pm CS548: Distributed Systems Research Seminar
Gates B01
CORBA, Java, etc.
Kierran Harty
http://www.stanford.edu/class/cs548/
FRIDAY, 29 MAY
all day Seventh CSLI Workshop on Logic, Language, and Computation
Cordura 100
http://www-linguistics.stanford.edu/Linguistics/llc/
Some information below
12:30pm Seminar on People, Computers, and Design
Gates B03 (NEC classroom)
Work beyond the Desktop: Our Cooperative Building and
Roomware
Erich J. Neuhold
GMD-IPSI & T.U.. Darmstadt
Abstract below
3:15pm Philosophy Department Colloquium
Bldg. 90:92Q (Philosophy)
Ian Hacking
Victoria College, University of Toronto
http://www-philosophy.stanford.edu/general/colloqs.html
3:15pm Cognitive Seminar
Jordan Hall 420:100
Beth Marsh
3:30pm Linguistics Department Colloquium
Margaret Jacks Hall 460:146
Split-Base Effects: Analysis and Significance
Donca Steriade
UCLA
Abstract below
3:15pm Computer Science Database Seminar
Gates B-12
To be announced
Ramanathan Guha
Netscape
____________
STANFORD SEMANTICS WORKSHOP
on Wednesday, 20 May 1998, 12 noon
Margaret Jacks Hall 460:146
http://www-linguistics.stanford.edu/semgroup/
Remarks on Information Packaging in Japanese
John Fry
Linguistics and CSLI, Stanford
I will review certain aspects of Japanese syntax and prosody which
involve informational notions such as focus and ground, and try to
incorporate these into the formal, filecard-based theory of
information packaging developed by Vallduvi (1992). The motivation
for a formal account of Japanese information packaging is my
continuing work on a Japanese spoken dialogue system.
____________
ME297: DESIGN THEORY AND METHODOLOGY SEMINAR
on Wednesday, 20 May 1998, 3:15pm
http://cdr.stanford.edu/DD/Courses/me297/
Dynamic Project Management for Collaborative Product Development
Dr. Hisup Park
Macroscape, Inc.
In spite of numerous advancements in computer technology, project
management in a dynamic environment is still achieved manually,
relying primarily on haphazard meetings and manual documentation.
Coordination of activities is carried out in ad hoc fashion, and too
often, overlooked critical constraints materialize later as conflicts
and unforeseen contingencies. Can computer tools help formalize and
facilitate project management in the interest of reducing the cycle
time and cost of the development? To a large extent, this is not
possible unless computer tools can adequately address capture,
integration and coordination of product development processes. This
discussion will address one approach to formalizing the capture,
integration, and coordination of the process components through a
simplified modeling framework. A simple scenario will be used to
illustrate how a development group can improve a collaborative product
development process measurably using this approach.
Biography: Hisup Park developed the Design Roadmap process modeling
framework while working on his Ph.D. at Stanford CDR. Hisup worked at
Lockheed and Sandia National Labs in various concurrent engineering
and enterprise integration projects. He has most recently founded
Macroscape, Inc.
____________
SEMINAR ON COMPUTATIONAL LEARNING AND ADAPTATION (SCLA)
on Wednesday, 20 May 1998, 4:15pm to 5:30pm
Cordura 100
http://www-csli.stanford.edu/cll/scla.html
User Guidance for Performing Knowledge Discovery in Databases
Rudi Studer
Institute AIFB, University of Karlsruhe, Germany
on sabbatical at
Computer Science, Stanford University
An important success factor for KDD lies in the development and
integration of methods for supporting the construction and execution
of KDD processes. There are three crucial aspects in this context: the
(incremental) development of a precise problem description; the
decomposition of this top level problem description into manageable
and compatible (reusable) subtasks; and the selection and combination
of adequate algorithms -- based on data characteristics among others
-- for solving these subtasks. In this talk, I outline the basic
principles and methods of the User Guidance Module that provides
support for both top-down problem refinement and decomposition as well
as bottom-up data analysis and algorithm selection. Bottom-up data
analysis is based on a collection of statistical and information
theoretic measures.
____________
EE380: COMPUTER SYSTEMS COLLOQUIUM
on Wednesday, 20 May 1998, 4:15pm to 5:30pm
NEC Auditorium (B03), Gates Computer Science Building
http://www.stanford.edu/class/ee380/
Traffic Control and QoS Management In the Internet
Hui Zhang
Carnegie Mellon University
Due to the success of Internet, we see two important trends: first,
the Internet is involving into a global and commercial communication
infrastructure, second, the Internet technology is now the technical
basis for not only the Internet but also for most data communication
networks, both public and private.
These new developments are stretching the limits of the original
design of TCP/IP along all possible dimensions. In particular, the
best-effort service model and the end-system-only (cooperating TCP
sources) traffic management scheme are no longer adequate. New service
models and sophisticated resource management algorithms and protocols
have been developed. They include improvements to TCP algorithms
(Vegas, SACK, new Reno), router mechanisms for congestion management
(RED, Fair Queuing), service models, protocols, algorithms to support
end-to-end QoS on a per flow basis (intserv, RSVP, traffic control,
admission control), and more recently, service models and algorithms
to support QoS for traffic aggregates (diffserv, provisioning). In
this talk, I will discuss the fundamental issues and tradeoffs in
designing traffic control and QoS management algorithms for the
Internet. Throughout the talk, I will discuss the architectural
implications of the new algorithms/protocols/service models, including
their impact on the original important goals for Internet:
scalability, robustness, and heterogeneity.
Biography: Hui Zhang is an assistant professor at the School of
Computer Science of Carnegie Mellon University. He received his
Ph.D. degree in Computer Science from the University of California at
Berkeley. Before joining the faculty at CMU in 1995, he spent one year
at the Lawrence Berkeley National Laboratory as a Post Doctoral
Fellow. Professor Hui Zhang has conducted research in the area of
resource management algorithms and protocols for wide-area
internetworks for the last 8 years. His research includes scheduling,
traffic characterization, admission control, routing, congestion
control, reliable multicasting algorithms, and real-time
protocols. Professor Zhang received the National Science Foundation
CAREER Award in 1996.
____________
CSLI COGLUNCH
on Thursday, 21 May 1998, 12 noon
Cordura Hall, Room 100
http://www-csli.stanford.edu/csli/Coglunch/
The Evolution of Inference
Brian Skyrms
UC Irvine, Philosophy
http://www.humanities.uci.edu/philosophy/skyrms/info.htm
I discuss the evolution of conventions of meaning in signaling games,
along the lines of the last chapter of my Evolution of the Social
Contract. Then I extend the model to account for the evolution of
"proto-truth functional" signals. Finally, I extend it a little more
to account for the evolution of a rudimentary "proto-truth functional"
inference.
____________
XEROX PARC FORUM
on Thursday, 21 May 1998, 4:00pm - 5:00pm
George Pake Auditorium, Xerox
http://www.parc.xerox.com/ops/projects/forum/
G-Force and Ladder Logic
The Gunn Robotics Team
http://www.gunn.palo-alto.ca.us/activities/orgs/grt/
"What do you get when you confine 40 teenagers to a dark room for six
weeks with no sleep and nothing to eat except sawdust and sheet metal?
What happens when otherwise normal young people shave their heads and
start carrying big power tools? How can one robot save the world? This
is your chance to meet a group of students that even Jerry Springer
wouldn't mess with -- this is your chance to meet the GUNN ROBOTICS
TEAM!"
Come see the story of GRT's participation in the FIRST Robotics
Competition held at Epcot Center in Orlando this past April. The
annual competition, created by MIT Professor Woodie Flowers and
entrepreneur/engineer Dean Kamen, included a robotics battle, an
animation competition, and a community citizenship outreach award. GRT
members will demonstrate the robot and tell what it's like to test
your engineering project in front of ten thousand screaming people.
____________
AI-VISION-ROBOTICS DIVISION COLLOQUIUM
on Thursday, 21 May 1998, 4:15pm until 5:30pm
Gates 104
http://www-formal.stanford.edu/aicolloq/
Automated Software Engineering Research at NASA Ames
Michael Lowry, Jeffrey Van Baalen, Klaus Havelund
Computational Sciences Division
NASA Ames Research Center
http://ic-www.arc.nasa.gov/ic/projects/amphion/
Motivated by NASA's need for high-assurance software, NASA Ames is
pursuing research in using automated reasoning to synthesize and
verify complex software systems, including intelligent systems based
on autonomy technology. This talk will describe two ongoing lines of
research: program synthesis based on automated deduction, and
verification of intelligent systems using model checking technology.
We will describe a mature program synthesis system called Amphion
which has been applied to a number of NASA application domains. It
enables non-programmer end-users to develop problem specifications
graphically, and then generates a program that achieves the
specification through a composition of components from a component
library. We will focus particularly on Amphion/NAIF, which generates
solar system observation opportunity analyzers. For example, suppose a
space scientist wants to determine the opportunities for the Cassini
spacecraft, while orbiting Saturn, to transmit an unobstructed signal
to the Goldstone observatory on earth. Before Amphion/NAIF the
scientist was required to write a Fortran program consisting of calls
to subroutines in the SPICE library (developed at JPL). Amphion/NAIF
provides the space scientist with a high-level graphical editor with
which desired observation opportunities can be specified without
knowing about the SPICE library. Amphion/NAIF automatically generates
required Fortran programs from such specifications. The system also
includes an animation component that provides scientifically realistic
simulations of generated programs, and a component that explains the
synthesized program.
We will then present an overview of Meta-Amphion, a long range
research project in the Automated Software Engineering (ASE) group.
Meta-Amphion is a system that specializes a deductive synthesis system
consisting of a domain theory and a general-purpose theorem prover.
The specialization technique takes as input a domain theory and a
library of parameterized decision procedures. It identifies instances
of the theories of these procedures in the domain theory, interfaces
the procedure instances to a refutation-based theorem prover (SNARK
from SRI), and often removes the identified axioms from the domain
theory. The result is a deductive synthesis system that is specialized
to the given domain theory and usually far more efficient than the
original system.
We will then describe a case study of verifying components of the
Remote Agent, which is an intelligent system developed jointly by Ames
and JPL AI researchers to achieve spacecraft autonomy. We were able to
identify through model-checking a number of subtle concurrency errors
that occurred in the Lisp-based executive portion of the remote agent,
which would not have been found in the course of normal testing.
Similar errors have previously caused extended loss of spacecraft
functions, for example on Mars Pathfinder and the first Brazilian
micro-spacecraft. We briefly describe current research to enable this
type of formal verification to be used directly by developers.
____________
SEMINAR ON PEOPLE, COMPUTER, AND DESIGN
on Friday, 22 May 1998, 12:30-2:00pm
Gates B03 (NEC Classroom)
http://hci.stanford.edu/html/cs547.html
(SITN Channel E2)
Communicating with Machines
Using Speech, Gesture, and Facial Expression
Justine Cassell
MIT Media Lab
http://www.media.mit.edu/~justine/
Humans communicate with one another using speech, prosodic cues, hand
gestures, gaze and facial expression. When we try to communicate with
computers, however, we are reduced to using text or limited speech.
And computers respond with text or monotone speech, depriving us of
the cues provided by those other communicative modalities. In this
talk I will discuss advances in giving computers the ability to
produce and interpret not only speech but also intonation, hand
gesture, and facial movements. I will show examples of 'embodied
conversational agents' -- animated human-like figures who increasingly
are able to produce and interpret the full range of human
conversational behaviors.
Biography: Justine Cassell is faculty at MIT's Media Laboratory. She
holds a double PhD from the University of Chicago, in Linguistics and
Psychology. Cassell studies how autonomous agents and toys can be
designed with psychosocial competencies, based on an understanding of
human linguistic, cognitive and social abilities. Current projects
include embodied conversational agents, interactive storytelling
systems, and toys that encourage technological fluency in both boys
and girls. Justine Cassell is co-editor of From Barbie to Mortal
Kombat Gender and Computer Games, published by MIT Press (to appear
Fall '98), and has published in journals as diverse as Poetics Today
and Computer Graphics.
____________
PHILOSOPHY CONFERENCE
The Flow of Information:
A Conference in Honor of
Fred Dretske
on Friday, 22 May 1998, afternoon
Cordura 100
http://www-philosophy.stanford.edu/general/dretske.html
Admission is free. Each paper will be followed by discussion and a
short break.
1:00pm John Perry, Stanford University
"The Chardonnay is in the Fridge"
2:00pm Dennis Stampe, University of Wisconsin, Madison
"Some Remarks on Voluntary Action"
3:15pm Peter Godfrey-Smith, Stanford University
"Dretske's Program in Epistemology and Philosophy of Mind"
4:15pm Berent Enc, University of Wisconsin, Madison
"Indeterminacy of Function Attributions"
5:15pm Comments on the papers by Fred Dretske, and general discussion.
6:00pm Reception
For further information contact Jill Johnston
Attn: Dretske Conference
Dept. of Philosophy
Stanford University
Stanford, CA 94305-2155
Phone: (650)723-2547 Fax: (650)723-0985
jillj@leland.stanford.edu
____________
COMPUTER SCIENCE DATABASE SEMINAR
on Friday, 22 May 1998, 3:15pm - 4:30pm
Gates B12
http://www-db.stanford.edu/dbseminar/dbseminar.html
The Internet, Electronic Commerce, and Databases
Thomas Kurian
Director, Internet Computing
Oracle Data Server Division
Three primary trends in the Internet market - personalized content,
electronic commerce and application hosting - promise to fundamentally
alter the way in which the Internet will be used in the next 3-5
years. These trends are placing new requirements on database
infrastructure using databases as multimedia content stores, web
scripting platforms, transactional engines and directories. The
discussion will provide an overview of these market trends, their
implications for database infrastructure, and the integration of a
number of new technologies - XML, Javascript, Enterprise Java Beans,
LDAP-based Directory Services that promise to fundamentally change the
way in which databases will be used in the near future.
____________
STANFORD PHONOLOGY WORKSHOP
on Wednesday, 27 May 1998, 10:00am
Margaret Jacks Hall 460:146
http://www-linguistics.stanford.edu/pinterest/
Morpheme Structure Constraints and Paradigm Occultation
John McCarthy
Department of Linguistics
Umass Amherst
Standard generative phonology recognizes the existence of special
restrictions on underlying representations, called "Morpheme Structure
Constraints" (MSC's). Work in Optimality Theory (Prince & Smolensky
1993) argues that there are no MSC's per se; rather, the effects of
all putative MSC's can be derived from constraints on the output by
the logic of "Stampean Occultation" (so named in tribute to David
Stampe, whose 1972 dissertation contains similar ideas). This argument
is important because it is a necessary step in OT's solution to
Conspiracies (Kisseberth 1970) or the Duplication Problem (Kenstowicz
& Kisseberth 1977).
In this talk, I identify certain cases that initially seem to be
incompatible with Prince & Smolensky's claim. They involve output
restrictions on a root morpheme that hold in all words derived from
that root -- even in words that shouldn't be subject to those
restrictions. I then show how to solve this problem by bringing the
notion of OO Faithfulness (Benua 1995, 1997; Burzio 1994 et seq.;
Kenstowicz 1994; etc.) into the logic of Stampean Occultation,
expanding on some ideas in Tesar & Smolensky 1996. Examples to be
analyzed include root minimality in Kansai Japanese and restrictions
on root-final consonants in Makassarese. These cases are of particular
interest because, as I will show, they could not be revealingly
analyzed in terms of classic MSC's, even though they initially seem to
demand MSC treatment.
____________
STANFORD SEMANTICS WORKSHOP
on Wednesday, 27 May 1998, 1:00pm
Margaret Jacks Hall 460:146
http://www-linguistics.stanford.edu/semgroup/
Conditionals R Us: From IF to IFF via R-based implicature
Laurence Horn
Yale University
http://www.yale.edu/linguist/faculty/horn.html
In this talk, I present my version of conditional perfection and
related phenomena, responding to two papers Johan van der Auwera
published last year.
____________
SEVENTH ANNUAL CSLI WORKSHOP ON
LOGIC, LANGUAGE AND COMPUTATION
29-31 May 1998
Cordura 100
http://www-linguistics.stanford.edu/Linguistics/llc/
The Workshop is organized by Johan van Benthem, Martina Faller, Rob
van Glabbeek, David Israel, and David Beaver.
This year's program reflected the usual lively mix of topics and
interests that CSLI was designed to bring together. It includes recent
developments in dynamic processing of linguistic and non-linguistic
information, as well as key techniques from mathematical logic that
underlie both formal proof and computation. The mix also includes
contributions by established researchers and by newcomers to the
field, in line with a long-standing tradition. Finally, some
contributions this year reflect the growing interactions with a
broader world, witness talks on logic teaching, as well as
presentations by representatives of industry and high performance
computing. We hope to broaden our 'circle of debate'.
For more information, contact faller@csli.stanford.edu (Martina
Faller) or check http://www-linguistics.stanford.edu/Linguistics/llc/.
____________
SEMINAR ON PEOPLE, COMPUTER, AND DESIGN
on Friday, 29 May 1998, 12:30-2:00pm
Gates B03 (NEC Classroom)
http://hci.stanford.edu/html/cs547.html
(SITN Channel E2)
Work beyond the Desktop:
Our Cooperative Building and Roomware Projects
Erich J. Neuhold
GMD-IPSI & T.U.. Darmstadt
The availability of the worldwide information infrastructure and the
ever present computer power is profoundly changing the way we do our
work in every type of enterprise. Our notion of Cooperative Building
places the human into the center of attention and tries to
substantially reduce the currently unnecessary high cognitive overload
one faces when dealing with the opportunities offered. This
perspective needs to address issues from information technology, new
work practices, organizational innovation, new physical and virtual
architectural structures and facilities management at work, at home,
and on the road.
In this talk I will illustrate the general idea further and then
concentrate on two specific project groups:
* Virtual Cooperative Meeting Rooms are being developed for
discussions, on the job learning, and conferencing and are
currently utilized and evaluated in support of distributed
government agencies, global as well as virtual enterprises, and
distributed congresses. Multimedia and large screen based meeting
support as well as handling of distributed large document
depositories (on SGML and XML basis) are concentration points in
our approach.
* I-Land integrates several so-called 'room ware' components into a
combination of real architectural and virtual work environments
for dynamic teams. An Electronic Wall, an Interactive Table and
Computer-enhanced Chairs are currently explored, evaluated and
integrated into this environment
Biography: Prof. Dr. Erich J. Neuhold is the Director of the Institute
for Integrated Publication and Information Systems of the German
National Research Center for Information Technology in Darmstadt,
Germany. His primary research and development interests are in
heterogeneous interoperable database systems, object-oriented
multimedia knowledge bases and intelligent information retrieval. He
also guides research and development in user interfaces including
virtual reality concepts for information visualization, computer
supported cooperative work, virtual meetings and conferences as well
as integrated publication and information systems with special
emphasize on multimedia hyperdocuments and on information mining in
complex distributed systems. He is also Professor of Computer Science,
Integrated Publication and Information Systems, at the Darmstadt
University of Technology, Germany. He has published 4 books and about
100 papers.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
on Friday, 29 May 1998, 3:30pm
Margaret Jacks Hall, Room 460:146
http://www-linguistics.stanford.edu/colloq/colloq.html
Split-Base Effects: Analysis and Significance
Donca Steriade
University of California, Los Angeles
http://www.humnet.ucla.edu/humnet/linguistics/people/steriade/steriade.htm
There are at least three distinct interpretations of the statement in
(1):
(1) "identify is the base of identifiable."
On a first interpretation, identify is the morphosyntactic base of the
derived word identifiable: a syntactic property of identify -- the
fact that it is a transitive verb -- is a prerequisite for the
affixation of -able. On a second interpretation, identify is the
semantic base of identifiable: the semantics of the -able form are a
function of those of the verb contained within it. A third
interpretation of (1) has to do with phonology : the phonological
shape of the -able word is a function of the shape of its inner
constituent.
One goal of the talk is to show that the usual conflation of the
concepts of phonological and morphosyntactic or semantic base cannot
be maintained. This can be shown by examining a cases in which complex
expressions are formed by reference to several distinct reference
terms: this is the split-base effect. For instance, in forming a novel
adjective such as remediable (recorded with this stress in the OED but
treated as a nonce form by most speakers), the speaker must consult
not only the verb remedy, which serves as its morphosyntactic base,
but also the adjective remedial, which serves its phonological base,
in lending its stress to the -able form. I argue that split-base
effects arise when the morphosyntactic or semantic base of affixation
lacks a phonological property that is desirable in the derivative: in
such cases, the derivative may adopt the phonology of a distinct
listed allomorph, here the stress of remedial. The stress pattern
adopted in the novel form must however have a lexical precedent, a
precedent in a listed allomorph: it is this requirement that blocks
(for many speakers) forms like remediable. Split-base effects will be
documented for a large class of English suffixes -- previously
classified as belonging to Level 1 (e.g., -atory, -ify), Level 2
(e.g., -ize, -ism) and variably Level 1 or 2 (e.g., -able). In all
these cases, novel affixed forms display the systematic option of
metrical improvement, but only in lexical paradigms that include more
than one stress pattern. It is shown that the notion of lexical
conservatism (avoidance of phonologically innovative forms) provides a
better classification of English affixes than the Level 1/Level 2
distinction or the recent OT successors of these notions
(output-output correspondence to a unique base form).
The talk's second point is to outline an analytical framework that
uses the notion of lexical conservatism to characterize in unified
fashion both split-base and single-base derivatives.
____________
END MATERIAL
The CSLI Calendar appears weekly on Wednesdays throughout the academic
year. Announcements, abstracts, and other information to appear in
the Calendar should be submitted to the editor, who reserves the right
to decide what does or does not go in the calendar
mailto:incalendar@csli.stanford.edu.
Requests to be added to the mailing list should be sent to
mailto:majordomo@csli.stanford.edu. With the lines in the body of
the text of either
subscribe csli-calendar
for the long form or
subscribe csli-short-calendar
for the short form. Problems with subscribing or unsubscribing should
be sent to owner-csli-calendar@csli.stanford.edu.
The full current issue is at
http://www-csli.stanford.edu/csli/Archive/calendar/current.html
and the archives at
http://www-csli.stanford.edu/csli/Archive/calendar/.
People on most of the CSLI computers can type 'help csli-calendar' to
see the current issue.
The CSLI Calendar is also posted each week to
news://nntp-csli.stanford.edu/csli.bboard.
Information about CSLI's research program is available at
http://www-csli.stanford.edu/csli/.
For maps to the Stanford University campus see
http://www.stanford.edu/home/visitors/maps.html.
____________