General Levenshtein algorithm and k-bounded Levenshtein distance in linear time and constant space. Implementation in C as UDFs for MySQLπ¬ and MariaDBπ¦
What is the juanmirocks/Levenshtein-MySQL-UDF GitHub project? Description: "General Levenshtein algorithm and k-bounded Levenshtein distance in linear time and constant space. Implementation in C as UDFs for MySQLπ¬ and MariaDBπ¦". Written in C. Explain what it does, its main use cases, key features, and who would benefit from using it.
Question is copied to clipboard β paste it after the AI opens.
Add it to a GitHub README or profile β the card updates as the ranking changes:
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipReport bugs or request features on the Levenshtein-MySQL-UDF issue tracker:
Open GitHub Issues