Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 09 No. 05
NL-KR Digest (Thu Feb 20 09:30:47 1992) Volume 9 No. 5
Today's Topics:
Query: help with dcg translator
Query: Looking for a German dictionary or thesaurus
Query: Help with Syntactic Tagging
Program: AI & SE Workshop
Announcement: AAAI Spring Symposium on Propositional KR
CFP: Seventh Annual Conceptual Graphs Workshop
CFP: BU Conference on Language Development
Talk: Charniak at Tulane University (past)
Submissions: nl-kr@cs.rpi.edu
Requests, policy: nl-kr-request@cs.rpi.edu
Back issues are available from host archive.cssage.rpi.edu [128.113.53.18] 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.
BITNET subscribers: we now have a LISTSERVer for nl-kr.
You may send submissions to NL-KR@RPIECS
and any listserv-style administrative requests to LISTSERV@RPIECS.
-----------------------------------------------------------------
To: nl-kr@cs.rpi.edu
Newsgroups: comp.ai.nlang-know-rep
From: terstal@cs.utwente.nl (Wilco ter Stal)
Subject: help with dcg translator
Originator: terstal@utis136
Keywords: prolog, NLgrammar, bottom-up parser
Nntp-Posting-Host: utis136
Date: Tue, 11 Feb 1992 10:31:54 GMT
I'm looking for a program (tool) which translates a definite clause
grammar (in prolog) into a prolog bottom-up parser. Such a program has
been mentioned in an article written by Yuji Matsumoto et. al.,1983.
Can anybody give more information on this.
Wilco ter Stal
University of Twente
The Netherlands
email: terstal@cs.utwente.nl
------------------------------
To: nl-kr@cs.rpi.edu
Newsgroups: comp.ai,comp.ai.nlang-know-rep,sci.lang,soc.culture.german,...
From: imlah@canon.co.uk (Bill Imlah)
Subject: Looking for a German dictionary or thesaurus
Reply-To: imlah@canon.co.uk
Date: Thu, 13 Feb 92 09:34:48 GMT
[I'm posting this for a friend who's not on email, so please
reply to me]
Does anyone know of a German language dictionary or thesaurus,
preferably compatible with IBM PC? (or alternatively an address
or telephone number of an organisation that could supply one).
Thanks.
- -------------------------------------------------------
Bill Imlah imlah@canon.co.uk
Canon Research Centre Europe, 17/20 Frederick Sanger Rd.
The Surrey Research Park, Guildford, Surrey, GU2 5YD, UK.
------------------------------
To: nl-kr@cs.rpi.edu
From: Russell Collingham <R.J.Collingham@durham.ac.uk>
Date: Mon, 10 Feb 92 12:19:24 GMT
Subject: Help with Syntactic Tagging
I am looking for information on syntactic tagging of (spoken) text.
Essentially I am looking for some tag sequence statistics. I am using
the OALD (Oxford Advanced Learner's Dictionary), and I have 12 broad
syntactic class tags:
VERB
NOUN
ADJ (adjective)
ADV (adverb)
PRON (pronoun)
ART (article)
PREP (preposition)
CONJ (conjunction)
PART (particle)
PRFX (prefix - not that essential)
INTJ (interjection)
OTHER
I am looking for either (or both!):
a) a CLAWS like program that will tag some corpora of University lectures
that I have with the above tags (or the LOB tags as I can easily convert
from the LOB tags to my tags). (LOB = Lancaster/Oslo/Bergen Corpus)
b) statistics for sequences of, say, upto three or four of the above tags
(e.g. VERB VERB NOUN). I have got the book (v1 & v2) "Frequency analysis of
English vocabulary and grammar" by Johansson & Hofland but this only gives
left and right tag statistics for a given tag AND it details each of the
133 (??) LOB tags making it hard for me to gather the statistics into a
useful form for me.
Any help that you can give would be much appreciated.
Many thanks.
Russell
- -------------------------------------------------------------------
Russell J. Collingham
Artificial Intelligence Systems Research Group
Computer Science (SECS)
University of Durham email: R.J.Collingham@uk.ac.durham
Stockton Road phone: 091-374 2549 (2630 secretary)
Durham, England DH1 3LE fax: 091-374 3741
------------------------------
To: nl-kr@cs.rpi.edu
Date: Wed, 19 Feb 92 14:50 EST
From: pgs@research.att.com (Peter G. Selfridge)
Subject: AI & SE Workshop schedule
The following is a schedule for the Workshop on: Applying AI to
Software Problems: Assessing Promises and Pitfalls. This is part
of the IEEE Conference on AI for Applications (CAIA-92) being
held in Monterey, California the first week of March.
Approximately 30 people have expressed interest in this Workshop. It
will feature lots of discussion and interaction. Anyone interested
in attending should send me electronic mail.
Peter Selfridge
pgs@research.att.com
- ---------------------------cut here---------------------------
Workshop on
Applying Artificial Intelligence to Software Problems:
Assessing Promises and Pitfalls
March 3, 1992
Monterey, California
This workshop has four sessions, two in the morning and two in the afternoon.
The first session focuses on software problems and features one speaker. The
next two sessions focus on AI technology and feature two speakers in each
session. After each presentation, a Discussant will briefly comment on the
presentation and lead a subsequent open discussion. Issues raised during these
discussions can be noted and postponed for the final session. This final session
is an open discussion on research directions, using issues generated during the
previous sessions, questions distributed before the workshop, and various
relevant topics from position papers. After closing comments the remaining
participants can critique the workshop and discuss follow-up items. A small
reception is planned.
8:45 Welcome/Introduction, P. Selfridge
9:00 "Problems in Large Scale Software Development", Dewayne Perry, AT&T Bell
Laboratories
9:30: Discussant, P. Selfridge, AT&T Bell Laboratories
9:40 Open discussion on software problems, including generation of issues for
the final discussion on research directions; moderator, P. Selfridge
10:30 Mid-morning break
10:45 "Issues in Attaining Successful Software Development Tools", Martin
Feather, USC/ISI
11:05 Discussant, W. Mark, Lockheed Palo Alto Research Center
11:15 Open discussion: What is the state of AI tool technology for software and
what impedes further successful tool development and use?
11:30 "AI and Software: The Role of Reasoning and Learning", S. Bailin, CTA
Incorporated
11:50 Discussant, R. Keller, NASA Ames Research Center
12:00 Open discussion: Are their relatively immature AI techniques that have
applicability to software problems?
12:15 Lunch
1:30 "Commitment-Based Software Development", W. Mark, S. Tyler, J. McGuire, J.
Schlossberg, Lockheed Palo Alto Research Center
1:50 Discussant, Lewis Johnson, USC/ISI
2:00 Open discussion: Are their potential "success stories" of applying AI
technology to software problems and what can we learn from them?
2:15 "Component Description as an Integration Mechanism", K. Bellman and C.
Landauer, Aerospace Corporation
2:35 Discussant, L. Terveen, AT&T Bell Laboratories
2:45 Open discussion: How can AI technology contribute to portability and
integration of large software systems?
3:00 Break
3:30 Open discussion on research directions
5:00 Closing remarks, P. Selfridge, and critique of workshop by remaining
participants
6:30 Reception (planned)
------------------------------
To: nl-kr@cs.rpi.edu
Date: Tue, 11 Feb 92 14:30:31 EST
From: rapaport@cs.Buffalo.EDU (William J. Rapaport)
Subject: AAAI Spring Symposium on Propositional Knowledge Representation
CALL FOR PARTICIPATION
AAAI Spring Symposium Series 1992
Propositional Knowledge Representation
March 25-17, 1992
Stanford University, Stanford, CA
The key to propositional knowledge representation is that
propositions can be represented by terms in a formal representation
language, and hence properties of propositions and beliefs about
propositions can be represented. This facilitates the study of
representation and reasoning about beliefs, nested beliefs, and
other propositional attitudes such as desires, wants, hopes, and intentions.
Several knowledge representation formalisms based on the above
ideas have been designed, proposed, implemented, and applied to various
AI modeling tasks. Some examples include Sowa's conceptual graphs,
Shapiro's SNePS, Arbab's propositional surrogates, and Wilks's
ViewGen. Though the motivations for each of these may appear distinct,
they all have to address a common core of knowledge representation issues.
The goals of this symposium are to encourage a free exchange of ideas
among the various groups of researchers, to discuss their solutions to
common problems, to compare the theoretical and practical significance
of their approaches, and to explore the possibilities for closer
cooperation in the future.
Program Committee: Stuart C. Shapiro (chair) (shapiro@cs.buffalo.edu),
John Barnden (jbarnden@nmsu.edu),
Joao P. Martins (ist_1416@ptifm.bitnet),
John F. Sowa(sowa@watson.ibm.com)
Registration Deadline: February 14, 1992
Registration Information: sss@aaai.org
Program Inquiries: Deepak Kumar (kumard@cs.buffalo.edu)
LIST OF PRESENTATIONS
- --------------------
The following papers will be presented and made available to participants
only as part of working notes of the symposium:
A Formal Language for Representation of Knowledge
Bijan Arbab
What's needed in a framework for nested beliefs and other attitudes?
Afzal Ballim
Beliefs, Connectionism, Meta-Representation, Vagueness: Stirring the Pot
John A. Barnden
Exploiting Dependency Information in Nonmonotonic Logics
Gerhard Brewka
Using Hypothetical Reasoning as a Method for Belief Ascription
Hans Chalupsky
Representations of Collections in A Propositional Semantic Network
Sung-Hye Cho
SNePSwD: A Newcomer to the SNePS Family
Maria R. Cravo and Joao P. Martins
Propositional and Terminological Knowledge Representations
Daniela D'Aloisi and Cristiano Castelfranchi
Analysis of Semantic Networks using Graph Grammars
Gerard Ellis and Mark Willems
Representation for ViewGen: Structures and Reasoning
Roger T. Hartley, Heather D. Pfeiffer, Dihong Qiu
Functional Categorization of Knowledge
Sakir Kocabas
Deductive Efficiency + Belief Revision:
How they affect an ontology of actions and acting
Deepak Kumar and Stuart C. Shapiro
Representing Reified Relations in LOOM
Robert MacGregor
Propositionally Representing Incomplete Knowledge about Existence
Anthony S. Maida
SNePS_R: SNePS with Resources
Nuno J. Mamede
The STRICT Assumption: A Propositional Approach to Change
Carlos Pinto-Ferreira and Joao P. Martins
Belief Spaces: Sets of Sentences or Propositions?
Stuart C. Shapiro
Representing and Reasoning about Contexts
John F. Sowa
Designating Expressions and Cognition
Richard W. Wyatt
------------------------------
To: nl-kr@cs.rpi.edu
From: hdp@NMSU.Edu
Date: Thu, 20 Feb 92 08:12:33 MST
Subject: Seventh Annual Conceptual Graphs Workshop
*** CALL FOR PARTICIPATION ***
The Seventh Annual Workshop on
CONCEPTUAL GRAPHS
New Mexico State University
July 8th, 9th and 10th, 1992
The purpose of this workshop is to provide an active forum for
researchers and practitioners to exchange ideas about the theory and
application of conceptual graphs. Participants are expected to be
familiar with the basics of conceptual graph theory. The talks will
cover current work and results, problems, or any topic of interest to
active conceptual graph researchers. Subjects may include but are not
limited to:
Fundamentals
* Knowledge representation using conceptual graphs
* Operations on conceptual graphs
Natural Language
* Representation of semantics
* Representation of background knowledge
Automated Reasoning
* Modality and truth maintenance
* Reasoning in modal contexts
* Unified reasoning processes
Systems and Implementations
* How conceptual graphs are represented in programs
* Graph manipulation algorithms
* Abstract models or machines for conceptual graphs
Knowledge Engineering
* Methodologies for knowledge acquisition
* Learning conceptual graphs from examples
* Database design and interfaces
Applications of all Kinds
Five copies of the extended abstracts are due by March 4, 1992
at the address below. They should include name, address, phone number,
e-mail address, if any, and whether the preson is interested in presenting
or just attending. Please let us know if you are interested in attending
since we may have to place an upper limit on the workshop size.
For those interested in presenting, the extended abstracts should
be 3 to 4 pages in length, describing their proposed (20 - 30) minute
talk. Speakers will be notified of acceptance around the first of May,
1992.
One copy of a 10 to 15 page paper is due from each speaker by June
3rd, 1992. Some of the papers will be selected to be included in
a book.
Conceputal Graph Workshop Committee
c/o Heather D. Pfeiffer
Computing Research Laboratory
Box 30001/3CRL
New Mexico State University
Las Cruces, New Mexico 88003-0001
Phone: (505)646-5782
email: hdp@nmsu.edu
------------------------------
To: nl-kr@cs.rpi.edu
Date: Fri, 7 Feb 92 09:53:48 -0500
From: langconf@louis-xiv.bu.edu (BU Conference on Language Development)
Subject: CFP: BU Conference on Language Development
CALL FOR PAPERS
******************************************************************************
The 17th Annual
Boston University Conference on Language Development
October 23, 24 & 25, 1992 *
Featured Speakers: George Miller, Princeton University
Jean Aitchison, London School of Economics
Kenneth Hale, Massachusetts Institute of Technology
******************************************************************************
FIRST AND SECOND LANGUAGE ACQUISITION
All topics in the field of language acquisition will be fully considered,
including:
Bilingualism Literacy
Cognition & Language Narrative
Creolization Neurolinguistics
Discourse Pragmatics
Exceptional Language Pre-linguistic Development
Input & Interaction Signed Languages
Language Disorders Sociolinguistics
Lexicon Speech Perception & Production
Linguistic Theory (Syntax, Semantics, Phonology, Morphology)
REQUIREMENTS 1) Original Research that has never been presented or published
2) 450-word summary for anonymous review
3) 150-word abstract with title, topic, name(s) & affiliation(s)
(to appear in conference handbook)
SUBMIT 1) Six copies of an anonymous summary, clearly titled
2) Two copies of the abstract
3) One 3 x 5 card stating:
i) Title, ii) Topic area, iii) Audiovisual needs
And for each author:
a) Full Name c) Current address f) Summer address
b) Affiliation d) Current phone no. g) Summer phone no.
e) e-mail address h) Summer e-mail address
Presentations will be 25 minutes long, plus 10 minutes for questions.
DEADLINE: All submissions must be received by May 1, 1992*. Please include
self-addressed, stamped postcard for acknowledgment of receipt. Notification
of acceptance or rejection will be sent by June 30. Pre-registration materials
and preliminary schedule will be available in August 1992. Note: All
conference papers will be selected on the basis of abstracts submitted.
Unfortunately, we are unable to accommodate symposium proposals.
Boston University Telephone: (617) 353-3085
Conference on Language Development e-mail: langconf@louis-xiv.bu.edu
138 Mountfort Street
Boston, MA 02215 U.S.A.
NOTE: You can get seasonal information by sending a message to
info@louis-xiv.bu.edu, whereupon you will receive an automated reply.
The information distributed through this route is updated
periodically. Currently, the information contains the call for
papers. In early August, the preliminary program, preregistration
form, and hotel information will be available.
(If you have a question that you would like to address to a
human, please send it to langconf@louis-xiv.bu.edu.)
*Please note new dates and deadlines.
------------------------------
To: nl-kr@cs.rpi.edu
From: Robert Goldman <rpg@cs.tulane.edu>
Date: Mon, 10 Feb 92 09:34:22 CST
Subject: Charniak at Tulane University (past)
Reply-To: rpg@cs.tulane.edu (Robert Goldman)
[ Note this has past. - CW ]
Language Comprehension as Reasoning Under Uncertainty
Eugene Charniak
Department of Computer Science
Brown University
Friday, February 14th, 1992
2:00 P.M.
Room 117, Richardson Hall
Uptown Campus
Tulane University
Language comprehension is naturally viewed as a problem in abductive
inference i.e., reasoning from effects to causes: the words are the
effects, and, for simple declarative statements, the situation in the
world is the cause. Abductive inference is by its nature uncertain
inference. Since probability theory is the best understood calculus
for dealing with uncertainty, we have adopted a probabilistic model of
abduction, and thus of language understanding. We will describe a
program, Wimp3, which "understands" simple two or three line
``stories.'' Wimp3 models alternative choices in word-sense
ambiguity, pronoun reference, syntactic ambiguity, case resolution,
and plan recognition as different causal explanations of the sentence
as produced, and captures their interactions using a Bayesian Network
formalism (a graphic representation of probability distributions which
concisely captures independence relations). The idea is that the
correct choices will be those which the network assigns the highest
posterior probability given the ``evidence'' (the words of the story).
Sponsored by the LCCSE Intelligent Machines Research Cluster, Computer
Science Department (with help from Chevron Corporation), Linguistics
Program (Anthropology Department).
For more information or directions, phone the Computer Science
Department, (504) 865-5840, during business hours.
------------------------------
End of NL-KR Digest
*******************
