alexr@ucscb.UCSC.EDU (Alexander M. Rosenberg) (12/19/89)
Suppose one wanted to search through text in memory for a string, ignoring case and diacritical marks as appropriate. Okay, fine, use IUMagIDString in your favorite string search algorithm. Problem: Suppose one wanted to use the Boyer-Moore algorithm. This requires that a table be built at run-time based on the pattern we are looking for. How can we build that table so that "matching" entries (i.e. "c", "C", "c w/cedilla", and "C w/cedilla") all get the same value in the table? (If you need to know what I mean by Boyer-Moore, I suggest that you read "Algorithms" by Robert Sedgewick.) -- ------------------------------------------------------------------------------- - Alexander M. Rosenberg - INTERNET: alexr@ucscb.ucsc.edu - Yoyodyne - - 3 Admiral Dr. #453 - UUCP:...!ucbvax!ucscc!ucscb!alexr - Propulsion - - Emeryville, CA 94608 - BITNET:alexr%ucscb@ucscc.BITNET - Systems - - (415) 658-1032 - Disclaimer: Nobody is my employer - :-) - - - so nobody cares what I say. - -