|
|
Boost : |
Subject: Re: [boost] [gsoc 2013] Approximate string matching
From: Bjorn Reese (breese_at_[hidden])
Date: 2013-04-13 04:41:47
On 04/12/2013 11:52 AM, Jan Strnad wrote:
> In the matter of NFA implementation, I would probably choose dynamic
> programming approach, but I'm thinking of shift-or algorithm as well.
You may also want to look into Thomson NFAs:
http://swtch.com/~rsc/regexp/regexp1.html
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk