Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 06 No. 26
NL-KR Digest (Mon May 22 12:59:00 1989) Volume 6 No. 26
Today's Topics:
15 June new deadline for IJCAI-89 Travel Grant applications
conference announcement
Gene Identification (Unisys AI Seminar)
public domain database needed
CSLI Calendar, May 18, 4:27
Submissions: nl-kr@cs.rpi.edu
Requests, policy: nl-kr-request@cs.rpi.edu
Back issues are available from host archive.cs.rpi.edu [128.213.1.10] in
the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests will
not be promptly satisfied. If you can't reach `cs.rpi.edu' you may want
to use `turing.cs.rpi.edu' instead.
[[ Welcome new subscribers! I am working on a new version of the `welcome'
message, with some updated information in it, and since we just grew
by about 40 members, I will send this out in the next digest. This
issue is late since I was enjoying KR'89 last week...CW ]]
-----------------------------------------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 18 May 89 13:03:11 EDT
From: walker@flash.bellcore.com (Donald E Walker)
Subject: 15 June new deadline for IJCAI-89 Travel Grant applications
TRAVEL GRANTS FOR IJCAI-89
IJCAII has established a program to provide travel support for
participants attending IJCAI-89 in Detroit, Michigan. The amounts
awarded will vary depending on location and on the number of persons
applying. Priority will be given to younger members of the AI
community who are presenting papers or are on panels and who would
not otherwise be able to attend because of limited travel funds.
Applications should be received no later than 15 June 1989. They
should briefly identify the expected form of conference participation;
describe benefits that would result from attendance; specify current
sources of research funding; and list travel support from other
sources. A brief resume should be attached, and students should
include a letter of recommendation from a faculty member.
Five copies of the application should be sent to:
Priscilla Rasmussen, IJCAI-89 Travel Grants
Laboratory for Computer Science Research
Hill Center, Busch Campus
Rutgers, the State University
New Brunswick, NJ 08903, USA
(+1-201)932-2768
internet: rasmussen@aramis.rutgers.edu
------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 11 May 89 15:29:22 EDT
From: Eric.Nyberg@NL.CS.CMU.EDU
Subject: conference announcement
CALL FOR PAPERS -- CALL FOR PAPERS -- CALL FOR PAPERS -- CALL FOR PAPERS
1989 NELS 20
North Eastern Linguistics Society
Carnegie Mellon University
University of Pittsburgh
November 3--5, 1989
INVITED SPEAKERS:
Morris Halle, MIT
Richard Kayne, CUNY
Abstracts are invited for 20-minute talks. Send six copies of a one-page
abstract. Do not identify yourself on the abstract, but enclose a 3 x 5
card showing your name, address, affiliation, and the title of your paper.
Preregistration Fee: $30 for faculty, $20 for students. On-site
Registration Fee: $50 for faculty, $30 for students. Make checks payable to
"CMU Department of Philosophy". Please indicate whether you require
housing, day care, or ASL interpretation.
Deadline for abstracts: August 15
Address abstracts and inquiries to:
NELS 20 Committee
Department of Philosophy
Carnegie Mellon University
Pittsburgh, PA 15213
(412) 268-5085
(412) 268-5086
Note: The program is not limited to any single theoretical framework.
We welcome abstracts representing diverse viewpoints.
------------------------------
To: nl-kr@cs.rpi.edu
Date: Mon, 22 May 89 12:23:45 -0400
From: finin@PRC.Unisys.COM
Subject: Gene Identification (Unisys AI Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Computer Identification of Eukaryotic Genes
in Uncharacterized Sequences:
Applications to the Genome Project.
Dr. Periannan Senapathy
Biotechnology Center
University of Wisconsin
An international effort is now underway to determine the complete
nucleotide sequence of the human genome (about 3.5X10^9 nucleotides)
as well as those of other biomedically important organisms. In
accomplishing this goal, large regions of raw sequence data will be
generated, and major tasks will include analysis to identify and
characterize genes within the sequence data. Statistical analysis and
computer algorithms will be the primary tools to address these
problems. In this talk, I will first present the motivation for the
human genome project and then discuss my current work on the
statistical basis for identifying eukaryotic genes.
3:30pm Monday, May 22
Cafeteria Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to finin@prc.unisys.com or call 215-648-7446 --
------------------------------
To: nl-kr@cs.rpi.edu
From: hemphill@csc000.csc.ti.com (Charles Hemphill)
Newsgroups: comp.databases,mail.nl-kr,comp.lang.prolog
Subject: public domain database needed
Keywords: NL, speech, KR, DB, evaluation
Date: 12 May 89 21:56:30 GMT
Reply-To: hemphill@ads.com (Charles Hemphill)
Followup-To: comp.databases
The speech research branch at Texas Instruments would like information
about public domain databases. A database is needed to support
research toward combining speech and natural language systems (SLSs)
to produce spoken language systems. For more details, continue
reading.
Our primary goal is to promote research on SLS algorithms across sites
through objective evaluation using a recorded corpus of speech.
Ideally, evaluation would proceed by comparing the logical form
produced by the SLS under test to a predetermined logical form
corresponding to the utterance. Unfortunately, comparison of logical
forms is an undecidable problem (Boolos and Jeffrey, 1980). Instead,
we propose to compare the answer from the query (a set of tuples,
yes/no, or numbers). This allows us to eliminate all variables,
quantifiers, and logical connectives, substantially simplifying the
comparison problem.
The underlying database should support a number of experimental
scenarios for a wide class of novice users. Two examples of databases
include personnel databases and airline travel databases. Personnel
databases are readily available, but do not easily sustain interest in
subjects who are not personnel administrators. Airline travel
databases could provide many scenarios for a wide class of users, but
the data and database scheme are normally proprietary. Since the
sponsor is DARPA, databases from government applications are
especially desirable. The ideal database should contain on the order
of a few thousand records, at least five tables (with interesting
relationships between them) and at least 30 attributes.
Corpus collection will proceed using an SLS simulation to elicit
natural speech and syntax. During the simulation, a human expert will
translate spoken input into the appropriate DB queries. This should
allow limited collection of dialog phenomena where anaphora and
ellipsis refer to previous queries and answers. Queries referring to
graphics or report generation will be eliminated. The corpus
collected will include orthographic transcriptions and should be
useful to both speech and natural language researchers separately.
A previously collected speech corpus, containing read speech under
studio quality conditions from several hundred speakers of various
dialects, is now available from the National Institute for Standards
and Technology (NIST, formerly NBS). This corpus supports research
for continuous speech recognition for either speaker dependent or
speaker independent algorithms.
------------------------------
To: nl-kr@cs.rpi.edu
Date: Wed, 17 May 89 17:27:37 PDT
From: emma@csli.Stanford.EDU (Emma Pease)
Subject: CSLI Calendar, May 18, 4:27
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
_____________________________________________________________________________
18 May 1989 Stanford Vol. 4, No. 27
_____________________________________________________________________________
A weekly publication of The Center for the Study of Language and
Information, Ventura Hall, Stanford University, Stanford, CA 94305
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 18 May 1989
12:00 p.m. TINLunch
Cordura Hall General Logics: Part 1
Conference Room Jose Meseguer
(meseguer@csl.sri.com)
Abstract below
2:15 p.m. CSLI Seminar
Cordura Hall Varieties of Context: Session 7
Conference Room If Cognition is situated, what can concepts be?
Jim Greeno
(greeno.pa@xerox.com)
Respondent: John Etchemendy
Background reading: "Productive Thinking" by Max
Wertheimer, chaps. 1 and 4, Westport, Conn.:
Greenwood Press, 1959.
No abstract
3:30 p.m. Tea
Ventura Hall
4:00 p.m. STASS Seminar
Cordura Hall PROSIT
Conference Room Stanley Peters
(peters@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 25 May 1989
12:00 p.m. TINLunch
Cordura Hall General Logics: Part 2
Conference Room Jose Meseguer
(meseguer@csl.sri.com)
Abstract below
2:15 p.m. CSLI Seminar
Cordura Hall Varieties of Context: Session 8
Conference Room Title to be announced
Jon Barwise
(barwise@russell.stanford.edu)
Respondent: Brian Smith
Abstract to appear
3:30 p.m. Tea
Ventura Hall
4:00 p.m. STASS Seminar
Cordura Hall Substitutional Recursion on Non-well-founded Sets
Conference Room and an Application to the Logic of Situation Theory
Tim Fernando
(fernando@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
General Logics
Jose Meseguer
(meseguer@csl.sri.com)
18 and 25 May
I will present and comment on a recent paper of mine by that title* in
two consecutive sessions. The first week's talk will be introductory
and leisurely; the second talk will be more demanding and technical.
The main question addressed in both talks is:
What is a logic?
That is, how should general logics be axiomatized? I will propose a
specific axiomatic answer to this question and apply that answer to
obtain axioms for logic programming.
Beyond their application to logic programming, the axioms proposed
for a logic are purposely very general so as to have wide
applicability within logic and many potential applications in computer
science. The connections between logic and computer science are
growing rapidly, and are becoming deeper. Besides theorem proving,
logic programming, and program specification and verification, other
areas showing a fascinating mutual interaction with logic include:
type theory, concurrency, artificial intelligence, complexity theory,
data bases, operational semantics and compiler techniques. The
concepts introduced are motivated by the need to understand and relate
the many logics currently being used in computer science, and by the
related need for new approaches to the rigorous design of computer
systems. Therefore, regarding its computer science applications, this
work has goals that are in full agreement with those of J. A. Goguen
and R. Burstall's theory of institutions; however, it addresses
proof-theoretic aspects not addressed by institutions. In fact,
institutions can be viewed as the model-theoretic component of the
present theory. The main new contributions include a general
axiomatic theory of entailment and proof, to cover the proof-theoretic
aspects of logic and the many proof-theoretic uses of logic in
computer science; they also include a general theory of mappings that
interpret one logic (or one proof calculus) in another, an axiomatic
study of categorical logics, and axioms for logic programming.
(*) "General Logics," to appear in Proceedings of the Logic Colloquium
'87, Amsterdam: North-Holland.
____________
NEXT WEEK'S STASS SEMINAR
Substitutional Recursion on Non-well-founded Sets and an
Application to the Logic of Situation Theory
Tim Fernando
(fernando@csli.stanford.edu)
May 25
Peter Aczel's theory of non-well-founded sets is developed with an
emphasis on "substitution"-based recursion and the solution of systems
of equations (over sets). In particular, a class of recursive
definitions encompassing all applications of non-well-founded sets
known to the author is isolated. A Tarski-style truth definition for
a rather rich situation-theoretic formalism is then given (based on
non-well-founded sets).
(The first part of the talk is based on a paper for the upcoming LICS
conference; the second part on a talk given last March at the STASS
conference in Asilomar.)
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Parameters of Consonantal Assimilation
Young-mee Cho
(yucho@csli.stanford.edu)
Friday, 19 May, 3:30, Cordura Conference Room
In the literature dealing with assimilation several universal
tendencies have been frequently noted. Recent proposals in
autosegmental phonology have been advanced to account for two of those
tendencies in particular: the asymmetry between possible propagating
values and the functional unity of certain sets of features. The first
generalization is that assimilation tends to spread marked feature
specification to segments. This asymmetry finds its natural
explanation in Underspecification Theory which dictates marked values
to be specified and unmarked values unspecified. The second
generalization has been explained by the theory of Feature Geometry.
It groups the phonological features into class nodes, which are
organized hierarchically so that their dependence and independence
relationships are properly encoded.
Building on these theoretical assumptions, and on the observations
of Steriade, I propose a parametric theory of consonantal
assimilation. The study is based on the detailed analysis of the
assimilation phenomena of Korean, Japanese, and Sanskrit, among other
languages and the main focus will be setting up a very limited set of
parameters in Universal Grammar as suggested below.
Parameters of Spreading
1. the site of spreading (any node or feature in FG)
2. the specification on target and trigger (e.g., coda-condition)
3. the direction of spreading (not related to the coda-condition):
right to left (Russian voicing assimilation), left to right
(Sanskrit Nati)
4. the prosodic locality conditions (proposed by Steriade): skeletal
adjacency (for most cases), syllabic adjacency (English coronals)
5. the relative order between spreading and redundancy rules:
spreading preceding redundancy rules (Ukranian voicing
assimilation), redundancy rules preceding spreading (Russian
voicing assimilation)
6. whether spread is iterative or not: iterative (Russian voicing
assimilation)
____________
SYMBOLIC SYSTEMS FORUM
Symbolic Systems Honors Presentations
The Architecture of Hyperproof
Alan Bush
(bush@csli.stanford.edu)
and
Neural Nets
Wendy Chow
(w.wino@macbeth.stanford.edu)
Friday, 26 May, 3:15, 60:62H
SYMBOLIC SYSTEMS FORUM
Computers and Ethics
Helen Nissenbaum
(nissenbaum@csli.stanford.edu)
Friday, 19 May, 3:15, 60:62H
Abstract in last week's Calendar
------------------------------
End of NL-KR Digest
*******************
