W3C home > Mailing lists > Public > www-rdf-interest@w3.org > November 2000

Re: Semantic Document Framework(s)

From: <ssarkar@ayushnet.com>
Date: 9 Nov 2000 16:36:40 -0800
Message-ID: <20001110003640.5119.cpmta@c001.snv.cp.net>
To: nferrier@tapsellferrier.co.uk
Cc: sean@mysterylights.com, cagle@olywa.net, aswartz@swartzfam.com, www-rdf-interest@w3.org, www-talk@w3.org, klevy@xmlfund.com
On Thu, 09 November 2000, "Nic Ferrier" wrote:

> 
> >>> "Sean B. Palmer" <sean@mysterylights.com> 09-Nov-00 11:46:44 PM
> >>>
> 
> >[2] English is just a complicated programming language. 
> >At the end of the day it is still processable, if not quite as 
> >easy as SGML/XML systems. With rules etc., it will be made 
> >easier. It's not really AI: just a very very complex system, that 
> >looks like AI. 
> 
> That's not true thought is it? English has to many ambiguities to
> work as a programming language... 
> 
> Although I'm sure it's possible to use a semantically un-ambiguous
> subset of English if you want to you then end up with the problem that
> you make it harder to write (because you've got to remember which bits
> of English you can't use - it's hard being un-ambiguous in English).
> 
> And try parsing the above scentance with a computer program.
> 
> There is a natural language that is computer parsable... I can't
> remember what it's called though.
> 
> 
> Nic Ferrier


Sanskrit is the language from ancient India.  It
is the language of Aryans and origin of all
north Indian languages.  It seems to be the
best known language for computer parsing
having least ambiguity in its grammer.

-- ssarkar@ayushnet.com
Received on Thursday, 9 November 2000 19:37:18 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:46 GMT