Newsgroups: comp.ai.nat-lang
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!news.duke.edu!news.mathworks.com!newsfeed.internetmci.com!usenet.eel.ufl.edu!warwick!bham!sunserver1.aston.ac.uk!usenet
From: rupraibs <rupraibs@aston.ac.uk>
Subject: Transition Network for English Grammar. Possible or not?
X-Nntp-Posting-Host: france.aston.ac.uk
Content-Type: text/plain; charset=us-ascii
Message-ID: <DqsH03.IL3@aston.ac.uk>
Sender: usenet@aston.ac.uk
Content-Transfer-Encoding: 7bit
Organization: Aston University
Mime-Version: 1.0
Date: Thu, 2 May 1996 17:38:26 GMT
X-Mailer: Mozilla 1.1N (X11; I; SunOS 5.4 sun4c)
X-Url: news:comp.ai.nat-lang
Lines: 19

Hi,

I have been trying to find answers to the problems below. If anyone is kind
enough to help, could they mail their reply to me directly at 
rupraibs@aston.ac.uk
as I don't read this newsgroup too often. Thanks.

If it were sufficiently big and complex enough, could a Transition Network be
set up to parse any sentence in the whole of the English Language?
Has the above question been settled or is it still being debated?
If so, what are the arguments given for and against?
Is it a valid objection to say that since there are an infinite number of 
possible sentences, the grammar described by the transition network could never
be satisfactorily tested?
Also, am I right to assume that the grammar could not also accomodate slang
expressions at the same time?

Roop.

