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
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
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