Common Lisp provides a SEARCH function to lookup given keys in a string, but its implementation can be subotimal: it can be beaten in some cases by even the simpliest brute-force algorithm.

This project is aimed at implementing robust string matching algorithms for Common Lisp.

Features

  • Robust subsequence search algorithm implementations for Common Lisp

Project Samples

Suffix tree for string "banana$" Search algorithm implementations performance (revision 66)

Project Activity

See All Activity >

Categories

Algorithms, Brute Force

License

BSD License

Follow cl-string-match

cl-string-match Web Site

Other Useful Business Software
Cut Cloud Costs with Google Compute Engine Icon
Cut Cloud Costs with Google Compute Engine

Save up to 91% with Spot VMs and get automatic sustained-use discounts. One free VM per month, plus $300 in credits.

Save on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
Try Compute Engine
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of cl-string-match!

Additional Project Details

Intended Audience

Developers

Programming Language

Common Lisp

Related Categories

Common Lisp Algorithms, Common Lisp Brute Force Tool

Registered

2013-01-16
Report inappropriate content