[Prev][Next][Index][Thread]

Sesquipedalian #14



the SESQUIPEDALIAN 				     Volume VII, No. 14
\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/
Independence Day (Leichtenstein)	               January 23, 1996


		   WHY PHYSICISTS DON'T WRITE RECIPE BOOKS

Chocolate Chip Cookies:

Ingredients:

 1.)   532.35 cm3 gluten
 2.)   4.9 cm3 NaHCO3
 3.)   4.9 cm3 refined halite
 4.)   236.6 cm3 partially hydrogenated tallow triglyceride 
 5.)   177.45 cm3 crystalline C12H22O11
 6.)   177.45 cm3 unrefined C12H22O11
 7.)   4.9 cm3 methyl ether of protocatechuic aldehyde
 8.)   Two calcium carbonate-encapsulated avian albumen-coated protein 
 9.)   473.2 cm3 theobroma cacao
10.)  236.6 cm3 de-encapsulated legume meats (sieve size #10) 

To a 2-L jacketed round reactor vessel (reactor #1) with an overall heat 
transfer coefficient of about 100 Btu/F-ft2-hr, add ingredients one, two 
and three with constant agitation.  In a second 2-L reactor vessel with a 
radial flow impeller operating at 100 rpm, add ingredients four, five, six, 
and seven until the mixture is homogenous.  To reactor #2, add ingredient 
eight, followed by three equal volumes of the homogenous mixture in reactor 
#1. Additionally, add ingredient nine and ten slowly, with constant 
agitation. Care must be taken at this point in the reaction to control any 
temperature rise that may be the result of an exothermic reaction.

Using a screw extrude attached to a #4 nodulizer, place the mixture 
piece-meal on a 316SS sheet (300 x 600 mm).  Heat in a 460K oven for a 
period of time that is in agreement with Frank & Johnston's first order 
rate expression (see JACOS, 21, 55), or until golden brown. Once the 
reaction is complete, place the sheet on a 25C heat-transfer table, 
allowing the product to come to equilibrium.

 	            -/-\-/ LINGUISTICS COLLOQUIUM /-\-/-

	      Stanford Linguistics Department Colloquium
		      Friday, January 24, 3:30pm
		 Margaret Jacks Hall (460), Room 146

			    David I Beaver
			University of Tilburg
	     A Century of Presupposition: Enough Already?

  ``For manifestly, if Socrates exists, one of the two propositions
  `Socrates is ill', `Socrates is not ill' is true, and the other
  false. This is likewise the case if he does not exist; for if he
  does not exist, to say that he is ill is false, and to say that he
  is not ill is true.'' (From Aristotle's _Categories_)

  ``That the name `Kepler' denotes something is just as much a
  presupposition for the assertion `Kepler died in misery' as for the
  contrary assertion.'' (From Frege's _On Sense and Meaning_)

Since Frege broke with Aristotelian tradition, a plethora of
approaches to dealing with the phenomenon of presupposition have been
proposed. 

The approaches discussed will (as time permits) appeal to scope
ambiguity (e.g. Russell), to Gricean argumentation (e.g. Atlas,
Gazdar, Kempson, van der Sandt and Wilson), to partiality and
trivalence (e.g. Bochvar, Burton-Roberts, Peters, Strawson,
Seuren and Link), to an extra presuppositional dimension of evaluation
(e.g. Herzberger and Karttunen and Peters), to a mechanism allowing
presuppositions to be canceled (e.g. Gazdar, Mercer and van der
Sandt), to sentence internal dynamics (e.g. Beaver, Karttunen,
Heim, van der Sandt, Zeevat), and to accommodation (e.g. in
theories of Beaver, Heim, van der Sandt, Fauconnier, Zeevat).

In this talk we will look at some themes which cross-cut this
bewildering array. The emphasis will be on developing syntheses of
ideas and theories found in the literature, and considering empirical
phenomena (e.g. anaphoricity of presuppositions, dependence on world
knowledge) which might yield a clear preference for one type of theory
over another.
------------------
Reception follows.
For directions and a complete list of colloquia, see
http://www-linguistics.stanford.edu/Linguistics/colloq/colloq.html

                      -/-\-/ SEMANTICS WORKSHOP /-\-/-

Thursday January 23, David Beaver will present a talk on
Presupposition projection in DRT in the semantics workshop. Time: 9-11
am. Location: MJH 146, that is the big seminar room in the linguistics
department. All are welcome!
------------------------------------------------------------------
Presupposition Projection in DRT
David I Beaver

A critical assessment will be made of recent proposals for solving the
'presupposition projection problem) (Langendoen & Savin) in
Kamp's (1981) DRT (hence PPiDRT), proposals beginning with van der
Sandt (1992), and including Kamp & Rossdeutscher (1995),
Rossdeutscher (1995), Saebo (1995), van der Sandt & Geurts (1994),
Geurts (1995, 1996), Bos et al (1995), Schielen (1995), Krahmer
(1995).  After outlining the DRT model and discussing the principle
respects in which it improves over other accounts of presupposition, a
large number of linguistic examples will be introduced and shown to be
problematic, and this will motivate significant modifications to
PPiDRT.

Positive traits of DRT proposals:
Soames (1982,1989) observed a systematic complementarity: Karttunen's
(1973,1974) (but cf. also Karttunen & Peters 1979) account
incorrectly predicts projection for many cases which Gazdar's (1979)
model gets right, and vice versa. PPiDRT accounts for examples
of both types, and in addition for: (a) presupposed open propositions,
c.f. Heim (1983)); (b) non-conditionalised presuppositions from local
contexts, (e.g. "If I fail my sister will succeed", presupposing that
I have a sister regardless of whether I fail); (c) anaphora from 
accommodated material, such as promotion of definites and names; (d)
the relationship between anaphora and presupposition, c.f. Kripke
(m.s.), Soames (1989). 

Eight types of problem data:

(i) Accommodation of unbound presuppositions in quantificational
contexts: "I don't know whether the Pope has measles. But every
protestant who ealises that the Pope has measles is
converting". Second sentence incorrectly predicted to mean that if the
pope has measles then protestants who realise it are converting.

(ii) Intermediate accommodation in quantificational restrictors. (By
intermediate accommodation is meant accommodation at a site
intermediate between the global DRS and the local DRS of the
trigger: "Every reader of this abstract who buys a car will sell
her cadillac". Incorrectly restricted to cadillac owning (female) 
readers independently of previous discourse context (c.f. the
discussion in Beaver (1994)).

(iii) Intermediate accommodation in conditional antecedents and
modals: "If a reader of this abstract buys a car she will sell
her cadillac". (c.f. (iv).)

(iv) Projection of entailed (unresolvable) presuppositions: 
"Either Mary's autobiography hasn't appeared yet, or else John must be
very proud that Mary has had a book published". PPiDRT incorrectly
predicts Mary has had a book published.

(v) Conditional presuppositions lacking where appropriate: "If
Spaceman Spiff lands on Planet X, he will be bothered by the fact that
he weighs 400 lbs". PPiDRT incorrectly predicts global conclusion
that Spiff weighs 400 lbs. Example will be argued to presuppose that
if Spiff lands on X he'll weigh 400 lbs, with further accommodation of
non-triggered material, e.g. Planet X is massive.

(vi) Over-resolution: "A farmer is sad. Jane realises that a farmer
has been injured". Second farmer is incorrectly resolved with first,
an oversimplification in van der Sandt's {\em partial match}.

(vii) Bridging: "If I go to a wedding, the Rabbi always gets drunk".  
Only `wide-scope Rabbi' reading available. 

(viii) Anaphoric presuppositions licence accommodation: "Jane is
happy and Fred ate some beans too". Example incorrectly predicted
felicitious with no additional context, and global accomodation of
someone having eaten beans. This runs contra to Kripke's observation
that the presupposition associated with 'too' (and other anaphoric
particles) is not existential. 

Conclusions:

Re. (i): van der Sandt's trapping constraint preventing unbinding via
accommodation needs a mirror principle (say ``release'') preventing
accommodation of presuppositions where they cannot be locally bound.

Re. (ii,iii): these types of data motivate accommodation being
restricted to the local and global DRSs. Such a major modification of 
PPiDRT might be weakened in various ways, (a) to allow intermediate
accommodation in the context of so-called 'partial match', (b) to
allow intermediate accommodation in belief contexts as motivated in
Zeevat (1992), (c) to allow intermediate accommodation but strengthen
the licencing conditions to require previous salience of the
accommodated material (c.f. Beaver (1995), von Fintel (1995)). 

Re. (iv,v): whilst examples like that in (iv) (c.f. also Partee's 
Bathroom sentences could be used to motivate a modification to the
DRT notion of accessibility, a wider conclusion to be drawn from (iv)
and (v) is that the condition licencing presuppositions is not just
the presence of a single anaphorically accessible antecedent, but also
involves some element of logical satisfaction of the presupposition in
its local context, as in the CCP model. This does not necessarily mean
abandonment of anaphoricity for satisfaction, particularly in the
light of the fact that CCP satisfaction is not the classical static
notion, but takes into account the flow of anaphoric information. In
fact it will be argued that there is motivation (c.f. Zeevat (1992))
for a hybrid model in which some triggers require an anaphoric
antecedent, whilst others require local satisfaction. 

Re. (v,vi,vii): some authors (Kamp and Rossdeutscher, and Bos et al)
have stressed the need for PPiDRT models to incorporate common sense
reasoning in some way, and these three classes of data all underline
the necessity of this. I will s suggest a modification to van der
Sandt's partial match such that local resolution of A to B
requires the presence of a global default (which may itself be
accommodated) linking A-type objects to B-type objects. If the link is
restricted to be an identity relation, this will simply constrain
overgeneration of the partial match. But it will also be argued that
it would be natural to relax the constraints on the link relation as a
means to extend coverage of PPiDRT to include bridging. A complete
treatment of conditional presuppositions (c.f. (v)), as argued in
Beaver (1995), would require a more significant overhaul of the PPiDRT
model, with defaults acting to licence or prevent accommodation of 
all kinds.

Re. (viii): it is ironic that a model which sets itself up as offering
an anaphoric account of presupposition, fails to account for one of
the central observations linking presupposition to anaphora, the
infelicity of certain triggers when they do not have a linguistically
realised antecedent. It will be suggested that van der Sandt's
constraint on pronouns triggering accommodation (due to ``lack of
descriptive material'') be replaced with an extended familiarity
constraint (essentially forbidding renaming of variables in the
accommodation process), and this will be shown to have consequences
both for pronouns and for a range of presupposition triggers. 

The modified model will be presented in terms of the reformulation of
van der Sandt's theory in Beaver (1995). Finally, having presented the
modified PPiDRT model, it will be argued that many of the conclusions
reached, principally those which concern the nature of accommodation,
are of sufficient generality to apply  beyond DRT, e.g. to
Fauconnier's 'Mental Spaces' account (1985) and to the CCP model
originating with Heim's (1983) development of earlier work of
Karttunen and Stalnaker.

Abbreviated Bibliography

Beaver, D., 1994. ``When Variables Don't Vary Enough'', in Harvey,
	M. & L.Santelmann (eds.), SALT 4, Cornell. 
Beaver, D., 1994. ``Accommodating Topics'',  in R. van der Sandt and
	P. Bosch (eds.).
Beaver, D., 1995. Presupposition and Assertion in Dyn. Sem., PhD Diss.,
	U.Edinburgh. To appear:  CSLI, Stanford.
Bos, J., P. Buitelaar and A. Mineur, 1995. ``Bridging as Coercive
	Accommodation'', in E. Klein et al (eds.).
Fauconnier, G., 1985. Mental Spaces: Aspects of Meaning Construction
	in Natural Language, MIT Press.
Fintel, K. von, 1995. Restrictions on Quantifier Domains, PhD Diss.,
	U.Mass.
Gazdar, G., 1979. Pragmatics: Implicature, Presupposition and
	Logical Form, Academic Press.
Geurts, B., 1994. Presupposing, PhD Diss., U. Osnabrueck.
Kamp, H., 1981. ``A Theory of Truth..'', in  J. Groenendijk et al (eds.),
	1984, Truth, Interpretation, .., Foris.
Kamp H. and A. Rossdeutscher, 1994. ``DRS-Construction
	and Lexically Driven Inference'', TL 20, pp. 165--235
Karttunen, L., 1973. ``Presuppositions of Compound Sentences'', LI 4,
	pp.167--193.
Karttunen, L., 1974. ``Presuppositions and Linguistic Context'',
	TL 1, pp. 181--194.
Karttunen, L., and S. Peters, 1979. ``Conventional Implicatures in
	MG'', in Oh and Dineen (eds.), 1979. 
Krahmer, E., 1995. Discourse and Presupposition}, PhD Diss., U.Tilburg 
Kripke, S., ms. Presupposition and Anaphora: Remarks on the 
	Formulation of the Projection Problem, U.Princeton
Heim, I., 1983. ``On the Projection Problem for Presuppositions'',
	WCCFL 2, pp. 114--126.
Langendoen, D. and Savin, H., 1971. ``The Projection Problem for
	Presupps.'', in Fillmore & Langendoen (eds.). 
Rossdeutscher, A., 1994. ``Fat Child..'', TL 20, pp.237--305.
Saebo, K., 1995. ``Anaphoric Presuppositions, Accommodation, and
	Zero  Anaphora'', L & P 16.
Sandt, R. van der, 1992. ``Presupposition Projection as
	Anaphora Resolution'', JoS 9, pp. 333--377.
Sandt, R. van der, and B. Geurts, 1991. ``Presupposition, Anaphora
	..'', in Herzog & Rollinger (eds.).
Schielen, M., 1995. ``Integrating .. Presupposition
	in DRT'', in Beaver, D. (ed.), Dyana Del. R3.7., U. Amsterdam.
Zeevat, H., 1992. ``Presupposition and Accommodation in US'', 
	JoS 9, pp. 379--412. 

                     -/-\-/ SOCIOLINGUISTICS RAP /-\-/-

			    Monday, February 3 
				4:00 PM
			146 Margaret Jacks Hall

John Rickford will speak on:
Ebonics in Oakland; Linguistics in Education

As many of you know, John has been closely involved in the activity
surrounding the Oakland School Board's resolution regarding Ebonics. This
Socio Rap offers a unique opportunity to get a close-up view of issues and
events related to this very controversial situation.

                        -/-\-/ CALL FOR PAPERS /-\-/-

-- ESSLLI97: PhD Workshop on Natural Language Generation.  A workshop
held as part of the 9th European Summer School in Logic, Language and
Information (ESSLLI97), August 11-22, 1997, Aix-en-Provence, France.
http://www.mri.mq.edu.au/conf/esslli-nlg/
WORKSHOP THEME: Natural Language Generation.  Natural Language
Generation (NLG) is coming of age: historically, natural language
analysis has received substantially more attention from computational
linguists and those working in natural language processing, but recent
years have seen the development of a robust NLG community, with an
international NLG workshop being organised every two years, and a
European workshop in the alternate years; and many new research
projects in NLP and CL include work on natural language generation.
As a consequence, there are now a significant number of researchers
working in the field, both in Europe and internationally.  One effect
of this growing interest is that there is considerable competition for
limited space in the fora available for students undertaking their
PhDs to report on their progress and results, and discuss their work
with colleagues and more senior researchers.  The purpose of this
workshop is to provide a forum for students undertaking PhD research
in NLG to present their results.  This workshops aims to:
    * provide a setting for PhD Students to present and discuss
      their work, in a small, friendly and constructive environment; 
    * provide guidance for future research directions; 
    * develop spirit of collaborative research.
CALL FOR PAPERS: We invite PhD students to submit a description of
their thesis topic, approach and results.  Papers should be 5--8 pages
long.  Authors are also welcome to submit a list of topics they would
like to see discussed.  This will be used by the organisers to
identify issues for discussions and debates.  Finally, PhD students
are invited to provide additional information about their background
and relevant experience.  DEADLINE: Papers for submission shold be
received by April 30th 1997.  They should be sent to
	Dr Cecile Paris
        CSIRO Mathematical and Information Sciences
        Locked Bag 17, North Ryde, NSW 2113  
        Australia
Use the above address for paper submission. Electronic submission is
also acceptable:  send your submission, in PostScript form, to 
       cecile.paris@cmis.csiro.au     
If you are submitting electronically, please do this by April 28th, so
that we can ensure that your submission is printable before the
deadline. 

                      -\-/-\ TRUE LINGUISTICS \-/-\-

-- THE IMPORTANCE OF PUNCTUATION AND ENCYCLOPEDIAS: Alert linguist,
Geoff Nunberg, had this to say about last week's installment of True
Linguistics:

'Dictionaries don't usually tell you what animals eat, so I looked it up in
Britannica. Hence some changes are called for:

A panda walks into an Old West saloon and growls "GIMME SOME FOOD!"  After
wolfing down (panda-ing down?) the food, he draws a six-shooter, fires a
bullet at the piano player, and starts wildly cheering: "Gimme a P. Gimme
an A, Gimme an N...." The bartender hollers "Hey! You just killed my piano
player, and you haven't paid me for the food!" The panda replies "Idiot!
I'm a *panda*!  LOOK IT UP!"  And away he goes.
        The bartender looks up "panda" in the encyclopedia and finds:
"Large black-and-white mammal of Western China.  Eats shoots roots and
leaves."'

[Thanks, Geoff.  Uh, it wasn't bad enough for you before?]

                     -\-/-\ JOB ANNOUNCEMENTS \-/-\-

(REDUNDANCY NOTICE: For fuller listings of these and other jobs, don't
forget to check the Jobs binder in the Greenberg Room, and the file
'jobslist.txt' on the CSLI directory /user/linguistics.)

-- TILBURG UNIVERSITY: Vacancy for a PhD Researcher (from April 1
1997) on the project: MACHINE LEARNING AS A METHOD IN LANGUAGE
ANALYSIS.  A grant of the Netherlands Organisation for Scientific
research (NWO) is available for this vacancy (about 27,500 Dutch
guilders per year, for four years). When succeeding in concluding the
research with a PhD within the alotted 4 years, a 2 year temporary
postdoc position is subsequently offered.  About the project: The
availability of large language corpora combined with large computing
power has opened up exciting new possibilities for computer-aided
linguistic analysis.  In the ILK (Induction of Language Knowledge)
project of Tilburg University we investigate how inductive learning
algorithms, developed in machine learning (a sub-discipline of
artificial intelligence) and statistical pattern recognition can be of
use in linguistic analysis, language technology, and cognitive
modeling.  We are looking for someone with a background in
(Computational) Linguistics or Artificial Intelligence (Machine
Learning) who is willing to research applications of Machine Learning
in Linguistics and prepare a PhD on this topic.  For more information
about this vacancy: Walter Daelemans (mailto:walter@kub.nl, +31 13
4663070).  About financial aspects: Marleen van de Wiel
(mailto:M.M.vdWiel@kub.nl, +31 13 4663357).  
Send your application with curriculum vitae, short description of
research interests, and example of recent research (e.g. master's
thesis) before February 15, 1997 to
	Walter Daelemans
	Tilburg University
	Computational Linguistics
	PO BOX 90153
	5000 LE TILBURG
	The Netherlands

-- Nationally renowned developer and manufacturer of hand-held
electronic books and dictionaries, is currently looking to hire
several Linguists.  Positions located in Phila-area.
(1) Entry-Level:
Title:  Editorial Linguist
Provide linguistic and language support services to Senior Linguists
and other data compression/conversion and product development staff in
the Research and Development Department.  Required: BA or BS in
Linguistics, English or a foreign language; native or near-native
ability to read, write, speak in both English and one other language,
and a thorough knowledge of grammar in both languages required; basic
computer literacy.
Salary: To 40K
(2) Working-Level:
Title:  Editorial Linguist II
Required: same as above, with one year of professional working
experience in linguistics, translation, or related field required plus
significant computer literacy in areas of linguistic importance.
Salary: To 50K
(3) Working-Level:
Title:  Editorial Linguist III
Required:  same as above, with MA degree.
Salary:  To 55K
(4) Senior Linguist: Senior technical professional position engaging
in linguistic and lexicographic data compression/conversion and
product development in the R&D Department.  Supervise and train others
in highly complex project tasks; develop and maintain linguistic
databases; participate in software code review meetings; create UNIX
command scripts and programs employing high-level programming
languages to accomplish complex linguistic tasks.  Required: MA degree
in linguistics, language - Ph.D preferred; five years professional
working experience in linguistics, translation or related field;
Near-native ability with one other language.
Please call Donata Davenport at 610-825-3850 and fax resume to
610-828-1095.  mailto:donata@texcelinc.com

-- Linguist-Programmer wanted immediately for a full-time one-year
position comprising two activities: (1) to assist in the development
of a FoxPro multimedia dictionary database program on a PC platform
(and later moving it to a Mac platform) designed for several American
Indian languages; (2) to take responsibility for constructing four
small dictionaries in that program.  For programming work, the person
will work under the supervision of the current programmer who is
designing the program.  For dictionary development the person will
work with several other linguists.  Pay commensurate with experience.
Minimum qualifications: a degree or some course work in linguistics;
working command of FoxPro 2.0 at least, experience with Visual FoxPro
3 preferred.  Contact at the following addresses:
	Wallace Hooper
	American Indian Studies Research Institute
	422 N. Indiana Avenue
	Indiana University
	Bloomington, IN 47405
	mailto:whooper@indiana.edu
	phone: (812) 855-4123

-- Computational linguistics job in the WebCompass group at
Quarterdeck Corporation in Marina Del Rey, CA (greater Los Angeles),
USA.  WebCompass is an award-winning information retrieval agent
product for the PC market.  Functionality includes noun phrase
extraction, automatic summarization, topic classification, and
document clustering.  We are looking for a computational linguist to
design and implement linguistic techniques for innovative information
retrieval products.  Job description: Design and implement
computational applications of linguistic theory for information
retrieval and management applications, including WebCompass.  Major
duties involve extending and maintaining tools for tokenizing,
contextual part of speech tagging, noun phrase extraction, language
identification, (multilingual) automatic summarization, logical form
analysis, question-answering.  Projected needs may include
multilingual noun phrase extraction, automatic anaphora resolution,
discourse analysis, proper name classification.  Good development
skills in C++ and/or Java necessary.  Familiarity with
Government-Binding theory helpful.  Masters or doctorate level
education in linguistics or computational linguistics preferred.  If
you are interested, email a CV to Brian Ulicny.
mailto:ulicny@qdeck.com

-- Cap Volmac Document Engineering Technology in Utrecht, The
Netherlands is seeking computational linguists for TEMPORARY positions
in a development project. For one of our customers, we are building a
machine translation system based on controlled language (English)
input for software documentation.  For the finalisation of the
translation modules to FRENCH, GERMAN, and SPANISH, we are seeking
computational linguists who are (near) native in one of these
languages and have a good command of English.  Primary activities are
writing grammar rules and encoding lexical entries.  These positions
are for a period of 3 to 6 months starting January 1997.  Applicants
should: be near native speakers of the target language involved, have
experience in writing grammars in PROLOG-like formalisms, have good
computer skills (Ms-Office products), be available immediately, enjoy
working in a team, and be able to perform under stress.  Cap Volmac is
a software house that provides IT services and consultancy, with 4400
employees in the Benelux countries. It is part of the Cap Gemini
group.  Document Engineering Technology is part of the Advanced
Technology Services division of Cap Volmac.  Please contact
	Marc van Gestel, manager
	tel. 030 - 252 7044
	mailto:MGestel@inetgate.CapVolmac.nl
	
	Jacqueline van Wees, linguist
	tel. 030 - 252 7127
	mailto:Jwees@inetgate.CapVolmac.nl
PO box 2575
3500 GN Utrecht

-- VOCABULARY ENGINEER: The Data department at Kurzweil AI is
responsible for speech recognition vocabularies for our Windows and
Medical speech products. We are seeking a candidate for a position in
vocabulary generation and production. The position involves producing
and maintaining quality UNIX based scripts and C programs for data
manipulation. The successful candidate will have a strong background
in UNIX scripting, scientific data processing or related fields.  A
demonstrated ability for accuracy and detail is essential.
Other responsibilities include: tool building in C, csh,awk and Perl;
Planning and designing new tools as well as productizing existing
tools for end users; Error checking and vocabulary Quality Assurance;
Support for vocabulary production staff.  
Qualifications:
	1-2 years experience working in PC and UNIX environments.
	Strong knowledge of UNIX scripts and scripting tools (csh, awk, sed...)
	(Perl a plus!)
	Demonstrated ability to do detailed work.
	BS/BA in Computer Science, Linguistics, Physical Sciences
        or related subject.
Please e-mail resumes (mailto:amyu@kurzweil.com).

(REDUNDANCY NOTICE: For fuller listings of these and other jobs, don't
forget to check the Jobs binder in the Greenberg Room, and the file
jobslist.txt' on the CSLI directory /user/linguistics.)

                        -\-/-\ INSTA-PRIZE \-/-\-

ANY COLOR YOU LIKE: The island of Chernikarichnevicinii is inhabited
by 13 blue, 15 brown, and 17 black chameleons.  If two chameleons (who
are very gregarious animals) of different colors meet, they
simultaneously change to the third color, for example if a blue and
brown chameleon meet, they both turn black.  Is it possible that all
of the chameleons will ever be the same color?

First correct answer by e-mail wins this week's insta-prize (don't
forget to show your work!!)


/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\

                    -\-/-\ CONSERVE DISK SPACE \-/-\-

So you may delete your copy after you've read it (or better yet,
before you've read it), the Sesquipedalian Weekly Herald is stored
online at Stanford (in directory /user/linguistics/Sesquip/), and at
Berkeley (in the directory /usr/pub.), or on the Linguistics
Department home page (http://www-linguistics.stanford.edu/).  The most
current issue of the Herald can be found by typing 'help quip'.

Neither Stanford University nor the Linguistics Department, nor any of
their employees, makes any warranty, whatsoever, implied, or assumes
any legal liability or responsibility regarding any information,
disclosed, in this publication, or represents that its use would not
infringe privately owned rights.  No specific reference constitutes or
implies endorsement, recommendation, or favoring by Stanford
University or the Linguistics Department, or their employees.  Any
similarity to actual linguists, living or dead, is purely
coincidental.  The views and opinions expressed herein do not
necessarily reflect those of Stanford University or the Linguistics
Department, or their employees, and shall not be used for advertising
or product endorsement purposes.  It is a violation of federal law to
use this product in a manner inconsistent with its labelling.

All rights revoked

\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/-\-/