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
Resolve Support Tickets 2x Faster​ with ServoDesk Icon
Resolve Support Tickets 2x Faster​ with ServoDesk

Full access to Enterprise features. No credit card required.

What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for 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