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
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

The database for AI-powered applications.

MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
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
Report inappropriate content