-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Tuesday 28 May 2002 12:51 am, Andrew McNaughton wrote: > > See: > > Combinatorial Algorithms > > Nijenhuis and Wilf > > Academic Press > > 0-12-519260-6 (1975) > > P 240 > > I've got a different problem. I want to auto-link phrases which appear in > a dictionary, but I need to do some pre-processing on candidate phrases > before checking for them in the dictionary (removing line breaks and > punctuation, doing stemming, etc.) If i get a match i want to put an <A> > tag around the phrase. > > Seems like it shouldn't be too hard, but which ever way I go at it it > feels like a messy kludge. Any suggestions? Is the book referenced above > going to help with this one? > > Probably this is off topic. Reply to me personally, and I'll forward to > anyone who asks for it.
One of the best books for this kind of thing is "Mastering Algorithms with Perl". It's got some excellent sections on string matching, stemming, and the like. Details at http://www.oreilly.com/catalog/maperl/ - -- <:->get a SMart net</:-> -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.7 (GNU/Linux) iD8DBQE88ykxVBc71ct6OywRAie/AKCFypNHvtr8V37FFJX5w7ipuFaw0gCg5nCZ n3twYWvDWrseBOsuSAk2dlM= =u9KU -----END PGP SIGNATURE-----
