[sword-devel] Searching and Lucene thoughts

Chris Little chrislit at crosswire.org
Wed Mar 2 12:53:57 MST 2005

No. Standard Sword searches just start at the beginning and search to 
the end, byte by byte.

Just on the basis of the abstract you link to, I don't see how this 
would be of any benefit. The Boyer-Moore algorithm is very 
language-specific. It benefits from the fact that English is a 
predominantly suffixing language, as are most European languages, I 
would say. Personally, I have difficulty imagining how this actually 
speeds search times, but I assume they've done testing and that their 
claims are accurate.

The standard linear search is the most general purpose search algorithm, 
and I think general purpose is what we need to maintain. For people who 
want faster searches, there is indexed searching available.


Lynn Allan wrote:
> <alert comment="iwnacsmndipootv ... i was not a computer science major
> ... ">
> Just curious ... does non-indexed sword-api searching use c.s.
> algorithms like Boyer-Moore searching?
> http://portal.acm.org/citation.cfm?id=359859&coll=ACM&dl=ACM&CFID=13545783&CFTOKEN=93236524
> Something I tried to read once (and it was waaaaaay over my head)
> concerned very smart "state machine" searching when there is more than
> one word being searched for. Seems like it involved Bell Lab
> researchers? From one of the A or W or K dudes?
> http://portal.acm.org/citation.cfm?id=360855&coll=ACM&dl=ACM&CFID=13626066&CFTOKEN=93658335
> Does D. Knuth discuss string matching optimizations?
> Would that be applicable to the sword-api?
> </alert>
> _______________________________________________
> sword-devel mailing list
> sword-devel at crosswire.org
> http://www.crosswire.org/mailman/listinfo/sword-devel

More information about the sword-devel mailing list