Nadav Har'El wrote: > Kernigan and Pike in their relatively-new book "The Practice of programming" > give an example very similar to yours, as an example of choosing good > algorithms. Their example involves a spam filter, which takes a given > message and needs to check whether a large number of patterns matches > this text. They demonstrate how the naive implementation (checking the > patterns one by one against the message) is probably the worst approach to > solving this problem.
On behalf of Amazon, I want to thank you for the reference! Also I want to thank you for the practical example, and the comparison between hspell's original language (Perl) and C. By the way: I attended Dan's lecture recently in Haifux, and after that I discussed the option to rewrite the run-time part of hspell in C (not the preparation of the dictionary with all the variations, but the run- time). I plan to do it. If there is already such a project, please let me know; I don't want to re-invent the wheel. -- Eli Marmor [EMAIL PROTECTED] CTO, Founder Netmask (El-Mar) Internet Technologies Ltd. __________________________________________________________ Tel.: +972-9-766-1020 8 Yad-Harutzim St. Fax.: +972-9-766-1314 P.O.B. 7004 Mobile: +972-50-23-7338 Kfar-Saba 44641, Israel ================================================================= To unsubscribe, send mail to [EMAIL PROTECTED] with the word "unsubscribe" in the message body, e.g., run the command echo unsubscribe | mail [EMAIL PROTECTED]
