Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 09 No. 08
NL-KR Digest (Thu Feb 27 09:46:35 1992) Volume 9 No. 8
Today's Topics:
Query: looking for cf grammar
Query: Corpora in Teaching
Announcement: English lexicon available
Talk: Howe on "Failure Recovery in the Design of Planners" (UMBC)
CFP: Israeli Conference on AI and Vision
CFP: ECAI'92-Workshop on Linguistic Ambiguity...
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
From: Matt Hurst <mfh@dcs.ed.ac.uk>
Newsgroups: comp.ai.nlang-know-rep
Subject: looking for cf grammar
Date: 22 Feb 92 11:33:06 GMT
Reply-To: Matt Hurst <mfh@dcs.ed.ac.uk>
I am looking for a large context free grammar with which to test
a parallel parsing algorithm for my final year project. Does
anyone have anything on line?
Thanks
Matthew Hurst AI/CS4 Edinburgh University
------------------------------
To: nl-kr@cs.rpi.edu
Newsgroups: comp.ai.nlang-know-rep
From: sdf@comp.lancs.ac.uk (Steve Fligelstone)
Subject: Corpora in Teaching
Date: Tue, 25 Feb 1992 12:53:29 GMT
We would like to undertake a preliminary survey of the way in which Machine
Readable Language Corpora are currently being used in teaching, especially,
but not exclusively, in higher education, whether at undergraduate or
postgraduate level, whether as part of Linguistics courses or in some other
context.
We would be as interested in hearing about courses where corpora form a
central focus (courses in corpus linguistics for example!), as in courses
where they are a more 'invisible' resource, e.g. underlying instruction in
language use or grammatical studies. We are likewise interested in any
practical instruction offered in corpus access of various kinds - including
details of software (whether in-house or proprietary) and the kinds of computing
support required by these activities. The main criterion for inclusion is
that the activity can be seen as lying within the domain of 'teaching',
rather than as a strictly research activity.
A short response only is sought at this stage, but in addition to a brief
descripton of the genral aims and methods of the course, we would be grateful
for details about a) length of time course (or similar course) has been running
b) level and experience of students c) failed initiatives in this field as well
as successful ones.
Depending on the response we may choose to progress to a more thorough and
detailed survey. Either way we would hope to publish some results and anlysis
of the enquiry and to summarise some of the findings here. Please write to:
Steven Fligelstone and Tony Mcenery
Unit for Computer Research on the English Language
Linguistics Department
Bowland College
Lancaster University LA1 4AD
email: eia002@uk.ac.lancs.lancaster
------------------------------
To: nl-kr@cs.rpi.edu
From: txsil!evan@utafll.uta.edu (Evan Antworth)
X-Mailer: SCO System V Mail (version 3.2)
Subject: English lexicon available
Date: Tue, 25 Feb 92 10:11:55 CST
Englex is a morphological parsing lexicon of English intended for use with
PC-KIMMO and/or KTEXT. It's 20,000 entries consist of affixes, roots, and
indivisible stems. Both inflectional and derivational morphology are
analyzed. Englex will run under Unix, Macintosh, or MS-DOS (the files are
plain ascii and are identical for all three versions). Because of memory
requirements, to run Englex under MS-DOS you will need a 386 cpu and
the new 386 versions of PC-KIMMO and KTEXT. These 386 versions will use all
available extended/expanded memory and virtual memory. They support
VCPI-compliant memory managers such as DOS 5.0's EMM386 and Quarterdeck's
QEMM. They do not support (or need) Windows.
All of this software can by downloaded by anonymous FTP from the Consortium
for Lexical Research at clr.nmsu.edu [128.123.1.11]. Send e-mail inquiries
to lexical@nmsu.edu. (For a listing of their holdings, get the file
catalog-short in the top directory.) Here are the subdirectories and
file names:
Directory: pub/tools/ling-analysis/englex_pckimmo
englex10.zip Zipped MS-DOS file of englex10
englex10.tar.Z Compressed UNIX tar file of englex10
englex10.hqx Stuffed, binhexed Mac file of englex10
Directory: pub/tools/ling-analysis/morphology/pc-kimmo
pckim108.zip Zipped MS-DOS file of pc-kimmo108 (inc. 386 version)
pckim108.tar.Z Compressed UNIX tar file of pc-kimmo108 sources
pckimmo108.hqx Stuffed, binhexed Mac file of pc-kimmo108
Directory: pub/tools/ling-analysis/morphology/ktext
ktext103.zip Zipped MS-DOS fiel of ktext103 (inc. 386 version
ktext103.tar.Z Compressed UNIX tar file of ktext103 sources
ktext103.hqx Stuffed, binhexed Mac file of ktext103
Englex, PC-KIMMO, and KTEXT are offered as 'freeware' to the academic
community; your feedback is welcomed.
Evan Antworth | Internet: evan@sil.org
Academic Computing Department | UUCP: ...!uunet!convex!txsil!evan
Summer Institute of Linguistics | phone: 214/709-2418
7500 W. Camp Wisdom Road | fax: 214/709-3387
Dallas, TX 75236 |
U.S.A. |
------------------------------
To: nl-kr@cs.rpi.edu
Date: Fri, 21 Feb 92 11:38:37 EST
From: finin@algol.cs.umbc.edu (Timothy Finin)
Subject: UMBC talk: Howe on "Failure Recovery in the Design of Planners"
Reply-To: finin@cs.umbc.edu
Address: Comp. Sci., UMBC, Baltimore MD 21228. 301-455-3522, fax: -3969
COLLOQUIUM -- COLLOQUIUM
Computer Science Department
University of Maryland, Baltimore County
Accepting the Inevitable:
The Role of Failure Recovery in the Design of Planners
Adele Howe
Computer and Information Science
University of Massachusettes at Amherst
howe@cs.umass.edu
Failures are inevitable for many types of computer systems. Designers
who seek to limit the frequency and impact of failures can adopt two
basic approaches: automated failure recovery and debugging failures. In
this talk, I will describe how automated failure recovery can both
repair failures and expedite debugging of an autonomous planner, the
Phoenix planner, in a dynamic environment.
The automated failure recovery component applies general methods to
recover from failures detected by the Phoenix planner. The design of the
failure recovery component is based on an expected cost model of failure
recovery. The model directs evaluation of the failure recovery
component, the design of a control strategy for best selecting recovery
methods, and the redesign of the recovery method set.
Failure recovery analysis is a procedure for analyzing execution traces
of failure recovery to discover how the planner's actions might be
causing failures. The procedure involves statistically analyzing
execution traces for dependencies between actions and failures, mapping
those dependencies to plan structures, and explaining how the structures
might produce the observed dependencies.
This research shows how failure recovery can help a planner accommodate
both unexpected events and plan bugs, how failures depend on the planner's
actions and how to track and evaluate design changes over time.
Wednesday, March 11, 1:00 PM
Computer Science Department
Room 102 Temporary Facility 1
UMBC, Baltimore MD
For additional information, contact Angie Silanskis, 410-455-3000.
------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 20 Feb 92 16:41:05 est
From: ehud%BENGUS.bitnet@TAUNIVM.TAU.AC.IL
Subject: CFP: Israeli Conference on AI and Vision
The following is a Tex Call for Papers for the 9th Israel AI and
Vision conference. Papers are due June 15th. Conference is on
Dec 28-29, 1992. Sincerely, Ehud Gudes.
\documentstyle[12pt]{article}
\textheight 9in
\textwidth 6.5in
\oddsidemargin 0pt
\evensidemargin 0pt
\pagestyle{empty}
\begin{document}
\centerline{{\sf\Large IAAI \hfill IACVPR}}
\bigskip
\centerline{\bf\Large Call For Papers}
\bigskip
{\bf
\begin{center}
9th Israeli Conference on\\ \ \\
Artificial Intelligence and Computer Vision\\ \ \\
Tel-Aviv, December 28-29, 1992\\
\end{center}
}
\bigskip
The conference is the joint annual meeting of the Israeli Association for
Artificial Intelligence, and the Israeli Association for Computer Vision
and Pattern Recognition, which are affiliates of the Israeli Information
Processing Association.
Papers addressing all aspects of AI and Computer Vision, including, but
not limited to, the following topics, are solicited:
\begin{itemize}
\itemsep=\skip2
\item
Image Processing and Pattern Recognition, Image Analysis
\item
Computer Vision, Applications, Robotics
\item
Visual Perception, Cognitive Modeling
\item
Natural Language Processing
\item
Inductive Inference, Automated Reasoning, Planning and Search
\item
Knowledge Acquisition, Knowledge Theory, Logics of Knowledge
\item
AI and Education, AI Languages and Methodology
\item
Expert Systems and Applications of Artificial Intelligence
\end{itemize}
\noindent
Submitted papers will be refereed by the program committee (to be
announced shortly). Authors should submit 4 copies of the full paper.
Accepted papers will appear in the conference proceedings.
Papers should be received by the conference co-chairmen at one of the
following addresses by June 15th, 1992. Authors will be notified of
acceptance by September 1st 1992.
\begin{center}
\begin{tabular}{ll}
{\sc Vision:} & {\sc AI:} \\
Dr.\ Shimon Edelman & Dr.\ Ehud Gudes \\
9th IAICV & 9th IAICV \\
Dept.\ of Appl.\ Math.\ \& Computer Science & Dept.\ of Math.\ \& Computer Scien
ce \\
The Weizmann Institute of Science & Ben Gurion University \\
Rehovot 76100, Israel & Beer Sheva 84105, Israel \\
{\sf edelman@wisdom.weizmann.ac.il} & {\sf ehud@bengus.bitnet} \\
\end{tabular}
\end{center}
\end{document}
------------------------------
To: nl-kr@cs.rpi.edu
Date: Mon, 24 Feb 1992 10:36:18 +0100
From: Harald Trost <harald@ai.univie.ac.at>
Newsgroups: comp.ai,comp.ai.nlang-know-rep
Subject: CFP: ECAI'92-Workshop on Linguistic Ambiguity...
Keywords: NLU, Unification, Feature Formalisms
Organization: Dept. Med.Cybernetics & Artif.Intelligence, Univ.Vienna, Austria, Europe
CALL FOR PARTICIPATION
==============================================================
Coping with Linguistic Ambiguity in Typed Feature Formalisms
==============================================================
A workshop at the
Tenth European Conference on Artificial Intelligence (ECAI)
Monday, Aug 3, 1992
Vienna, Austria
Organizing Committee:
Harald Trost (main organizer) Rolf Backofen
Austrian Research Institute for AI, DFKI GmbH
Schottengasse 3, Stuhlsatzenhausweg 3,
A-1010,Vienna, Austria D-66 Saarbruecken, Germany
e-mail: harald@ai.univie.ac.at backofen@dfki.uni-sb.de
Tel.: +43-222-53532810 +49-681-302-5298
Fax: +43-222-630652 +49-681-302-5341
International Program Committee:
Jochen Doerre, University of Stuttgart, Germany
Martin Emele, University of Stuttgart, Germany
Kiyoshi Kogure, ATR, Kyoto, Japan
Johannes Matiasek, ARIAI, Vienna, Austria
Mark Rosner, IDSIA, Geneve, Switzerland
Nino Varile, CEC, Luxemburg
Juergen Wedekind, University of Stuttgart, Germany
Motivation and Scope of the Workshop:
Typed feature structures are the most common representation for
linguistic data in NLP. They have a wide range of applications
from syntax and semantics to morphology and even phonology. A
number of typed feature formalisms have been developed and
implemented.
Recently, interest has focussed on the treatment of ambiguity.
The adequate representation of linguistic data requires the
inclusion of some sort of disjunction into the formalism because
(local) indeterminism is pervasive on all linguistic levels. But
integrating disjunction has dire consequences for performance.
This was proved theoretically by complexity results and--more
painfully--by slowing down dramatically the average performance
of implemented systems.
Accordingly, research in typed feature formalisms has focussed
on more efficient ways to cope with ambiguity. Success or
failure may well decide whether the current feature unification
paradigm exemplified by a number of grammar formalisms (e.g.,
Categorial Unification Grammar, FUG, GPSG, HPSG, LFG) will
prevail and produce viable and efficient systems for realistic
applications.
The goal of the workshop is to further deepen our understanding
of the problem, to discuss fresh and innovative ideas, and in
general, to take another step in the direction of a unified
research framework for this area.
Possible Contributions:
The workshop topics will include the following:
- Efficient algorithms for the processing of disjunctive feature
structures
- Representing disjunction in type systems
- Explicit control for disjunction in feature structures
- Restrictions on the representation of linguistic data to
increase system performance
Submissions:
Position papers or research summaries on one of the above or
related topics, not exceeding 7 (A4) pages, should be sent to
the main organizer. All submissions must be received by
April 21, 1992.
Submissions by email (in Latex) or fax are acceptable. Papers
will be reviewed by the international programme committee.
Authors will be notified about acceptance or rejection by
May 22, 1992. Please inlcude email address and/or fax number for
easier notification. Final papers will be due on June 15, 1992.
An informal proceedings volume containing accepted papers will
be distributed to participants at the beginning of the workshop.
Important Dates:
SUBMISSION DEADLINE ..............................April 21, 1992
Notification of acceptance ........................May 22, 1992
Final version of paper due ...................... June 15, 1992
Date of the workshop ............................ August 3, 1992
This workshop will be part of the Tenth European Conference on
Artificial Intelligence (ECAI '92) taking place at the Vienna
University of Economics from Aug 3-7, 1992. Attendance will be
by invitation only, mainly on the basis of submitted papers. All
attendees must be registered participants of ECAI '92.
***************************************************************************
Harald Trost
harald@ai.univie.ac.at
------------------------------
End of NL-KR Digest
*******************
