<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF xmlns="http://usefulinc.com/ns/doap#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><Project><name>ahocorasick</name>
<shortdesc>Aho-Corasick automaton implementation</shortdesc>
<description>The Aho-Corasick automaton is a data structure that can quickly do a multiple-keyword search across text. It's described in the classic paper 'Efficient string matching: an aid to bibliographic search': http://portal.acm.org/citation.cfm?id=360855&amp;dl=ACM&amp;coll=GUIDE. The majority of the code here is adapted from source code from the Fairly Fast Packet Filter (FFPF) project: http://ffpf.sourceforge.net/general/overview.php.</description>
<download-page>http://hkn.eecs.berkeley.edu/~dyoo/python/ahocorasick/ahocorasick-0.9.tar.gz</download-page>
<homepage rdf:resource="http://hkn.eecs.berkeley.edu/~dyoo/python/ahocorasick/" />
<maintainer><foaf:Person><foaf:name>Danny Yoo</foaf:name>
<foaf:mbox_sha1sum>bc909f84bf65a4d634571ab2e40de1b1ef20a4aa</foaf:mbox_sha1sum></foaf:Person></maintainer>
<release><Version><revision>0.9</revision></Version></release>
</Project></rdf:RDF>