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

Project Activity

See All Activity >

License

BSD License

Follow cl-string-match

cl-string-match Web Site

Other Useful Business Software
Gemini 3 and 200+ AI Models on One Platform Icon
Gemini 3 and 200+ AI Models on One Platform

Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
Start Free
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