[Date Prev][Date Next][Date Index]
CSLI Calendar, Wednesday, 11 September 2002, vol. 18:1
CSLI CALENDAR OF PUBLIC EVENTS
______________________________________________________________________
11 September 2002 Stanford Vol. 18, No. 1
______________________________________________________________________
A weekly publication of the
Center for the Study of Language and Information (CSLI)
Stanford University, Ventura Hall, Stanford, CA 94305-4115
http://www-csli.stanford.edu/
____________
ACTIVITIES FROM 11 SEPTEMBER 2002 TO 20 SEPTEMBER 2002
THURSDAY, 12 SEPTEMBER 2002
4:00pm PARC Forum
George Pake Auditorium at PARC
Creation and Cosmology:
Fruitful Interactions Between Science and Religion
Robert Russell
Center for Theology and the Natural Sciences, UC Berkeley
http://www.parc.com/forum/
4:00pm SRI AI Seminar Series
EJ228, SRI International
Specializing Resolution - Herbrand Award Speech
Mark Stickel
AI Center, SRI International
http://www.ai.sri.com/seminars/
Abstract below
4:00pm UC Berkeley CIS Seminar
Soda Hall 310 (UC Berkeley)
Natural Language Parsing: Graphs, the A* Algorithm, and Modularity
Christopher Manning
Computer Science and Linguistics, Stanford University
http://www.cs.berkeley.edu/~eyal/cis-seminar
Abstract below
THURSDAY, 19 SEPTEMBER 2002
4:00pm UC Berkeley CIS Seminar
Soda Hall 310 (UC Berkeley)
Title to be announced
Yi Ma
Electrical and Computer Engineering, U. Illinois at Urbana-Champaign
http://www.cs.berkeley.edu/~eyal/cis-seminar
____________
Stanford Blood Bank status: Shortage of O-, O+, A+, A-, B+. For an
appointment: http://bloodcenter.stanford.edu/ or call 650-723-7831.
It only takes an hour of your time.
____________
ANNOUNCEMENTS
Welcome to the 18th year of the CSLI Calendar (and the 20th year we've
been publishing a weekly listing of events, in the first couple of
years it had a different name). The Stanford academic year hasn't
started yet but Berkeley is already bustling with seminars and even a
new center:
With the newly established Center for Intelligent Systems (CIS) the
AI/Robotics/Vision seminar is now the forum for presentations
relating to the interests of the Center's members. The talks are
intended to create awareness and interest for all of the members of
the AI, Vision and Robotics communities, with the intention of
bridging the gaps and creating collaborations.
Each semester will have a different interdisciplinary theme in
addition to the "regular" presentations. This semester (Autumn
2002) the theme will be empirical computational linguistics; the
speakers on this theme will be hosted by Prof. Marti Hearst. The
seminar will be held every Thursday at 4pm in Soda Hall 310. The
web page for the seminar includes the schedule for the semester, how
to subscribe to the seminar's email list, and a host of relevant
resources. See:
http://www.cs.berkeley.edu/~eyal/cis-seminar/
Further announcements of this seminar will be sent to
ai-seminar@cs.berkeley.edu. To subscribe to this email list, send
email to majordomo@cs.berkeley.edu with the body "subscribe
ai-seminar" (this email list is soon to be called "cis-seminar", so
if the email list server rejects "subscribe ai-seminar", try
"subscribe cis-seminar"). (From Eyal Amir)
____________
CLASS/SEMINAR ANNOUNCEMENTS
Seminar on Events
Barbara Tversky
Psychology, Stanford
We will discuss many aspects of event perception, cognition, and
communication, including work from philosophy, social psychology,
cognitive science, neuro, linguistics, media and art. Sessions led by
a participant in the class, with appropriate readings.
We will meet some Mondays, some Thursdays, 3:15-5:00pm Oct 3, Oct 7
(M), Oct 10, Oct 24, Nov 4 (M), Nov 7, Nov 14, Nov 18 (M), Nov 25 (M),
Dec 5
Thursdays 3:15 Room 348
Mondays 3:15 Room 417
____________
SRI AI SEMINAR SERIES
on Thursday, 12 September 2002, 4:00pm - 5:00pm
EJ228, SRI International
http://www.ai.sri.com/seminars/
Specializing Resolution - Herbrand Award Speech
Mark Stickel
AI Center, SRI International
Much automated deduction research has focused on creating theorem
provers that use uniform reasoning procedures (e.g., resolution). An
alternative approach, used successfully in verification, involves the
use of specialized reasoners and their combination. We defend the use
of resolution and argue that resolution can be easily extended to do
specialized reasoning effectively, at least sometimes. As an example,
we describe the method used in the resolution-based SNARK system to
implement qualitative temporal (Allen's intervals) and spatial (RCC8)
reasoning.
About the Speaker: Mark Stickel is the winner of the 2002 Herbrand
Award, given each year for career contributions to automated
reasoning. Refreshments will be provided after the talk as a
celebration in Mark's honor.
Note for visitors to SRI: Please arrive at least 10 minutes early in
order to sign in and be shown to the conference room. SRI is located
at 333 Ravenswood Avenue in Menlo Park. Visitors may park in the
visitors lot in front of Building A or E, and should sign in at the
lobby of Building E and call 2592 to be escorted to the meeting room.
Directions to SRI, as well as maps,are available online through the
WWW at URL http://www.ai.sri.com/visiting .
____________
UC BERKELEY CIS SEMINAR
on Thursday, 12 September 2002, 4:00pm
Soda Hall 310 (UC Berkeley)
http://www.cs.berkeley.edu/~eyal/cis-seminar
Natural Language Parsing: Graphs, the A* Algorithm, and Modularity
Christopher Manning
Stanford University
http://nlp.stanford.edu/~manning/
Probabilistic parsing methods have in recent years transformed our
ability to robustly find correct parses for open domain sentences.
But people normally still think of parsers in terms of logical
presentations via the notion of "parsing as deduction". I will
instead connect stochastic parsing with finding shortest paths in
hypergraphs, and show how this approach naturally provides a chart
parser for arbitrary probabilistic context-free grammars (finding
shortest paths in a hypergraph is easy; the central problem of parsing
is that the hypergraph has to be constructed on the fly). Running
such a parser exhaustively, I will briefly consider the properties of
the Penn Treebank (the most used hand-parsed corpus): the vast parsing
ambiguity that results from these properties and how simple models can
accurately predict the amount of work a parser does on this corpus.
Using the hypergraphical viewpoint, a natural approach is to use the
A* algorithm to cut down the work in finding the best parse. On
unlexicalized grammars, this can reduce the parsing work done
dramatically, by at least 97%. This approach is competitive with
methods standardly used in statistical parsers, while ensuring
optimality, unlike most heuristic approaches to best-first parsing.
Finally, I will present a novel modular generative model in which
semantic (lexical dependency) and syntactic structures are scored
separately. This factored model is conceptually simple,
linguistically interesting, and provides straightforward opportunities
for separately improving the component models. Further, it provides a
level of performance close to that of similar, non-factored models.
And most importantly, unlike other modern parsing models, the factored
model permits the continued use of an extremely effective A*
algorithm, which makes efficient, exact inference feasible.
This is joint work with Dan Klein.
About the Speaker: Christopher Manning is an Assistant Professor of
Computer Science and Linguistics at Stanford University. He received
his Ph.D. from Stanford University in 1995, and served on the faculty
of the Computational Linguistics Program at Carnegie Mellon University
(1994-1996) and the University of Sydney Linguistics Department
(1996-1999) before returning to Stanford. His research interests
include probabilistic models of language, natural language parsing,
constraint-based linguistic theories, syntactic typology, information
extraction and text mining, and computational lexicography. He is the
author of three books, including Foundations of Statistical Natural
Language Processing (MIT Press, 1999, with Hinrich Schuetze).
____________
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
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 (i.e., no abstracts). 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/Archive/calendar/current.shtml
and the archives at
http://www-csli.stanford.edu/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.
and
news://news.stanford.edu/su.events
Information about CSLI's research program is available at
http://www-csli.stanford.edu/
For maps to the Stanford University campus see
http://www.stanford.edu/home/visitors/maps.html
____________