Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!floyd!vax135!cornell!uw-beaver!tektronix!hplabs!sri-unix!WELD%MIT-OZ@MIT-MC.ARPA
From: WELD%MIT-OZ@MIT-MC.ARPA
Newsgroups: net.ai
Subject: Computational Linguistics (BOSTON)
Message-ID: <216@sri-arpa.UUCP>
Date: Mon, 19-Mar-84 15:26:00 EST
Article-I.D.: sri-arpa.216
Posted: Mon Mar 19 15:26:00 1984
Date-Received: Sun, 25-Mar-84 19:22:16 EST
Lines: 25

From:  "Daniel S. Weld" <WELD%MIT-OZ@MIT-MC.ARPA>

           [Forwarded from the MIT bboard by SASW@MIT-MC.]

Wednesday, March 21     4:00pm      8th floor playroom

De-mystifying Modern Grammatical Theory and Artificial Intelligence
Robert Berwick

It has frequently been suggested that modern linguistic theory is
irreconcilably at odds with a ``computational'' view of human
linguistic abilities.  In fact, linguistic theory provides a rich
source of constraints for the computationalist.  In this talk I will
outline some of the key changes in grammatical theory from the mid 60's to
the present day that support this claim, and at the same time try to
dispel a number of myths:

Myth: Modern grammars are made up of large numbers of rules that
one cannot ``implement.''

Myth: Modern grammars are not relevant to computational models
of language processing.

Myth: Knowledge that you can order hamburgers in restaurants
aids *on-line* syntactic processing.