Path: utzoo!attcan!uunet!wuarchive!zaphod.mps.ohio-state.edu!tut.cis.ohio-state.edu!bgsuvax!maner
From: maner@bgsuvax.UUCP (Walter Maner)
Newsgroups: comp.ai
Subject: Re: Some Sequence Prediction Work (actually, synthesis of regexprs)
Message-ID: <5234@bgsuvax.UUCP>
Date: 4 Dec 89 00:00:41 GMT
References: <11883@phoenix.Princeton.EDU>
Organization: Bowling Green State University B.G., Oh.
Lines: 19

From article <11883@phoenix.Princeton.EDU>, by eliot@phoenix.Princeton.EDU (Eliot Handelman):
> In article <2850@ucrmath.UCR.EDU> xcax12@ucrmath.UCR.EDU () writes:
> 
> ;            I am having a problem with pattern recognition.  I am trying to
> ;write a program that will recognize patterns that are inputted, outputting

It might be less ambitious to investigate the automatic synthesis of regular
expression patterns from examples.  The problem is partly constrained by the
syntax for regexprs and otherwise alleviated by the fact that discovered
patterns could be useful even if they only fuzzy-matched.  Anyone know of
any research which attacks the sequence problem constrained in this way?
WALT


-- 
CSNet    maner@andy.bgsu.edu           | 419/372-8719
InterNet maner@andy.bgsu.edu 129.1.1.2 | BGSU Comp Sci Dept
UUCP     ... !osu-cis!bgsuvax!maner    | Bowling Green, OH 43403
BITNet   MANER@BGSUOPIE


Brought to you by Super Global Mega Corp .com