Re: Grammar development by example

Chris F Clark <cfc@shell01.TheWorld.com>
18 Jul 2006 01:16:20 -0400

          From comp.compilers

Related articles
Grammar development by example oliver@zeigermann.de (Oliver Zeigermann) (2006-07-16)
Re: Grammar development by example cfc@shell01.TheWorld.com (Chris F Clark) (2006-07-18)
Re: Grammar development by example schmitz@i3s.unice.fr (Sylvain Schmitz) (2006-07-18)
Re: Grammar development by example alpanad@gmail.com (2006-07-18)
| List of all articles for this month |

From: Chris F Clark <cfc@shell01.TheWorld.com>
Newsgroups: comp.compilers
Date: 18 Jul 2006 01:16:20 -0400
Organization: The World Public Access UNIX, Brookline, MA
References: 06-07-022
Keywords: parse

I believe what your are looking for is mostly categorized under the
title "machine learning". I looked at the relevant papers in that
area in the late 90's. However, as I recall much of the work is in
the negative form, i.e. "one cannot learn grammars of the form xyz
without qrst." A typical result is that one cannot even learn
complicated regular expressions without "negative examples" (examples
that say, this isn't a valid sentence)--I believe that is a correct
result. It is certainly a significant area of research in its own
right.


Hope this helps,
-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
23 Bailey Rd voice : (508) 435-5016
Berlin, MA 01503 USA fax : (978) 838-0263 (24 hours)
------------------------------------------------------------------------------



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.