![]() |
Boyer-Moore Search
Hi , is there any version of Boyer-Moore search function that deals with the WildCards feature ?
Thank you all |
Re: Boyer-Moore Search
Well, I don't think so. What do you need it for? Are regular expressions not sufficient?
|
Re: Boyer-Moore Search
Thank you 3_of_8 ,
Zitat:
Is there any other alternative ? |
Re: Boyer-Moore Search
BM is by definition not suitable for wildcards. It uses good and bad suffix tables which are based on exact characters. So the algorithm just won't fit.
You might try looking for a variation of the Knuth-Morris-Pratt algorithm which uses wildcard characters. The KMP uses a DEA which supports wildcards. |
Re: Boyer-Moore Search
What do you mean, doesn't do what you're looking for? If by wildcards you mean placeholders, why would regular expressions not be able to do that?
|
Re: Boyer-Moore Search
@3_of_8:Regular Expressions 'might' be too slow, but I would suggest giving it a try. I would think that the TRegExpr-Implementation is not that bad. However, an optimized KMP* (or something similar) might be much faster, but to be honest, I am too lazy to find that out right now. There should be oodles of implementations out there.
|
Re: Boyer-Moore Search
Look at this
![]() |
Re: Boyer-Moore Search
Zitat:
|
Alle Zeitangaben in WEZ +1. Es ist jetzt 08:02 Uhr. |
Powered by vBulletin® Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
LinkBacks Enabled by vBSEO © 2011, Crawlability, Inc.
Delphi-PRAXiS (c) 2002 - 2023 by Daniel R. Wolf, 2024 by Thomas Breitkreuz