Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 beta 3/9/83; site utai.UUCP
Path: utzoo!utcsrgv!utai!gh
From: gh@utai.UUCP (Graeme Hirst)
Newsgroups: ont.events
Subject: A.I. seminar (natural language), University of Toronto
Message-ID: <216@utai.UUCP>
Date: Thu, 6-Sep-84 16:19:51 EDT
Article-I.D.: utai.216
Posted: Thu Sep  6 16:19:51 1984
Date-Received: Thu, 6-Sep-84 23:22:07 EDT
Organization: CSRI, University of Toronto
Lines: 25

	  Conjunctions in natural language understanding

			    Vicky Snarr
		  Department of Computer Science
		      University of Toronto


	 Tuesday, 11 September, 3pm, Sandford Fleming Bldg 1105

Although the conjunction "and" appears to have a simple function in the
English language, it has proved to be a stumbling block for both theoretical
and computational linguists.

One of the theoretical problems of conjunction is to determine what governs the
acceptability of a structure in which two elements are connected by "and".
The corresponding computational problem is, given this knowledge, to
incorporate it into an efficient parser for English.

I propose a solution to the theoretical problem which is in the form of two
general constraints -- a syntactic constraint and a semantic one; and then
show how these constraints were incorporated into a ``strictly deterministic''
parser for English.
-- 
\\\\   Graeme Hirst    University of Toronto	Computer Science Department
////   utcsrgv!utai!gh	/  gh.toronto@csnet-relay  /  416-978-8747